./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-lit/sssc12_variant.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 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:20:19,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:20:19,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:20:19,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:20:19,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:20:19,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:20:19,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:20:19,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:20:19,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:20:19,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:20:19,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:20:19,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:20:19,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:20:19,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:20:19,317 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:20:19,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:20:19,318 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:20:19,318 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:20:19,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:20:19,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:20:19,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:20:19,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:20:19,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:20:19,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:20:19,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:20:19,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:20:19,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:20:19,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:20:19,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:20:19,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:20:19,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:20:19,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:20:19,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:20:19,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:20:19,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:20:19,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:20:19,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:20:19,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:20:19,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:20:19,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:20:19,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:20:19,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:20:19,324 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2024-11-10 10:20:19,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:20:19,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:20:19,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:20:19,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:20:19,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:20:19,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2024-11-10 10:20:20,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:20:21,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:20:21,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2024-11-10 10:20:21,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d549b9bf/8d953d7e5d3c4679a5440b4c50612f0e/FLAG241c6b4f2 [2024-11-10 10:20:21,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d549b9bf/8d953d7e5d3c4679a5440b4c50612f0e [2024-11-10 10:20:21,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:20:21,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:20:21,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:21,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:20:21,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:20:21,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:21,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6fb9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21, skipping insertion in model container [2024-11-10 10:20:21,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:21,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:20:21,815 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-lit/sssc12_variant.i[47777,47790] [2024-11-10 10:20:21,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:21,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:20:21,893 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-lit/sssc12_variant.i[47777,47790] [2024-11-10 10:20:21,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:21,948 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:20:21,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21 WrapperNode [2024-11-10 10:20:21,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:21,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:21,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:20:21,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:20:21,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:21,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:21,994 INFO L138 Inliner]: procedures = 272, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2024-11-10 10:20:21,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:21,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:20:21,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:20:21,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:20:22,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,019 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 5, 3]. 50 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 2 writes are split as follows [0, 0, 2]. [2024-11-10 10:20:22,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:20:22,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:20:22,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:20:22,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:20:22,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (1/1) ... [2024-11-10 10:20:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:20:22,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:20:22,080 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) [2024-11-10 10:20:22,085 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 [2024-11-10 10:20:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-11-10 10:20:22,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-11-10 10:20:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:20:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:20:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:20:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:20:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:20:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:20:22,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:20:22,153 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:20:22,300 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:20:22,303 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:20:22,431 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:20:22,431 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:20:22,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:20:22,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:20:22,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:22 BoogieIcfgContainer [2024-11-10 10:20:22,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:20:22,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:20:22,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:20:22,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:20:22,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:20:21" (1/3) ... [2024-11-10 10:20:22,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9036dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:22, skipping insertion in model container [2024-11-10 10:20:22,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:21" (2/3) ... [2024-11-10 10:20:22,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9036dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:22, skipping insertion in model container [2024-11-10 10:20:22,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:22" (3/3) ... [2024-11-10 10:20:22,580 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2024-11-10 10:20:22,593 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:20:22,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:20:22,593 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:20:22,624 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:20:22,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 24 transitions, 52 flow [2024-11-10 10:20:22,673 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-11-10 10:20:22,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:22,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 29 events. 5/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2024-11-10 10:20:22,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 24 transitions, 52 flow [2024-11-10 10:20:22,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 24 transitions, 52 flow [2024-11-10 10:20:22,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:22,689 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;@72dba370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:22,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:20:22,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:22,695 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2024-11-10 10:20:22,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:22,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:22,696 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-10 10:20:22,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:20:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash 690266005, now seen corresponding path program 1 times [2024-11-10 10:20:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:22,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978583665] [2024-11-10 10:20:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:22,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:20:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:22,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:20:22,852 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:20:22,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-10 10:20:22,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-10 10:20:22,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-10 10:20:22,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:20:22,856 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-10 10:20:22,858 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:20:22,858 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:20:22,873 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:20:22,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 40 transitions, 90 flow [2024-11-10 10:20:22,884 INFO L124 PetriNetUnfolderBase]: 9/51 cut-off events. [2024-11-10 10:20:22,884 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:20:22,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 51 events. 9/51 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 36. Up to 6 conditions per place. [2024-11-10 10:20:22,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 40 transitions, 90 flow [2024-11-10 10:20:22,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 40 transitions, 90 flow [2024-11-10 10:20:22,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:22,888 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;@72dba370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:22,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:20:22,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:22,896 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2024-11-10 10:20:22,896 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:20:22,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:22,896 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-10 10:20:22,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:20:22,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 76235323, now seen corresponding path program 1 times [2024-11-10 10:20:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:22,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986844763] [2024-11-10 10:20:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:22,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:22,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:20:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:22,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:20:22,961 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:20:22,962 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-10 10:20:22,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-10 10:20:22,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-10 10:20:22,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:20:22,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:20:22,963 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-10 10:20:22,964 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:20:22,964 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:20:22,988 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:20:22,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 56 transitions, 130 flow [2024-11-10 10:20:23,004 INFO L124 PetriNetUnfolderBase]: 13/73 cut-off events. [2024-11-10 10:20:23,004 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 10:20:23,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 73 events. 13/73 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 151 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 58. Up to 8 conditions per place. [2024-11-10 10:20:23,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 56 transitions, 130 flow [2024-11-10 10:20:23,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 56 transitions, 130 flow [2024-11-10 10:20:23,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:23,008 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;@72dba370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:23,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:20:23,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:23,015 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-11-10 10:20:23,018 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:20:23,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:23,018 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:23,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:20:23,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1846577179, now seen corresponding path program 1 times [2024-11-10 10:20:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476422787] [2024-11-10 10:20:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476422787] [2024-11-10 10:20:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476422787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:23,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:20:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486509514] [2024-11-10 10:20:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:23,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:20:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:23,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:20:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:20:23,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 56 [2024-11-10 10:20:23,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 130 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) [2024-11-10 10:20:23,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:23,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 56 [2024-11-10 10:20:23,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:24,367 INFO L124 PetriNetUnfolderBase]: 6390/10300 cut-off events. [2024-11-10 10:20:24,368 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2024-11-10 10:20:24,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19277 conditions, 10300 events. 6390/10300 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 68965 event pairs, 3798 based on Foata normal form. 2525/12531 useless extension candidates. Maximal degree in co-relation 4193. Up to 6372 conditions per place. [2024-11-10 10:20:24,441 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 48 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-11-10 10:20:24,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 260 flow [2024-11-10 10:20:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:20:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:20:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-10 10:20:24,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-10 10:20:24,455 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 130 flow. Second operand 3 states and 112 transitions. [2024-11-10 10:20:24,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 260 flow [2024-11-10 10:20:24,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 256 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-10 10:20:24,466 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 110 flow [2024-11-10 10:20:24,469 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-11-10 10:20:24,472 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-11-10 10:20:24,473 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 110 flow [2024-11-10 10:20:24,473 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) [2024-11-10 10:20:24,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:24,475 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-10 10:20:24,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:20:24,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:20:24,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2059943680, now seen corresponding path program 1 times [2024-11-10 10:20:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:24,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688126927] [2024-11-10 10:20:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:24,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:20:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:24,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:20:24,509 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:20:24,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 10:20:24,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:20:24,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-10 10:20:24,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-10 10:20:24,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-10 10:20:24,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:20:24,511 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 10:20:24,512 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:20:24,512 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 10:20:24,538 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:20:24,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 72 transitions, 172 flow [2024-11-10 10:20:24,548 INFO L124 PetriNetUnfolderBase]: 17/95 cut-off events. [2024-11-10 10:20:24,549 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 10:20:24,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 95 events. 17/95 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 207 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 85. Up to 10 conditions per place. [2024-11-10 10:20:24,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 72 transitions, 172 flow [2024-11-10 10:20:24,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 72 transitions, 172 flow [2024-11-10 10:20:24,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:24,553 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;@72dba370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:24,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:20:24,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:24,559 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-11-10 10:20:24,559 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:20:24,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:24,559 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:24,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:24,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 5333758, now seen corresponding path program 1 times [2024-11-10 10:20:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:24,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143007745] [2024-11-10 10:20:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143007745] [2024-11-10 10:20:24,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143007745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:24,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:20:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263107899] [2024-11-10 10:20:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:24,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:20:24,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:20:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:20:24,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 72 [2024-11-10 10:20:24,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2024-11-10 10:20:24,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:24,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 72 [2024-11-10 10:20:24,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:32,559 INFO L124 PetriNetUnfolderBase]: 80555/116628 cut-off events. [2024-11-10 10:20:32,559 INFO L125 PetriNetUnfolderBase]: For 8242/8242 co-relation queries the response was YES. [2024-11-10 10:20:32,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221349 conditions, 116628 events. 80555/116628 cut-off events. For 8242/8242 co-relation queries the response was YES. Maximal size of possible extension queue 4158. Compared 900005 event pairs, 48119 based on Foata normal form. 29755/143611 useless extension candidates. Maximal degree in co-relation 19394. Up to 74951 conditions per place. [2024-11-10 10:20:33,290 INFO L140 encePairwiseOnDemand]: 60/72 looper letters, 66 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2024-11-10 10:20:33,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 361 flow [2024-11-10 10:20:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:20:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:20:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-11-10 10:20:33,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6898148148148148 [2024-11-10 10:20:33,292 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 172 flow. Second operand 3 states and 149 transitions. [2024-11-10 10:20:33,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 361 flow [2024-11-10 10:20:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 349 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-10 10:20:33,304 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 144 flow [2024-11-10 10:20:33,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-11-10 10:20:33,306 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-10 10:20:33,306 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 144 flow [2024-11-10 10:20:33,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2024-11-10 10:20:33,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:33,306 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:33,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:20:33,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 237794087, now seen corresponding path program 1 times [2024-11-10 10:20:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029521449] [2024-11-10 10:20:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:20:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029521449] [2024-11-10 10:20:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029521449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:33,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:20:33,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444691145] [2024-11-10 10:20:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:33,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:20:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:20:33,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:20:33,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 72 [2024-11-10 10:20:33,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2024-11-10 10:20:33,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:33,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 72 [2024-11-10 10:20:33,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:40,075 INFO L124 PetriNetUnfolderBase]: 71510/102896 cut-off events. [2024-11-10 10:20:40,075 INFO L125 PetriNetUnfolderBase]: For 10041/10041 co-relation queries the response was YES. [2024-11-10 10:20:40,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201300 conditions, 102896 events. 71510/102896 cut-off events. For 10041/10041 co-relation queries the response was YES. Maximal size of possible extension queue 3682. Compared 777172 event pairs, 42410 based on Foata normal form. 0/100488 useless extension candidates. Maximal degree in co-relation 137864. Up to 66449 conditions per place. [2024-11-10 10:20:40,795 INFO L140 encePairwiseOnDemand]: 69/72 looper letters, 63 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2024-11-10 10:20:40,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 338 flow [2024-11-10 10:20:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:20:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:20:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-11-10 10:20:40,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2024-11-10 10:20:40,797 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 144 flow. Second operand 3 states and 129 transitions. [2024-11-10 10:20:40,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 338 flow [2024-11-10 10:20:40,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:20:40,818 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2024-11-10 10:20:40,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-10 10:20:40,820 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-11-10 10:20:40,821 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2024-11-10 10:20:40,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2024-11-10 10:20:40,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:40,822 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:40,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:20:40,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:20:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash 86743780, now seen corresponding path program 1 times [2024-11-10 10:20:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58295246] [2024-11-10 10:20:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:40,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:20:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:40,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:20:40,855 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:20:40,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-10 10:20:40,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:20:40,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-10 10:20:40,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-10 10:20:40,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-10 10:20:40,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:20:40,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:20:40,856 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 10:20:40,858 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:20:40,858 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-10 10:20:40,895 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:20:40,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 88 transitions, 216 flow [2024-11-10 10:20:40,909 INFO L124 PetriNetUnfolderBase]: 21/117 cut-off events. [2024-11-10 10:20:40,909 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 10:20:40,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 117 events. 21/117 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 277 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 113. Up to 12 conditions per place. [2024-11-10 10:20:40,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 88 transitions, 216 flow [2024-11-10 10:20:40,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 88 transitions, 216 flow [2024-11-10 10:20:40,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:40,915 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;@72dba370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:40,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 10:20:40,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:40,919 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-11-10 10:20:40,919 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:20:40,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:40,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:40,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:20:40,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2044873915, now seen corresponding path program 1 times [2024-11-10 10:20:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:40,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776647973] [2024-11-10 10:20:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:41,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:41,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776647973] [2024-11-10 10:20:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776647973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:41,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:20:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713348601] [2024-11-10 10:20:41,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:20:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:41,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:20:41,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:20:41,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2024-11-10 10:20:41,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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) [2024-11-10 10:20:41,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:41,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2024-11-10 10:20:41,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand