./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.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 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:18:28,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:18:28,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:18:28,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:18:28,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:18:28,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:18:28,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:18:28,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:18:28,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:18:28,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:18:28,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:18:28,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:18:28,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:18:28,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:18:28,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:18:28,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:18:28,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:18:28,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:18:28,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:18:28,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:18:28,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:18:28,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:18:28,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:18:28,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:18:28,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:18:28,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:18:28,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:18:28,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:18:28,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:18:28,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:18:28,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:18:28,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:18:28,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:18:28,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:18:28,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:18:28,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:18:28,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:18:28,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:18:28,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:18:28,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:18:28,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:18:28,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:18:28,873 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 -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2024-11-20 09:18:29,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:18:29,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:18:29,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:18:29,103 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:18:29,103 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:18:29,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-20 09:18:30,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:18:30,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:18:30,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-20 09:18:30,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27adb139e/cc0eca9cc73641e1a2cd2f0de0b1996e/FLAG89390e8da [2024-11-20 09:18:30,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27adb139e/cc0eca9cc73641e1a2cd2f0de0b1996e [2024-11-20 09:18:30,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:18:30,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:18:30,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:18:30,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:18:30,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:18:30,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:18:30" (1/1) ... [2024-11-20 09:18:30,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a30b54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:30, skipping insertion in model container [2024-11-20 09:18:30,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:18:30" (1/1) ... [2024-11-20 09:18:30,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:18:30,887 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-atomic/lamport.i[32541,32554] [2024-11-20 09:18:30,896 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-atomic/lamport.i[32909,32922] [2024-11-20 09:18:30,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:18:30,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:18:30,961 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-atomic/lamport.i[32541,32554] [2024-11-20 09:18:30,967 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-atomic/lamport.i[32909,32922] [2024-11-20 09:18:30,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:18:31,003 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:18:31,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31 WrapperNode [2024-11-20 09:18:31,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:18:31,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:18:31,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:18:31,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:18:31,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,040 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-11-20 09:18:31,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:18:31,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:18:31,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:18:31,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:18:31,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,070 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 09:18:31,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:18:31,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:18:31,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:18:31,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:18:31,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (1/1) ... [2024-11-20 09:18:31,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:18:31,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:18:31,122 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-20 09:18:31,125 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-20 09:18:31,165 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-20 09:18:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-20 09:18:31,165 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-20 09:18:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-20 09:18:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:18:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:18:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:18:31,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:18:31,168 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:18:31,264 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:18:31,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:18:31,379 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:18:31,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:18:31,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:18:31,427 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-20 09:18:31,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:18:31 BoogieIcfgContainer [2024-11-20 09:18:31,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:18:31,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:18:31,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:18:31,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:18:31,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:18:30" (1/3) ... [2024-11-20 09:18:31,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e58a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:18:31, skipping insertion in model container [2024-11-20 09:18:31,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:18:31" (2/3) ... [2024-11-20 09:18:31,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e58a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:18:31, skipping insertion in model container [2024-11-20 09:18:31,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:18:31" (3/3) ... [2024-11-20 09:18:31,434 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-11-20 09:18:31,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:18:31,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 09:18:31,446 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:18:31,486 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 09:18:31,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 70 transitions, 154 flow [2024-11-20 09:18:31,537 INFO L124 PetriNetUnfolderBase]: 18/68 cut-off events. [2024-11-20 09:18:31,537 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 09:18:31,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 68 events. 18/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 169 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2024-11-20 09:18:31,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 70 transitions, 154 flow [2024-11-20 09:18:31,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 66 transitions, 141 flow [2024-11-20 09:18:31,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:18:31,559 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;@500ea0a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:18:31,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-20 09:18:31,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:18:31,566 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-11-20 09:18:31,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:18:31,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:31,567 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:18:31,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:31,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1168811722, now seen corresponding path program 1 times [2024-11-20 09:18:31,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003453293] [2024-11-20 09:18:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:31,712 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-20 09:18:31,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003453293] [2024-11-20 09:18:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003453293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:31,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:18:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44894556] [2024-11-20 09:18:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:31,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:18:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:31,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:18:31,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:18:31,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 70 [2024-11-20 09:18:31,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 66 transitions, 141 flow. Second operand has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 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-20 09:18:31,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:31,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 70 [2024-11-20 09:18:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:31,873 INFO L124 PetriNetUnfolderBase]: 126/341 cut-off events. [2024-11-20 09:18:31,874 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-20 09:18:31,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 341 events. 126/341 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1587 event pairs, 34 based on Foata normal form. 59/325 useless extension candidates. Maximal degree in co-relation 459. Up to 137 conditions per place. [2024-11-20 09:18:31,881 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 14 selfloop transitions, 0 changer transitions 0/60 dead transitions. [2024-11-20 09:18:31,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 157 flow [2024-11-20 09:18:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:18:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-20 09:18:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2024-11-20 09:18:31,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2024-11-20 09:18:31,893 INFO L175 Difference]: Start difference. First operand has 55 places, 66 transitions, 141 flow. Second operand 2 states and 116 transitions. [2024-11-20 09:18:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 157 flow [2024-11-20 09:18:31,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 09:18:31,897 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 124 flow [2024-11-20 09:18:31,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=60} [2024-11-20 09:18:31,900 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2024-11-20 09:18:31,901 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 124 flow [2024-11-20 09:18:31,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 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-20 09:18:31,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:31,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:18:31,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:18:31,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:31,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1154901182, now seen corresponding path program 1 times [2024-11-20 09:18:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:31,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320552477] [2024-11-20 09:18:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:31,977 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-20 09:18:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320552477] [2024-11-20 09:18:31,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320552477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:31,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:31,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225184472] [2024-11-20 09:18:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:31,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:31,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:31,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-20 09:18:31,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 60 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-20 09:18:31,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:31,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-20 09:18:31,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:32,061 INFO L124 PetriNetUnfolderBase]: 204/496 cut-off events. [2024-11-20 09:18:32,062 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-20 09:18:32,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 496 events. 204/496 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2704 event pairs, 40 based on Foata normal form. 18/434 useless extension candidates. Maximal degree in co-relation 767. Up to 154 conditions per place. [2024-11-20 09:18:32,068 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 22 selfloop transitions, 3 changer transitions 1/68 dead transitions. [2024-11-20 09:18:32,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 193 flow [2024-11-20 09:18:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-11-20 09:18:32,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-11-20 09:18:32,071 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 124 flow. Second operand 3 states and 160 transitions. [2024-11-20 09:18:32,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 193 flow [2024-11-20 09:18:32,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 09:18:32,075 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 144 flow [2024-11-20 09:18:32,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, 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=57, PETRI_TRANSITIONS=61} [2024-11-20 09:18:32,077 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2024-11-20 09:18:32,078 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 144 flow [2024-11-20 09:18:32,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-20 09:18:32,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:32,078 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:18:32,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:18:32,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:32,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1149312553, now seen corresponding path program 1 times [2024-11-20 09:18:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:32,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653321497] [2024-11-20 09:18:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:32,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:32,137 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-20 09:18:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653321497] [2024-11-20 09:18:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653321497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:32,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:32,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:32,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188356822] [2024-11-20 09:18:32,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:32,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:32,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:32,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-20 09:18:32,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-20 09:18:32,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:32,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-20 09:18:32,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:32,220 INFO L124 PetriNetUnfolderBase]: 212/518 cut-off events. [2024-11-20 09:18:32,221 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-20 09:18:32,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 518 events. 212/518 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2870 event pairs, 59 based on Foata normal form. 17/447 useless extension candidates. Maximal degree in co-relation 912. Up to 207 conditions per place. [2024-11-20 09:18:32,224 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 21 selfloop transitions, 2 changer transitions 3/68 dead transitions. [2024-11-20 09:18:32,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 211 flow [2024-11-20 09:18:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-11-20 09:18:32,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-11-20 09:18:32,226 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 144 flow. Second operand 3 states and 160 transitions. [2024-11-20 09:18:32,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 211 flow [2024-11-20 09:18:32,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:18:32,228 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 148 flow [2024-11-20 09:18:32,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2024-11-20 09:18:32,231 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-11-20 09:18:32,231 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 148 flow [2024-11-20 09:18:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-20 09:18:32,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:32,231 INFO L204 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, 1] [2024-11-20 09:18:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:18:32,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:32,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1000099017, now seen corresponding path program 1 times [2024-11-20 09:18:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268870198] [2024-11-20 09:18:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:32,303 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-20 09:18:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268870198] [2024-11-20 09:18:32,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268870198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:32,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:32,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:32,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849701140] [2024-11-20 09:18:32,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:32,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:32,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:32,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:32,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:32,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 70 [2024-11-20 09:18:32,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-20 09:18:32,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:32,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 70 [2024-11-20 09:18:32,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:32,414 INFO L124 PetriNetUnfolderBase]: 406/925 cut-off events. [2024-11-20 09:18:32,414 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-20 09:18:32,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 925 events. 406/925 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5710 event pairs, 142 based on Foata normal form. 15/865 useless extension candidates. Maximal degree in co-relation 1624. Up to 431 conditions per place. [2024-11-20 09:18:32,419 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 27 selfloop transitions, 5 changer transitions 1/71 dead transitions. [2024-11-20 09:18:32,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 236 flow [2024-11-20 09:18:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-20 09:18:32,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-11-20 09:18:32,422 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 148 flow. Second operand 3 states and 155 transitions. [2024-11-20 09:18:32,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 236 flow [2024-11-20 09:18:32,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 09:18:32,426 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 192 flow [2024-11-20 09:18:32,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2024-11-20 09:18:32,427 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2024-11-20 09:18:32,428 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 192 flow [2024-11-20 09:18:32,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-20 09:18:32,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:32,429 INFO L204 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, 1] [2024-11-20 09:18:32,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:18:32,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:32,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1261944621, now seen corresponding path program 2 times [2024-11-20 09:18:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985207238] [2024-11-20 09:18:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:32,473 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-20 09:18:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:32,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985207238] [2024-11-20 09:18:32,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985207238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:32,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:32,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:32,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094921339] [2024-11-20 09:18:32,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:32,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:32,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:32,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 70 [2024-11-20 09:18:32,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-20 09:18:32,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:32,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 70 [2024-11-20 09:18:32,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:32,623 INFO L124 PetriNetUnfolderBase]: 557/1395 cut-off events. [2024-11-20 09:18:32,623 INFO L125 PetriNetUnfolderBase]: For 180/197 co-relation queries the response was YES. [2024-11-20 09:18:32,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 1395 events. 557/1395 cut-off events. For 180/197 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10050 event pairs, 145 based on Foata normal form. 20/1261 useless extension candidates. Maximal degree in co-relation 2637. Up to 351 conditions per place. [2024-11-20 09:18:32,629 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 27 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-11-20 09:18:32,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 277 flow [2024-11-20 09:18:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-11-20 09:18:32,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-11-20 09:18:32,631 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 192 flow. Second operand 3 states and 161 transitions. [2024-11-20 09:18:32,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 277 flow [2024-11-20 09:18:32,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:18:32,634 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 210 flow [2024-11-20 09:18:32,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2024-11-20 09:18:32,635 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-11-20 09:18:32,635 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 210 flow [2024-11-20 09:18:32,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-20 09:18:32,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:32,635 INFO L204 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, 1] [2024-11-20 09:18:32,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:18:32,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:32,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1595243137, now seen corresponding path program 3 times [2024-11-20 09:18:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:32,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676717116] [2024-11-20 09:18:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:32,666 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-20 09:18:32,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:32,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676717116] [2024-11-20 09:18:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676717116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:32,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437385083] [2024-11-20 09:18:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:32,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:32,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:32,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:32,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:32,696 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 70 [2024-11-20 09:18:32,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-20 09:18:32,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:32,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 70 [2024-11-20 09:18:32,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:32,799 INFO L124 PetriNetUnfolderBase]: 598/1533 cut-off events. [2024-11-20 09:18:32,799 INFO L125 PetriNetUnfolderBase]: For 352/406 co-relation queries the response was YES. [2024-11-20 09:18:32,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 1533 events. 598/1533 cut-off events. For 352/406 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11311 event pairs, 249 based on Foata normal form. 61/1516 useless extension candidates. Maximal degree in co-relation 3201. Up to 694 conditions per place. [2024-11-20 09:18:32,805 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 23 selfloop transitions, 5 changer transitions 9/77 dead transitions. [2024-11-20 09:18:32,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 309 flow [2024-11-20 09:18:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-11-20 09:18:32,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-20 09:18:32,806 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 210 flow. Second operand 3 states and 154 transitions. [2024-11-20 09:18:32,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 309 flow [2024-11-20 09:18:32,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:18:32,810 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 226 flow [2024-11-20 09:18:32,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-11-20 09:18:32,811 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2024-11-20 09:18:32,811 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 226 flow [2024-11-20 09:18:32,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-20 09:18:32,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:32,811 INFO L204 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, 1] [2024-11-20 09:18:32,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:18:32,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:32,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1374516727, now seen corresponding path program 4 times [2024-11-20 09:18:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:32,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978447269] [2024-11-20 09:18:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:32,849 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-20 09:18:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:32,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978447269] [2024-11-20 09:18:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978447269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:32,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:32,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339365417] [2024-11-20 09:18:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:32,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:32,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:32,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:32,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 70 [2024-11-20 09:18:32,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-20 09:18:32,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:32,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 70 [2024-11-20 09:18:32,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:32,949 INFO L124 PetriNetUnfolderBase]: 355/1113 cut-off events. [2024-11-20 09:18:32,949 INFO L125 PetriNetUnfolderBase]: For 396/440 co-relation queries the response was YES. [2024-11-20 09:18:32,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 1113 events. 355/1113 cut-off events. For 396/440 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8535 event pairs, 115 based on Foata normal form. 42/1072 useless extension candidates. Maximal degree in co-relation 2380. Up to 256 conditions per place. [2024-11-20 09:18:32,953 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 26 selfloop transitions, 3 changer transitions 2/74 dead transitions. [2024-11-20 09:18:32,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 313 flow [2024-11-20 09:18:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-20 09:18:32,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7571428571428571 [2024-11-20 09:18:32,956 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 226 flow. Second operand 3 states and 159 transitions. [2024-11-20 09:18:32,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 313 flow [2024-11-20 09:18:32,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:18:32,959 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 232 flow [2024-11-20 09:18:32,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2024-11-20 09:18:32,962 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2024-11-20 09:18:32,962 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 232 flow [2024-11-20 09:18:32,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-20 09:18:32,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:32,962 INFO L204 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, 1, 1, 1, 1] [2024-11-20 09:18:32,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:18:32,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:32,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:32,963 INFO L85 PathProgramCache]: Analyzing trace with hash -545199775, now seen corresponding path program 1 times [2024-11-20 09:18:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:32,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932495905] [2024-11-20 09:18:32,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:33,008 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-20 09:18:33,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932495905] [2024-11-20 09:18:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932495905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:33,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:33,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:33,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631978962] [2024-11-20 09:18:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:33,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:33,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:33,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-20 09:18:33,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-20 09:18:33,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:33,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-20 09:18:33,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:33,084 INFO L124 PetriNetUnfolderBase]: 314/1015 cut-off events. [2024-11-20 09:18:33,084 INFO L125 PetriNetUnfolderBase]: For 249/288 co-relation queries the response was YES. [2024-11-20 09:18:33,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 1015 events. 314/1015 cut-off events. For 249/288 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7679 event pairs, 146 based on Foata normal form. 13/968 useless extension candidates. Maximal degree in co-relation 2162. Up to 355 conditions per place. [2024-11-20 09:18:33,088 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 17 selfloop transitions, 4 changer transitions 1/69 dead transitions. [2024-11-20 09:18:33,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 287 flow [2024-11-20 09:18:33,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-11-20 09:18:33,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-20 09:18:33,090 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 232 flow. Second operand 3 states and 154 transitions. [2024-11-20 09:18:33,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 287 flow [2024-11-20 09:18:33,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 275 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-20 09:18:33,093 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 234 flow [2024-11-20 09:18:33,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-11-20 09:18:33,095 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2024-11-20 09:18:33,095 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 234 flow [2024-11-20 09:18:33,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-20 09:18:33,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:18:33,096 INFO L204 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, 1, 1, 1, 1] [2024-11-20 09:18:33,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:18:33,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:18:33,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:18:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash -173349181, now seen corresponding path program 1 times [2024-11-20 09:18:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:18:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230563644] [2024-11-20 09:18:33,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:18:33,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:18:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:18:33,131 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-20 09:18:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:18:33,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230563644] [2024-11-20 09:18:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230563644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:18:33,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:18:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:18:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647906702] [2024-11-20 09:18:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:18:33,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:18:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:18:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:18:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:18:33,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-20 09:18:33,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-20 09:18:33,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:18:33,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-20 09:18:33,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:18:33,201 INFO L124 PetriNetUnfolderBase]: 303/947 cut-off events. [2024-11-20 09:18:33,201 INFO L125 PetriNetUnfolderBase]: For 172/201 co-relation queries the response was YES. [2024-11-20 09:18:33,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 947 events. 303/947 cut-off events. For 172/201 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6481 event pairs, 94 based on Foata normal form. 15/907 useless extension candidates. Maximal degree in co-relation 2054. Up to 325 conditions per place. [2024-11-20 09:18:33,204 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 0 selfloop transitions, 0 changer transitions 66/66 dead transitions. [2024-11-20 09:18:33,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 282 flow [2024-11-20 09:18:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:18:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:18:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-20 09:18:33,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-11-20 09:18:33,205 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 234 flow. Second operand 3 states and 155 transitions. [2024-11-20 09:18:33,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 282 flow [2024-11-20 09:18:33,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 272 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 09:18:33,207 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2024-11-20 09:18:33,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2024-11-20 09:18:33,208 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2024-11-20 09:18:33,208 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2024-11-20 09:18:33,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-20 09:18:33,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-20 09:18:33,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-20 09:18:33,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-20 09:18:33,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-20 09:18:33,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-20 09:18:33,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-20 09:18:33,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:18:33,214 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-20 09:18:33,220 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 09:18:33,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:18:33,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:18:33 BasicIcfg [2024-11-20 09:18:33,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:18:33,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:18:33,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:18:33,226 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:18:33,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:18:31" (3/4) ... [2024-11-20 09:18:33,228 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 09:18:33,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-11-20 09:18:33,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-11-20 09:18:33,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-11-20 09:18:33,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-20 09:18:33,234 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 09:18:33,234 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 09:18:33,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 09:18:33,296 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 09:18:33,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:18:33,297 INFO L158 Benchmark]: Toolchain (without parser) took 2781.31ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 75.5MB in the beginning and 82.7MB in the end (delta: -7.2MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2024-11-20 09:18:33,297 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:18:33,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.42ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 75.2MB in the beginning and 176.1MB in the end (delta: -100.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-20 09:18:33,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.47ms. Allocated memory is still 211.8MB. Free memory was 176.1MB in the beginning and 174.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:18:33,298 INFO L158 Benchmark]: Boogie Preprocessor took 48.10ms. Allocated memory is still 211.8MB. Free memory was 174.0MB in the beginning and 171.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:18:33,298 INFO L158 Benchmark]: RCFGBuilder took 336.61ms. Allocated memory is still 211.8MB. Free memory was 171.9MB in the beginning and 153.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 09:18:33,298 INFO L158 Benchmark]: TraceAbstraction took 1796.88ms. Allocated memory is still 211.8MB. Free memory was 152.0MB in the beginning and 86.9MB in the end (delta: 65.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-11-20 09:18:33,298 INFO L158 Benchmark]: Witness Printer took 70.38ms. Allocated memory is still 211.8MB. Free memory was 86.9MB in the beginning and 82.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:18:33,300 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.42ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 75.2MB in the beginning and 176.1MB in the end (delta: -100.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.47ms. Allocated memory is still 211.8MB. Free memory was 176.1MB in the beginning and 174.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.10ms. Allocated memory is still 211.8MB. Free memory was 174.0MB in the beginning and 171.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 336.61ms. Allocated memory is still 211.8MB. Free memory was 171.9MB in the beginning and 153.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1796.88ms. Allocated memory is still 211.8MB. Free memory was 152.0MB in the beginning and 86.9MB in the end (delta: 65.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * Witness Printer took 70.38ms. Allocated memory is still 211.8MB. Free memory was 86.9MB in the beginning and 82.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 781]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 755]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 99 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 26 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=8, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 09:18:33,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE