./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:12:25,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:12:25,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:12:25,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:12:25,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:12:25,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:12:25,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:12:25,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:12:25,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:12:25,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:12:25,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:12:25,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:12:25,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:12:25,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:12:25,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:12:25,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:12:25,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:12:25,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:12:25,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:12:25,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:12:25,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:12:25,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:12:25,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:12:25,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:12:25,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:12:25,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2025-03-14 01:12:25,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:12:25,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:12:25,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:12:25,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:12:25,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:12:25,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-14 01:12:26,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feda1fd08/919170a790b44445a2369da56c1ef62f/FLAGebd39fd3e [2025-03-14 01:12:27,127 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:12:27,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-14 01:12:27,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feda1fd08/919170a790b44445a2369da56c1ef62f/FLAGebd39fd3e [2025-03-14 01:12:27,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feda1fd08/919170a790b44445a2369da56c1ef62f [2025-03-14 01:12:27,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:12:27,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:12:27,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:12:27,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:12:27,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:12:27,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aab1d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27, skipping insertion in model container [2025-03-14 01:12:27,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:12:27,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30451,30464] [2025-03-14 01:12:27,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30681,30694] [2025-03-14 01:12:27,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30979,30992] [2025-03-14 01:12:27,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:12:27,680 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:12:27,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30451,30464] [2025-03-14 01:12:27,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30681,30694] [2025-03-14 01:12:27,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i[30979,30992] [2025-03-14 01:12:27,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:12:27,744 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:12:27,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27 WrapperNode [2025-03-14 01:12:27,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:12:27,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:12:27,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:12:27,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:12:27,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,772 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2025-03-14 01:12:27,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:12:27,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:12:27,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:12:27,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:12:27,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,795 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-03-14 01:12:27,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:12:27,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:12:27,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:12:27,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:12:27,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (1/1) ... [2025-03-14 01:12:27,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:12:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:27,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:12:27,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 01:12:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 01:12:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:12:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:12:27,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:12:27,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:12:27,869 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:12:28,001 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:12:28,003 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:12:28,243 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-03-14 01:12:28,244 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:12:28,244 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:12:28,244 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:12:28,492 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:12:28,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:12:28 BoogieIcfgContainer [2025-03-14 01:12:28,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:12:28,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:12:28,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:12:28,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:12:28,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:12:27" (1/3) ... [2025-03-14 01:12:28,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ddb8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:12:28, skipping insertion in model container [2025-03-14 01:12:28,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:27" (2/3) ... [2025-03-14 01:12:28,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ddb8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:12:28, skipping insertion in model container [2025-03-14 01:12:28,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:12:28" (3/3) ... [2025-03-14 01:12:28,501 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-03-14 01:12:28,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:12:28,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 39 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-14 01:12:28,513 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:12:28,561 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:12:28,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 106 flow [2025-03-14 01:12:28,609 INFO L124 PetriNetUnfolderBase]: 8/44 cut-off events. [2025-03-14 01:12:28,611 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:12:28,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 8/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 113 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-14 01:12:28,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 46 transitions, 106 flow [2025-03-14 01:12:28,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 42 transitions, 93 flow [2025-03-14 01:12:28,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:12:28,634 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c216205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:12:28,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 01:12:28,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:12:28,641 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2025-03-14 01:12:28,641 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:12:28,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:28,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:28,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:28,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -165542558, now seen corresponding path program 1 times [2025-03-14 01:12:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855728623] [2025-03-14 01:12:28,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:28,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-14 01:12:28,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-14 01:12:28,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:28,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:29,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:29,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855728623] [2025-03-14 01:12:29,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855728623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:29,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:29,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742683928] [2025-03-14 01:12:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:29,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:29,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:29,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-14 01:12:29,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:29,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:29,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-14 01:12:29,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:29,345 INFO L124 PetriNetUnfolderBase]: 402/717 cut-off events. [2025-03-14 01:12:29,347 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:12:29,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 717 events. 402/717 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3445 event pairs, 299 based on Foata normal form. 65/688 useless extension candidates. Maximal degree in co-relation 1329. Up to 631 conditions per place. [2025-03-14 01:12:29,356 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 26 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-03-14 01:12:29,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 137 flow [2025-03-14 01:12:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-14 01:12:29,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-14 01:12:29,367 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 93 flow. Second operand 3 states and 69 transitions. [2025-03-14 01:12:29,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 137 flow [2025-03-14 01:12:29,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:12:29,374 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 80 flow [2025-03-14 01:12:29,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-03-14 01:12:29,379 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2025-03-14 01:12:29,380 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 80 flow [2025-03-14 01:12:29,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:29,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:29,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:29,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:12:29,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash -836883431, now seen corresponding path program 1 times [2025-03-14 01:12:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427676411] [2025-03-14 01:12:29,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:29,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 01:12:29,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 01:12:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427676411] [2025-03-14 01:12:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427676411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:12:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439413494] [2025-03-14 01:12:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:29,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:29,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:29,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-14 01:12:29,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:29,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:29,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-14 01:12:29,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:29,679 INFO L124 PetriNetUnfolderBase]: 565/1028 cut-off events. [2025-03-14 01:12:29,679 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:12:29,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 1028 events. 565/1028 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4954 event pairs, 149 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1939. Up to 572 conditions per place. [2025-03-14 01:12:29,686 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 44 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-14 01:12:29,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 213 flow [2025-03-14 01:12:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-14 01:12:29,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2025-03-14 01:12:29,688 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 80 flow. Second operand 3 states and 86 transitions. [2025-03-14 01:12:29,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 213 flow [2025-03-14 01:12:29,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:29,690 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 91 flow [2025-03-14 01:12:29,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-14 01:12:29,690 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-03-14 01:12:29,691 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 91 flow [2025-03-14 01:12:29,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:29,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:29,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:29,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:12:29,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -468011740, now seen corresponding path program 1 times [2025-03-14 01:12:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189212051] [2025-03-14 01:12:29,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:29,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 01:12:29,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 01:12:29,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:29,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:29,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189212051] [2025-03-14 01:12:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189212051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:29,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:29,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:12:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876405019] [2025-03-14 01:12:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:29,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:29,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:29,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-14 01:12:29,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:29,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:29,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-14 01:12:29,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:29,908 INFO L124 PetriNetUnfolderBase]: 691/1293 cut-off events. [2025-03-14 01:12:29,909 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-14 01:12:29,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 1293 events. 691/1293 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6140 event pairs, 285 based on Foata normal form. 27/1214 useless extension candidates. Maximal degree in co-relation 2492. Up to 572 conditions per place. [2025-03-14 01:12:29,914 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 44 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2025-03-14 01:12:29,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 234 flow [2025-03-14 01:12:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-14 01:12:29,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-03-14 01:12:29,917 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 91 flow. Second operand 3 states and 90 transitions. [2025-03-14 01:12:29,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 234 flow [2025-03-14 01:12:29,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:29,921 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 104 flow [2025-03-14 01:12:29,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-03-14 01:12:29,922 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-03-14 01:12:29,922 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 104 flow [2025-03-14 01:12:29,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:29,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:29,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:29,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:12:29,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:29,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1056508108, now seen corresponding path program 1 times [2025-03-14 01:12:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416240807] [2025-03-14 01:12:29,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:29,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 01:12:29,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 01:12:29,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:29,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416240807] [2025-03-14 01:12:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416240807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:12:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663591783] [2025-03-14 01:12:30,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:30,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:12:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:30,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:12:30,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:12:30,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-14 01:12:30,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:30,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:30,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-14 01:12:30,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:30,284 INFO L124 PetriNetUnfolderBase]: 939/1717 cut-off events. [2025-03-14 01:12:30,284 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-14 01:12:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 1717 events. 939/1717 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8944 event pairs, 407 based on Foata normal form. 12/1606 useless extension candidates. Maximal degree in co-relation 3494. Up to 1153 conditions per place. [2025-03-14 01:12:30,294 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 78 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2025-03-14 01:12:30,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 94 transitions, 404 flow [2025-03-14 01:12:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:12:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:12:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-03-14 01:12:30,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546583850931677 [2025-03-14 01:12:30,296 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 104 flow. Second operand 7 states and 176 transitions. [2025-03-14 01:12:30,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 94 transitions, 404 flow [2025-03-14 01:12:30,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:30,298 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 150 flow [2025-03-14 01:12:30,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-14 01:12:30,299 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-03-14 01:12:30,299 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 150 flow [2025-03-14 01:12:30,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:30,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:30,299 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:30,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:12:30,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:30,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash 536074362, now seen corresponding path program 1 times [2025-03-14 01:12:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:30,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950115123] [2025-03-14 01:12:30,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:30,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:12:30,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:12:30,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:30,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950115123] [2025-03-14 01:12:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950115123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:30,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:30,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757527108] [2025-03-14 01:12:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:30,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:30,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:30,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:30,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-14 01:12:30,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:30,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:30,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-14 01:12:30,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:30,463 INFO L124 PetriNetUnfolderBase]: 756/1446 cut-off events. [2025-03-14 01:12:30,463 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2025-03-14 01:12:30,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3137 conditions, 1446 events. 756/1446 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7173 event pairs, 254 based on Foata normal form. 42/1440 useless extension candidates. Maximal degree in co-relation 3123. Up to 732 conditions per place. [2025-03-14 01:12:30,469 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 43 selfloop transitions, 3 changer transitions 3/59 dead transitions. [2025-03-14 01:12:30,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 283 flow [2025-03-14 01:12:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-14 01:12:30,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2025-03-14 01:12:30,470 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 150 flow. Second operand 3 states and 82 transitions. [2025-03-14 01:12:30,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 283 flow [2025-03-14 01:12:30,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:30,472 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2025-03-14 01:12:30,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-03-14 01:12:30,473 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-14 01:12:30,473 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2025-03-14 01:12:30,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:30,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:30,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:30,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:12:30,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:30,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -702499345, now seen corresponding path program 1 times [2025-03-14 01:12:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:30,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317907453] [2025-03-14 01:12:30,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:30,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:30,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:12:30,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:12:30,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:30,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317907453] [2025-03-14 01:12:30,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317907453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:30,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:30,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:30,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775170284] [2025-03-14 01:12:30,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:30,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:30,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:30,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:30,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:30,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-14 01:12:30,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:30,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:30,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-14 01:12:30,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:30,652 INFO L124 PetriNetUnfolderBase]: 412/903 cut-off events. [2025-03-14 01:12:30,652 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-03-14 01:12:30,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 903 events. 412/903 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3991 event pairs, 128 based on Foata normal form. 46/923 useless extension candidates. Maximal degree in co-relation 2002. Up to 410 conditions per place. [2025-03-14 01:12:30,656 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 39 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-03-14 01:12:30,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 276 flow [2025-03-14 01:12:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-14 01:12:30,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2025-03-14 01:12:30,658 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 3 states and 81 transitions. [2025-03-14 01:12:30,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 276 flow [2025-03-14 01:12:30,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:12:30,661 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 158 flow [2025-03-14 01:12:30,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-03-14 01:12:30,662 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-14 01:12:30,663 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 158 flow [2025-03-14 01:12:30,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:30,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:30,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:30,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:12:30,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:30,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1760864508, now seen corresponding path program 1 times [2025-03-14 01:12:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:30,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485773886] [2025-03-14 01:12:30,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:30,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:12:30,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:12:30,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-14 01:12:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94038196] [2025-03-14 01:12:30,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:30,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:30,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:30,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:12:30,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:12:30,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:12:30,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:30,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:30,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:12:30,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:30,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 01:12:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:31,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:12:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485773886] [2025-03-14 01:12:31,203 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 01:12:31,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94038196] [2025-03-14 01:12:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94038196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:12:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320151851] [2025-03-14 01:12:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:31,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:12:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:31,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:12:31,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:12:31,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-14 01:12:31,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:31,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:31,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-14 01:12:31,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:31,508 INFO L124 PetriNetUnfolderBase]: 476/1013 cut-off events. [2025-03-14 01:12:31,509 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2025-03-14 01:12:31,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1013 events. 476/1013 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4372 event pairs, 92 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2363. Up to 422 conditions per place. [2025-03-14 01:12:31,513 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 71 selfloop transitions, 9 changer transitions 11/103 dead transitions. [2025-03-14 01:12:31,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 515 flow [2025-03-14 01:12:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:12:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:12:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-03-14 01:12:31,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-14 01:12:31,515 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 158 flow. Second operand 9 states and 207 transitions. [2025-03-14 01:12:31,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 515 flow [2025-03-14 01:12:31,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:31,520 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 209 flow [2025-03-14 01:12:31,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=209, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-03-14 01:12:31,522 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2025-03-14 01:12:31,522 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 209 flow [2025-03-14 01:12:31,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:31,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:31,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:31,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:31,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:31,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:31,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash 757741697, now seen corresponding path program 1 times [2025-03-14 01:12:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813225065] [2025-03-14 01:12:31,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:31,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:12:31,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:12:31,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:31,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813225065] [2025-03-14 01:12:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813225065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:31,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:31,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176176137] [2025-03-14 01:12:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:12:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:31,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:12:31,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:12:31,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2025-03-14 01:12:31,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:31,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:31,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2025-03-14 01:12:31,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:31,931 INFO L124 PetriNetUnfolderBase]: 482/1005 cut-off events. [2025-03-14 01:12:31,932 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-14 01:12:31,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 1005 events. 482/1005 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4275 event pairs, 369 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 2439. Up to 828 conditions per place. [2025-03-14 01:12:31,937 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 36 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-03-14 01:12:31,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 279 flow [2025-03-14 01:12:31,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-14 01:12:31,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2025-03-14 01:12:31,939 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 209 flow. Second operand 3 states and 64 transitions. [2025-03-14 01:12:31,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 279 flow [2025-03-14 01:12:31,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 48 transitions, 269 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 01:12:31,943 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 197 flow [2025-03-14 01:12:31,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2025-03-14 01:12:31,944 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2025-03-14 01:12:31,945 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 197 flow [2025-03-14 01:12:31,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:31,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:31,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:31,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:12:31,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:31,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash 238351922, now seen corresponding path program 1 times [2025-03-14 01:12:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:31,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479034139] [2025-03-14 01:12:31,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:31,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:12:31,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:12:31,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:31,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:32,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:32,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479034139] [2025-03-14 01:12:32,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479034139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:32,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:12:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459443134] [2025-03-14 01:12:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:32,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:12:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:32,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:12:32,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:12:32,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-14 01:12:32,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:32,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:32,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-14 01:12:32,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:32,276 INFO L124 PetriNetUnfolderBase]: 513/1026 cut-off events. [2025-03-14 01:12:32,276 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2025-03-14 01:12:32,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 1026 events. 513/1026 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4215 event pairs, 232 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2516. Up to 582 conditions per place. [2025-03-14 01:12:32,280 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 54 selfloop transitions, 11 changer transitions 5/79 dead transitions. [2025-03-14 01:12:32,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 424 flow [2025-03-14 01:12:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:12:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:12:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-14 01:12:32,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2025-03-14 01:12:32,281 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 197 flow. Second operand 6 states and 137 transitions. [2025-03-14 01:12:32,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 424 flow [2025-03-14 01:12:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:32,283 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 221 flow [2025-03-14 01:12:32,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-03-14 01:12:32,284 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2025-03-14 01:12:32,284 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 221 flow [2025-03-14 01:12:32,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:32,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:32,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:32,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:12:32,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:12:32,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:32,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1294782968, now seen corresponding path program 1 times [2025-03-14 01:12:32,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:32,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067036243] [2025-03-14 01:12:32,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:32,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:32,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:12:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:12:32,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:32,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-14 01:12:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446612442] [2025-03-14 01:12:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:32,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:32,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:32,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:32,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:12:32,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:12:32,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:12:32,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:32,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:32,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-14 01:12:32,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:33,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-14 01:12:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:33,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:40,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 466 treesize of output 446 [2025-03-14 01:12:40,252 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-14 01:12:40,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 496 treesize of output 427 [2025-03-14 01:12:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:52,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:52,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067036243] [2025-03-14 01:12:52,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 01:12:52,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446612442] [2025-03-14 01:12:52,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446612442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:52,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:12:52,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2025-03-14 01:12:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347645711] [2025-03-14 01:12:52,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:52,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 01:12:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:52,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 01:12:52,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-03-14 01:12:52,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2025-03-14 01:12:52,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 221 flow. Second operand has 27 states, 27 states have (on average 13.37037037037037) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:52,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:52,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2025-03-14 01:12:52,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:08,989 WARN L286 SmtUtils]: Spent 15.43s on a formula simplification. DAG size of input: 139 DAG size of output: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 01:13:24,303 WARN L286 SmtUtils]: Spent 13.52s on a formula simplification. DAG size of input: 136 DAG size of output: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 01:13:47,514 WARN L286 SmtUtils]: Spent 21.79s on a formula simplification. DAG size of input: 131 DAG size of output: 121 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 01:14:08,217 WARN L286 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 136 DAG size of output: 127 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)