/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 16:53:53,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 16:53:53,849 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 16:53:53,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 16:53:53,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 16:53:53,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 16:53:53,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 16:53:53,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 16:53:53,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 16:53:53,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 16:53:53,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 16:53:53,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 16:53:53,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 16:53:53,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 16:53:53,883 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 16:53:53,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 16:53:53,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 16:53:53,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 16:53:53,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 16:53:53,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 16:53:53,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 16:53:53,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 16:53:53,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:53,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:53,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:53,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 16:53:53,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 16:53:54,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 16:53:54,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 16:53:54,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 16:53:54,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 16:53:54,115 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 16:53:54,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2025-04-13 16:53:55,365 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ed705fe/43f875c13a894bd484e0a7e0b31f272a/FLAG259b880f6 [2025-04-13 16:53:55,631 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 16:53:55,631 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2025-04-13 16:53:55,640 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ed705fe/43f875c13a894bd484e0a7e0b31f272a/FLAG259b880f6 [2025-04-13 16:53:56,415 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ed705fe/43f875c13a894bd484e0a7e0b31f272a [2025-04-13 16:53:56,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 16:53:56,418 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 16:53:56,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:56,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 16:53:56,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 16:53:56,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4accbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56, skipping insertion in model container [2025-04-13 16:53:56,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 16:53:56,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2025-04-13 16:53:56,748 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2025-04-13 16:53:56,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2025-04-13 16:53:56,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:56,765 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 16:53:56,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2025-04-13 16:53:56,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2025-04-13 16:53:56,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2025-04-13 16:53:56,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:56,866 INFO L204 MainTranslator]: Completed translation [2025-04-13 16:53:56,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56 WrapperNode [2025-04-13 16:53:56,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:56,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:56,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 16:53:56,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 16:53:56,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,912 INFO L138 Inliner]: procedures = 274, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-04-13 16:53:56,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:56,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 16:53:56,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 16:53:56,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 16:53:56,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,945 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-04-13 16:53:56,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 16:53:56,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 16:53:56,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 16:53:56,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 16:53:56,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (1/1) ... [2025-04-13 16:53:56,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:56,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:56,991 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 16:53:56,994 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 16:53:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 16:53:57,009 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 16:53:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 16:53:57,009 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 16:53:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 16:53:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 16:53:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 16:53:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 16:53:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 16:53:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 16:53:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 16:53:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 16:53:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 16:53:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 16:53:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 16:53:57,012 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 16:53:57,109 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 16:53:57,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 16:53:57,428 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 16:53:57,430 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 16:53:57,430 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 16:53:57,886 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:57,887 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:57,890 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 16:53:57,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:57 BoogieIcfgContainer [2025-04-13 16:53:57,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 16:53:57,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 16:53:57,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 16:53:57,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 16:53:57,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:53:56" (1/3) ... [2025-04-13 16:53:57,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cb379b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:57, skipping insertion in model container [2025-04-13 16:53:57,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:56" (2/3) ... [2025-04-13 16:53:57,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cb379b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:57, skipping insertion in model container [2025-04-13 16:53:57,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:57" (3/3) ... [2025-04-13 16:53:57,904 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-04-13 16:53:57,914 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 16:53:57,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 29 locations, 32 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-13 16:53:57,915 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 16:53:57,972 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 16:53:57,988 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 34 transitions, 82 flow [2025-04-13 16:53:58,014 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 172 states, 168 states have (on average 2.6488095238095237) internal successors, (445), 171 states have internal predecessors, (445), 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 16:53:58,032 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 16:53:58,042 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;@4ee268a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 16:53:58,042 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 16:53:58,048 INFO L278 IsEmpty]: Start isEmpty. Operand has 172 states, 168 states have (on average 2.6488095238095237) internal successors, (445), 171 states have internal predecessors, (445), 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 16:53:58,050 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-04-13 16:53:58,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:58,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-04-13 16:53:58,051 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:53:58,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:58,054 INFO L85 PathProgramCache]: Analyzing trace with hash 23636, now seen corresponding path program 1 times [2025-04-13 16:53:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:58,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798819418] [2025-04-13 16:53:58,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:58,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 16:53:58,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 16:53:58,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:58,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:58,154 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 16:53:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:58,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798819418] [2025-04-13 16:53:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798819418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:58,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 16:53:58,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710938250] [2025-04-13 16:53:58,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:58,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 16:53:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:58,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 16:53:58,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 16:53:58,177 INFO L87 Difference]: Start difference. First operand has 172 states, 168 states have (on average 2.6488095238095237) internal successors, (445), 171 states have internal predecessors, (445), 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 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 16:53:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:58,247 INFO L93 Difference]: Finished difference Result 200 states and 487 transitions. [2025-04-13 16:53:58,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 16:53:58,248 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 2 [2025-04-13 16:53:58,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:58,256 INFO L225 Difference]: With dead ends: 200 [2025-04-13 16:53:58,256 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 16:53:58,258 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 16:53:58,262 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:58,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 16:53:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-04-13 16:53:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 167 states have (on average 2.431137724550898) internal successors, (406), 169 states have internal predecessors, (406), 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 16:53:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 406 transitions. [2025-04-13 16:53:58,301 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 406 transitions. Word has length 2 [2025-04-13 16:53:58,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:58,301 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 406 transitions. [2025-04-13 16:53:58,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 16:53:58,301 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 406 transitions. [2025-04-13 16:53:58,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 16:53:58,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:58,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 16:53:58,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 16:53:58,302 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:53:58,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash 707146991, now seen corresponding path program 1 times [2025-04-13 16:53:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:58,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182340059] [2025-04-13 16:53:58,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:58,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 16:53:58,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 16:53:58,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:58,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:58,905 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 16:53:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:58,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182340059] [2025-04-13 16:53:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182340059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 16:53:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631608943] [2025-04-13 16:53:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:58,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:58,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:58,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:58,908 INFO L87 Difference]: Start difference. First operand 170 states and 406 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 16:53:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:58,989 INFO L93 Difference]: Finished difference Result 194 states and 464 transitions. [2025-04-13 16:53:58,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:58,990 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-04-13 16:53:58,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:58,991 INFO L225 Difference]: With dead ends: 194 [2025-04-13 16:53:58,992 INFO L226 Difference]: Without dead ends: 178 [2025-04-13 16:53:58,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:53:58,992 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:58,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-04-13 16:53:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-04-13 16:53:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 2.474285714285714) internal successors, (433), 177 states have internal predecessors, (433), 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 16:53:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 433 transitions. [2025-04-13 16:53:59,010 INFO L79 Accepts]: Start accepts. Automaton has 178 states and 433 transitions. Word has length 5 [2025-04-13 16:53:59,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:59,010 INFO L485 AbstractCegarLoop]: Abstraction has 178 states and 433 transitions. [2025-04-13 16:53:59,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 16:53:59,010 INFO L278 IsEmpty]: Start isEmpty. Operand 178 states and 433 transitions. [2025-04-13 16:53:59,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 16:53:59,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:59,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:59,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 16:53:59,011 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:53:59,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 951154967, now seen corresponding path program 1 times [2025-04-13 16:53:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:59,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442207392] [2025-04-13 16:53:59,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:59,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 16:53:59,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 16:53:59,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:59,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:59,097 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 16:53:59,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:59,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442207392] [2025-04-13 16:53:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442207392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:59,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:59,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 16:53:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830249769] [2025-04-13 16:53:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:59,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:59,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:59,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:59,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:59,098 INFO L87 Difference]: Start difference. First operand 178 states and 433 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 16:53:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:59,154 INFO L93 Difference]: Finished difference Result 213 states and 511 transitions. [2025-04-13 16:53:59,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:59,155 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-04-13 16:53:59,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:59,157 INFO L225 Difference]: With dead ends: 213 [2025-04-13 16:53:59,158 INFO L226 Difference]: Without dead ends: 190 [2025-04-13 16:53:59,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:53:59,159 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:59,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-13 16:53:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-04-13 16:53:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 2.4202127659574466) internal successors, (455), 189 states have internal predecessors, (455), 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 16:53:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 455 transitions. [2025-04-13 16:53:59,170 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 455 transitions. Word has length 7 [2025-04-13 16:53:59,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:59,170 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 455 transitions. [2025-04-13 16:53:59,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 16:53:59,170 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 455 transitions. [2025-04-13 16:53:59,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 16:53:59,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:59,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:59,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 16:53:59,171 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:53:59,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1958622874, now seen corresponding path program 1 times [2025-04-13 16:53:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:59,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520796538] [2025-04-13 16:53:59,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:59,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 16:53:59,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 16:53:59,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:59,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:59,293 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 16:53:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:59,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520796538] [2025-04-13 16:53:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520796538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 16:53:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903183148] [2025-04-13 16:53:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:59,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:59,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:59,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:59,294 INFO L87 Difference]: Start difference. First operand 190 states and 455 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:53:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:59,362 INFO L93 Difference]: Finished difference Result 269 states and 648 transitions. [2025-04-13 16:53:59,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:59,365 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-13 16:53:59,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:59,366 INFO L225 Difference]: With dead ends: 269 [2025-04-13 16:53:59,366 INFO L226 Difference]: Without dead ends: 160 [2025-04-13 16:53:59,366 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 16:53:59,367 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:59,367 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-13 16:53:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2025-04-13 16:53:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 2.2569444444444446) internal successors, (325), 147 states have internal predecessors, (325), 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 16:53:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 325 transitions. [2025-04-13 16:53:59,375 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 325 transitions. Word has length 10 [2025-04-13 16:53:59,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:59,375 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 325 transitions. [2025-04-13 16:53:59,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:53:59,375 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 325 transitions. [2025-04-13 16:53:59,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 16:53:59,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:59,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:59,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 16:53:59,376 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:53:59,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash 587783946, now seen corresponding path program 1 times [2025-04-13 16:53:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:59,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417816561] [2025-04-13 16:53:59,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:59,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:59,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 16:53:59,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 16:53:59,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:59,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:59,917 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 16:53:59,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:59,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417816561] [2025-04-13 16:53:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417816561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:59,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 16:53:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875881712] [2025-04-13 16:53:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:59,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 16:53:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:59,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 16:53:59,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:53:59,918 INFO L87 Difference]: Start difference. First operand 148 states and 325 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:53:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:59,990 INFO L93 Difference]: Finished difference Result 148 states and 325 transitions. [2025-04-13 16:53:59,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:59,991 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-04-13 16:53:59,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:59,992 INFO L225 Difference]: With dead ends: 148 [2025-04-13 16:53:59,992 INFO L226 Difference]: Without dead ends: 136 [2025-04-13 16:53:59,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:53:59,992 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:59,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-13 16:53:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2025-04-13 16:53:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 2.234375) internal successors, (286), 129 states have internal predecessors, (286), 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 16:53:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 286 transitions. [2025-04-13 16:53:59,999 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 286 transitions. Word has length 11 [2025-04-13 16:53:59,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:59,999 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 286 transitions. [2025-04-13 16:53:59,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:54:00,000 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 286 transitions. [2025-04-13 16:54:00,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:54:00,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:00,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:00,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 16:54:00,000 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:00,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash 776382398, now seen corresponding path program 1 times [2025-04-13 16:54:00,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:00,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610005710] [2025-04-13 16:54:00,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:00,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 16:54:00,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:54:00,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:00,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:00,938 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 16:54:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:00,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610005710] [2025-04-13 16:54:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610005710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 16:54:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820908896] [2025-04-13 16:54:00,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:00,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:54:00,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:00,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:54:00,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:00,940 INFO L87 Difference]: Start difference. First operand 130 states and 286 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:01,104 INFO L93 Difference]: Finished difference Result 177 states and 384 transitions. [2025-04-13 16:54:01,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 16:54:01,104 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-04-13 16:54:01,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:01,105 INFO L225 Difference]: With dead ends: 177 [2025-04-13 16:54:01,105 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 16:54:01,106 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:01,106 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:01,106 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:54:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 16:54:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2025-04-13 16:54:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 2.2151898734177213) internal successors, (350), 159 states have internal predecessors, (350), 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 16:54:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 350 transitions. [2025-04-13 16:54:01,117 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 350 transitions. Word has length 15 [2025-04-13 16:54:01,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:01,118 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 350 transitions. [2025-04-13 16:54:01,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:01,118 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 350 transitions. [2025-04-13 16:54:01,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:54:01,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:01,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:01,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 16:54:01,119 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:01,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1757839792, now seen corresponding path program 2 times [2025-04-13 16:54:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:01,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120786474] [2025-04-13 16:54:01,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:54:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:01,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-13 16:54:01,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:54:01,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 16:54:01,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:01,813 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 16:54:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:01,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120786474] [2025-04-13 16:54:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120786474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:01,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:01,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 16:54:01,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468118112] [2025-04-13 16:54:01,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:01,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:54:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:01,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:54:01,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:01,814 INFO L87 Difference]: Start difference. First operand 160 states and 350 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:02,096 INFO L93 Difference]: Finished difference Result 226 states and 491 transitions. [2025-04-13 16:54:02,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 16:54:02,096 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-04-13 16:54:02,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:02,098 INFO L225 Difference]: With dead ends: 226 [2025-04-13 16:54:02,098 INFO L226 Difference]: Without dead ends: 219 [2025-04-13 16:54:02,098 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-13 16:54:02,098 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:02,098 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:54:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-13 16:54:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 181. [2025-04-13 16:54:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.217877094972067) internal successors, (397), 180 states have internal predecessors, (397), 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 16:54:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 397 transitions. [2025-04-13 16:54:02,107 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 397 transitions. Word has length 15 [2025-04-13 16:54:02,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:02,107 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 397 transitions. [2025-04-13 16:54:02,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:02,107 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 397 transitions. [2025-04-13 16:54:02,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 16:54:02,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:02,108 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:02,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 16:54:02,108 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:02,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1823497539, now seen corresponding path program 1 times [2025-04-13 16:54:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:02,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123636022] [2025-04-13 16:54:02,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:02,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 16:54:02,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 16:54:02,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:02,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 16:54:02,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 16:54:02,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 16:54:02,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 16:54:02,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:02,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 16:54:02,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 16:54:02,233 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 16:54:02,234 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 16:54:02,235 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 16:54:02,235 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 16:54:02,235 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 16:54:02,236 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 16:54:02,236 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 16:54:02,236 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 16:54:02,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 16:54:02,238 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:02,306 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 16:54:02,307 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 16:54:02,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:54:02 BasicIcfg [2025-04-13 16:54:02,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 16:54:02,310 INFO L158 Benchmark]: Toolchain (without parser) took 5891.90ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 108.4MB in the beginning and 321.8MB in the end (delta: -213.4MB). Peak memory consumption was 180.7MB. Max. memory is 8.0GB. [2025-04-13 16:54:02,310 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 16:54:02,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.11ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 74.9MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 16:54:02,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.24ms. Allocated memory is still 155.2MB. Free memory was 74.9MB in the beginning and 71.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 16:54:02,310 INFO L158 Benchmark]: Boogie Preprocessor took 49.09ms. Allocated memory is still 155.2MB. Free memory was 71.5MB in the beginning and 68.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 16:54:02,310 INFO L158 Benchmark]: RCFGBuilder took 935.72ms. Allocated memory is still 155.2MB. Free memory was 68.1MB in the beginning and 110.9MB in the end (delta: -42.8MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. [2025-04-13 16:54:02,311 INFO L158 Benchmark]: TraceAbstraction took 4409.62ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 110.9MB in the beginning and 321.8MB in the end (delta: -211.0MB). Peak memory consumption was 181.1MB. Max. memory is 8.0GB. [2025-04-13 16:54:02,312 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.11ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 74.9MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.24ms. Allocated memory is still 155.2MB. Free memory was 74.9MB in the beginning and 71.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.09ms. Allocated memory is still 155.2MB. Free memory was 71.5MB in the beginning and 68.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 935.72ms. Allocated memory is still 155.2MB. Free memory was 68.1MB in the beginning and 110.9MB in the end (delta: -42.8MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4409.62ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 110.9MB in the beginning and 321.8MB in the end (delta: -211.0MB). Peak memory consumption was 181.1MB. 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: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 [L1018] COND TRUE 1 i<((20)-1) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: 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: 1064]: 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: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 59 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 574 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 0 mSDtfsCounter, 574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=3, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 1145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 16:54:02,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...