./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:26:44,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:26:44,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:26:44,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:26:44,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:26:44,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:26:44,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:26:44,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:26:44,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:26:44,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:26:44,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:26:44,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:26:44,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:26:44,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:26:44,244 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:26:44,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:26:44,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:26:44,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:26:44,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:26:44,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:26:44,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:26:44,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:26:44,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:26:44,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:26:44,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:26:44,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:26:44,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:26:44,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:26:44,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:26:44,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:26:44,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:26:44,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:26:44,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:26:44,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:26:44,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:26:44,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:26:44,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:26:44,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:26:44,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:26:44,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:26:44,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:26:44,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:26:44,252 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-clean/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-clean/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 -> 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab [2024-10-11 14:26:44,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:26:44,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:26:44,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:26:44,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:26:44,480 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:26:44,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2024-10-11 14:26:45,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:26:45,855 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:26:45,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2024-10-11 14:26:45,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ced0f967/98f3047cf0ae481ba5f3212c131767fe/FLAGf561ddfc4 [2024-10-11 14:26:45,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ced0f967/98f3047cf0ae481ba5f3212c131767fe [2024-10-11 14:26:45,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:26:45,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:26:45,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:26:45,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:26:45,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:26:45,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:45" (1/1) ... [2024-10-11 14:26:45,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d2b04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:45, skipping insertion in model container [2024-10-11 14:26:45,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:45" (1/1) ... [2024-10-11 14:26:45,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:26:46,043 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3520,3533] [2024-10-11 14:26:46,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:26:46,055 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:26:46,086 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3520,3533] [2024-10-11 14:26:46,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:26:46,110 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:26:46,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46 WrapperNode [2024-10-11 14:26:46,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:26:46,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:26:46,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:26:46,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:26:46,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,150 INFO L138 Inliner]: procedures = 22, calls = 30, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 345 [2024-10-11 14:26:46,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:26:46,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:26:46,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:26:46,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:26:46,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,175 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-10-11 14:26:46,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:26:46,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:26:46,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:26:46,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:26:46,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (1/1) ... [2024-10-11 14:26:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:26:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:26:46,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:26:46,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:26:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:26:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:26:46,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:26:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:26:46,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:26:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:26:46,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:26:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:26:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:26:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:26:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:26:46,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:26:46,276 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:26:46,381 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:26:46,382 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:26:46,828 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:26:46,828 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:26:47,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:26:47,205 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:26:47,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:47 BoogieIcfgContainer [2024-10-11 14:26:47,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:26:47,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:26:47,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:26:47,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:26:47,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:26:45" (1/3) ... [2024-10-11 14:26:47,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc8b2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:47, skipping insertion in model container [2024-10-11 14:26:47,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:46" (2/3) ... [2024-10-11 14:26:47,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc8b2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:47, skipping insertion in model container [2024-10-11 14:26:47,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:47" (3/3) ... [2024-10-11 14:26:47,214 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2024-10-11 14:26:47,228 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:26:47,228 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:26:47,229 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:26:47,297 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 14:26:47,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 71 flow [2024-10-11 14:26:47,356 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 14:26:47,357 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:26:47,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-10-11 14:26:47,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 71 flow [2024-10-11 14:26:47,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 21 transitions, 60 flow [2024-10-11 14:26:47,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:26:47,381 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;@d5928cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:26:47,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:26:47,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:26:47,394 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-10-11 14:26:47,394 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:26:47,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:26:47,394 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] [2024-10-11 14:26:47,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:26:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:26:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1240816726, now seen corresponding path program 1 times [2024-10-11 14:26:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:26:47,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264386129] [2024-10-11 14:26:47,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:26:47,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:26:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:26:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:26:50,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:26:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264386129] [2024-10-11 14:26:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264386129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:26:50,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:26:50,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:26:50,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312868523] [2024-10-11 14:26:50,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:26:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:26:50,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:26:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:26:50,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:26:50,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-10-11 14:26:50,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:50,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:26:50,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-10-11 14:26:50,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:26:50,559 INFO L124 PetriNetUnfolderBase]: 178/331 cut-off events. [2024-10-11 14:26:50,559 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-11 14:26:50,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 331 events. 178/331 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1253 event pairs, 10 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 634. Up to 110 conditions per place. [2024-10-11 14:26:50,564 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 34 selfloop transitions, 6 changer transitions 8/52 dead transitions. [2024-10-11 14:26:50,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 248 flow [2024-10-11 14:26:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:26:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:26:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-10-11 14:26:50,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6066666666666667 [2024-10-11 14:26:50,575 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 60 flow. Second operand 6 states and 91 transitions. [2024-10-11 14:26:50,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 248 flow [2024-10-11 14:26:50,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 14:26:50,580 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 81 flow [2024-10-11 14:26:50,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-10-11 14:26:50,585 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2024-10-11 14:26:50,585 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 81 flow [2024-10-11 14:26:50,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:50,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:26:50,586 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] [2024-10-11 14:26:50,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:26:50,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:26:50,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:26:50,587 INFO L85 PathProgramCache]: Analyzing trace with hash 983283916, now seen corresponding path program 2 times [2024-10-11 14:26:50,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:26:50,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069886719] [2024-10-11 14:26:50,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:26:50,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:26:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:26:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:26:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:26:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069886719] [2024-10-11 14:26:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069886719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:26:52,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:26:52,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:26:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449575479] [2024-10-11 14:26:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:26:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:26:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:26:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:26:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:26:52,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-10-11 14:26:52,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:52,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:26:52,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-10-11 14:26:52,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:26:52,426 INFO L124 PetriNetUnfolderBase]: 194/366 cut-off events. [2024-10-11 14:26:52,427 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-10-11 14:26:52,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 366 events. 194/366 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1501 event pairs, 28 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 857. Up to 151 conditions per place. [2024-10-11 14:26:52,430 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 33 selfloop transitions, 6 changer transitions 12/55 dead transitions. [2024-10-11 14:26:52,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 262 flow [2024-10-11 14:26:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:26:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:26:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-10-11 14:26:52,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-10-11 14:26:52,432 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 81 flow. Second operand 6 states and 93 transitions. [2024-10-11 14:26:52,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 262 flow [2024-10-11 14:26:52,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 258 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 14:26:52,433 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 92 flow [2024-10-11 14:26:52,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2024-10-11 14:26:52,434 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-10-11 14:26:52,434 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 92 flow [2024-10-11 14:26:52,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:52,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:26:52,435 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] [2024-10-11 14:26:52,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:26:52,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:26:52,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:26:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 376897736, now seen corresponding path program 3 times [2024-10-11 14:26:52,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:26:52,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768136766] [2024-10-11 14:26:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:26:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:26:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:26:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:26:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:26:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768136766] [2024-10-11 14:26:54,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768136766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:26:54,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:26:54,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:26:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156546704] [2024-10-11 14:26:54,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:26:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:26:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:26:54,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:26:54,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:26:54,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-10-11 14:26:54,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:54,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:26:54,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-10-11 14:26:54,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:26:54,525 INFO L124 PetriNetUnfolderBase]: 189/370 cut-off events. [2024-10-11 14:26:54,525 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2024-10-11 14:26:54,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 370 events. 189/370 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1573 event pairs, 26 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 915. Up to 190 conditions per place. [2024-10-11 14:26:54,528 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 6 changer transitions 9/46 dead transitions. [2024-10-11 14:26:54,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 246 flow [2024-10-11 14:26:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:26:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:26:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-10-11 14:26:54,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.608 [2024-10-11 14:26:54,531 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 92 flow. Second operand 5 states and 76 transitions. [2024-10-11 14:26:54,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 246 flow [2024-10-11 14:26:54,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 218 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-10-11 14:26:54,534 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 101 flow [2024-10-11 14:26:54,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2024-10-11 14:26:54,536 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-10-11 14:26:54,536 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 101 flow [2024-10-11 14:26:54,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:54,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:26:54,536 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] [2024-10-11 14:26:54,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:26:54,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:26:54,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:26:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1172443060, now seen corresponding path program 4 times [2024-10-11 14:26:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:26:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639550578] [2024-10-11 14:26:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:26:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:26:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:26:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:26:55,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:26:55,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639550578] [2024-10-11 14:26:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639550578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:26:55,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:26:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:26:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468476163] [2024-10-11 14:26:55,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:26:55,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:26:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:26:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:26:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:26:55,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-10-11 14:26:55,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:55,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:26:55,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-10-11 14:26:55,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:26:56,211 INFO L124 PetriNetUnfolderBase]: 138/270 cut-off events. [2024-10-11 14:26:56,211 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-10-11 14:26:56,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 270 events. 138/270 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 987 event pairs, 9 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 199. Up to 93 conditions per place. [2024-10-11 14:26:56,213 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 30 selfloop transitions, 5 changer transitions 11/50 dead transitions. [2024-10-11 14:26:56,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 259 flow [2024-10-11 14:26:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:26:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:26:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-10-11 14:26:56,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2024-10-11 14:26:56,218 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 101 flow. Second operand 6 states and 88 transitions. [2024-10-11 14:26:56,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 259 flow [2024-10-11 14:26:56,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 250 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 14:26:56,221 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 105 flow [2024-10-11 14:26:56,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2024-10-11 14:26:56,221 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-10-11 14:26:56,222 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 105 flow [2024-10-11 14:26:56,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:56,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:26:56,222 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] [2024-10-11 14:26:56,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:26:56,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:26:56,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:26:56,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1069722780, now seen corresponding path program 5 times [2024-10-11 14:26:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:26:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490876537] [2024-10-11 14:26:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:26:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:26:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:26:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:26:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:26:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490876537] [2024-10-11 14:26:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490876537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:26:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:26:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:26:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33377363] [2024-10-11 14:26:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:26:57,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:26:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:26:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:26:57,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:26:57,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-10-11 14:26:57,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:57,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:26:57,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-10-11 14:26:57,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:26:57,452 INFO L124 PetriNetUnfolderBase]: 85/173 cut-off events. [2024-10-11 14:26:57,453 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2024-10-11 14:26:57,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 173 events. 85/173 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 538 event pairs, 5 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 471. Up to 69 conditions per place. [2024-10-11 14:26:57,454 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 19 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2024-10-11 14:26:57,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 218 flow [2024-10-11 14:26:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:26:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:26:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-10-11 14:26:57,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-11 14:26:57,458 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 105 flow. Second operand 6 states and 80 transitions. [2024-10-11 14:26:57,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 218 flow [2024-10-11 14:26:57,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 196 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-10-11 14:26:57,460 INFO L231 Difference]: Finished difference. Result has 42 places, 21 transitions, 73 flow [2024-10-11 14:26:57,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=73, PETRI_PLACES=42, PETRI_TRANSITIONS=21} [2024-10-11 14:26:57,461 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-10-11 14:26:57,461 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 21 transitions, 73 flow [2024-10-11 14:26:57,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:57,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:26:57,462 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] [2024-10-11 14:26:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:26:57,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:26:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:26:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1522683396, now seen corresponding path program 6 times [2024-10-11 14:26:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:26:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534700485] [2024-10-11 14:26:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:26:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:26:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:26:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:26:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:26:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534700485] [2024-10-11 14:26:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534700485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:26:58,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:26:58,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:26:58,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303758415] [2024-10-11 14:26:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:26:58,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:26:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:26:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:26:58,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:26:58,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-10-11 14:26:58,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 21 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:58,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:26:58,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-10-11 14:26:58,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:26:58,703 INFO L124 PetriNetUnfolderBase]: 42/89 cut-off events. [2024-10-11 14:26:58,703 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-10-11 14:26:58,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 89 events. 42/89 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 185 event pairs, 0 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 238. Up to 54 conditions per place. [2024-10-11 14:26:58,703 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2024-10-11 14:26:58,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 26 transitions, 128 flow [2024-10-11 14:26:58,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:26:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:26:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-10-11 14:26:58,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-10-11 14:26:58,704 INFO L175 Difference]: Start difference. First operand has 42 places, 21 transitions, 73 flow. Second operand 6 states and 66 transitions. [2024-10-11 14:26:58,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 26 transitions, 128 flow [2024-10-11 14:26:58,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 114 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-10-11 14:26:58,705 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2024-10-11 14:26:58,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2024-10-11 14:26:58,706 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-10-11 14:26:58,706 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 0 transitions, 0 flow [2024-10-11 14:26:58,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 14:26:58,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-10-11 14:26:58,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-10-11 14:26:58,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-11 14:26:58,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-11 14:26:58,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:26:58,709 INFO L407 BasicCegarLoop]: Path program histogram: [6] [2024-10-11 14:26:58,712 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:26:58,712 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:26:58,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:26:58 BasicIcfg [2024-10-11 14:26:58,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:26:58,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:26:58,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:26:58,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:26:58,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:47" (3/4) ... [2024-10-11 14:26:58,718 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:26:58,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 14:26:58,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 14:26:58,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 14:26:58,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 96 nodes and edges [2024-10-11 14:26:58,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 14:26:58,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 14:26:58,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 14:26:58,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:26:58,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:26:58,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:26:58,815 INFO L158 Benchmark]: Toolchain (without parser) took 12939.37ms. Allocated memory was 155.2MB in the beginning and 767.6MB in the end (delta: 612.4MB). Free memory was 83.1MB in the beginning and 553.4MB in the end (delta: -470.3MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2024-10-11 14:26:58,815 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:26:58,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.73ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 82.8MB in the beginning and 177.8MB in the end (delta: -95.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-10-11 14:26:58,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.63ms. Allocated memory is still 205.5MB. Free memory was 177.8MB in the beginning and 174.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:26:58,816 INFO L158 Benchmark]: Boogie Preprocessor took 45.78ms. Allocated memory is still 205.5MB. Free memory was 174.7MB in the beginning and 171.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:26:58,816 INFO L158 Benchmark]: RCFGBuilder took 1004.18ms. Allocated memory is still 205.5MB. Free memory was 171.5MB in the beginning and 137.8MB in the end (delta: 33.7MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2024-10-11 14:26:58,816 INFO L158 Benchmark]: TraceAbstraction took 11507.69ms. Allocated memory was 205.5MB in the beginning and 767.6MB in the end (delta: 562.0MB). Free memory was 136.8MB in the beginning and 558.6MB in the end (delta: -421.8MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. [2024-10-11 14:26:58,818 INFO L158 Benchmark]: Witness Printer took 98.34ms. Allocated memory is still 767.6MB. Free memory was 558.6MB in the beginning and 553.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 14:26:58,819 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.17ms. Allocated memory is still 155.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.73ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 82.8MB in the beginning and 177.8MB in the end (delta: -95.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.63ms. Allocated memory is still 205.5MB. Free memory was 177.8MB in the beginning and 174.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.78ms. Allocated memory is still 205.5MB. Free memory was 174.7MB in the beginning and 171.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1004.18ms. Allocated memory is still 205.5MB. Free memory was 171.5MB in the beginning and 137.8MB in the end (delta: 33.7MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11507.69ms. Allocated memory was 205.5MB in the beginning and 767.6MB in the end (delta: 562.0MB). Free memory was 136.8MB in the beginning and 558.6MB in the end (delta: -421.8MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. * Witness Printer took 98.34ms. Allocated memory is still 767.6MB. Free memory was 558.6MB in the beginning and 553.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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 7 procedures, 41 locations, 4 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: 11.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=4, InterpolantAutomatonStates: 35, 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.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 4128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 14:26:58,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE