./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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 ../../../trunk/examples/svcomp/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 c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:18:24,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:18:24,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:18:24,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:18:24,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:18:24,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:18:24,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:18:24,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:18:24,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:18:24,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:18:24,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:18:24,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:18:24,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:18:24,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:18:24,980 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:18:24,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:18:24,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:18:24,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:18:24,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:18:24,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:18:24,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:18:24,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:18:24,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:18:24,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:18:24,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:18:24,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:18:24,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:18:24,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:18:24,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:18:24,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:18:24,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:18:24,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:18:24,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:18:24,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:18:24,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:18:24,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:18:24,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:18:24,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:18:24,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:18:24,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:18:24,995 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:18:24,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:18:24,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:18:24,995 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 -> c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 [2024-06-27 16:18:25,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:18:25,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:18:25,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:18:25,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:18:25,258 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:18:25,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2024-06-27 16:18:26,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:18:26,596 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:18:26,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2024-06-27 16:18:26,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b331fd0aa/a74fc138f779427eafa7b0ad04d12ffc/FLAG2735fb32c [2024-06-27 16:18:26,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b331fd0aa/a74fc138f779427eafa7b0ad04d12ffc [2024-06-27 16:18:26,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:18:26,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:18:26,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:18:26,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:18:26,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:18:26,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:18:26" (1/1) ... [2024-06-27 16:18:26,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db88ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:26, skipping insertion in model container [2024-06-27 16:18:26,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:18:26" (1/1) ... [2024-06-27 16:18:26,694 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:18:26,996 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-06-27 16:18:27,016 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-06-27 16:18:27,029 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:18:27,037 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:18:27,083 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-06-27 16:18:27,086 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-06-27 16:18:27,088 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:18:27,128 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:18:27,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27 WrapperNode [2024-06-27 16:18:27,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:18:27,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:18:27,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:18:27,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:18:27,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,192 INFO L138 Inliner]: procedures = 169, calls = 72, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-06-27 16:18:27,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:18:27,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:18:27,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:18:27,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:18:27,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,219 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-06-27 16:18:27,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:18:27,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:18:27,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:18:27,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:18:27,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (1/1) ... [2024-06-27 16:18:27,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:18:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:18:27,281 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-06-27 16:18:27,304 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-06-27 16:18:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-27 16:18:27,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-27 16:18:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 16:18:27,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 16:18:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:18:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:18:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:18:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:18:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:18:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:18:27,341 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:18:27,488 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:18:27,490 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:18:27,709 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:18:27,709 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:18:27,781 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:18:27,781 INFO L320 CfgBuilder]: Removed 8 assume(true) statements. [2024-06-27 16:18:27,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:18:27 BoogieIcfgContainer [2024-06-27 16:18:27,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:18:27,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:18:27,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:18:27,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:18:27,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:18:26" (1/3) ... [2024-06-27 16:18:27,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47de3974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:18:27, skipping insertion in model container [2024-06-27 16:18:27,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:18:27" (2/3) ... [2024-06-27 16:18:27,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47de3974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:18:27, skipping insertion in model container [2024-06-27 16:18:27,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:18:27" (3/3) ... [2024-06-27 16:18:27,791 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-06-27 16:18:27,796 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:18:27,804 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:18:27,805 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 16:18:27,805 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:18:27,862 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:18:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 88 transitions, 190 flow [2024-06-27 16:18:27,935 INFO L124 PetriNetUnfolderBase]: 18/86 cut-off events. [2024-06-27 16:18:27,937 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:18:27,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 86 events. 18/86 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-06-27 16:18:27,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 88 transitions, 190 flow [2024-06-27 16:18:27,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 84 transitions, 177 flow [2024-06-27 16:18:27,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:18:27,968 INFO L357 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, mHoare=true, 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;@444b9ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:18:27,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 16:18:27,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:18:27,981 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-06-27 16:18:27,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:18:27,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:27,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:18:27,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:27,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1211410145, now seen corresponding path program 1 times [2024-06-27 16:18:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353306400] [2024-06-27 16:18:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:28,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:28,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353306400] [2024-06-27 16:18:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353306400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:28,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:28,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:18:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909060097] [2024-06-27 16:18:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:28,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:18:28,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:18:28,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:18:28,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 88 [2024-06-27 16:18:28,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 84 transitions, 177 flow. Second operand has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 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-06-27 16:18:28,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:28,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 88 [2024-06-27 16:18:28,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:28,389 INFO L124 PetriNetUnfolderBase]: 164/534 cut-off events. [2024-06-27 16:18:28,389 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-06-27 16:18:28,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 534 events. 164/534 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3002 event pairs, 50 based on Foata normal form. 79/515 useless extension candidates. Maximal degree in co-relation 701. Up to 188 conditions per place. [2024-06-27 16:18:28,397 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 16 selfloop transitions, 0 changer transitions 0/78 dead transitions. [2024-06-27 16:18:28,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 197 flow [2024-06-27 16:18:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:18:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:18:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 150 transitions. [2024-06-27 16:18:28,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8522727272727273 [2024-06-27 16:18:28,412 INFO L175 Difference]: Start difference. First operand has 73 places, 84 transitions, 177 flow. Second operand 2 states and 150 transitions. [2024-06-27 16:18:28,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 197 flow [2024-06-27 16:18:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 16:18:28,418 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 160 flow [2024-06-27 16:18:28,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=160, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2024-06-27 16:18:28,424 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-06-27 16:18:28,425 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 160 flow [2024-06-27 16:18:28,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 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-06-27 16:18:28,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:28,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:18:28,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:18:28,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:28,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1261599476, now seen corresponding path program 1 times [2024-06-27 16:18:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:28,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707464776] [2024-06-27 16:18:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:28,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:28,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707464776] [2024-06-27 16:18:28,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707464776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:28,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:18:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741757941] [2024-06-27 16:18:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:28,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:18:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:18:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:18:28,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2024-06-27 16:18:28,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-06-27 16:18:28,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:28,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2024-06-27 16:18:28,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:28,700 INFO L124 PetriNetUnfolderBase]: 250/670 cut-off events. [2024-06-27 16:18:28,700 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 16:18:28,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 670 events. 250/670 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4009 event pairs, 54 based on Foata normal form. 19/597 useless extension candidates. Maximal degree in co-relation 1007. Up to 201 conditions per place. [2024-06-27 16:18:28,709 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 25 selfloop transitions, 3 changer transitions 1/87 dead transitions. [2024-06-27 16:18:28,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 237 flow [2024-06-27 16:18:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:18:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:18:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2024-06-27 16:18:28,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7992424242424242 [2024-06-27 16:18:28,718 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 160 flow. Second operand 3 states and 211 transitions. [2024-06-27 16:18:28,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 237 flow [2024-06-27 16:18:28,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 87 transitions, 237 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:18:28,722 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 180 flow [2024-06-27 16:18:28,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-06-27 16:18:28,723 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-06-27 16:18:28,724 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 180 flow [2024-06-27 16:18:28,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-06-27 16:18:28,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:28,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:18:28,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:18:28,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:28,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:28,727 INFO L85 PathProgramCache]: Analyzing trace with hash 519915, now seen corresponding path program 1 times [2024-06-27 16:18:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:28,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94652365] [2024-06-27 16:18:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94652365] [2024-06-27 16:18:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94652365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:18:28,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230355880] [2024-06-27 16:18:28,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:28,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:18:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:28,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:18:28,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:18:28,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2024-06-27 16:18:28,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-06-27 16:18:28,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:28,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2024-06-27 16:18:28,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:28,951 INFO L124 PetriNetUnfolderBase]: 259/683 cut-off events. [2024-06-27 16:18:28,951 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-06-27 16:18:28,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 683 events. 259/683 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4086 event pairs, 77 based on Foata normal form. 19/603 useless extension candidates. Maximal degree in co-relation 1158. Up to 260 conditions per place. [2024-06-27 16:18:28,958 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 24 selfloop transitions, 2 changer transitions 3/87 dead transitions. [2024-06-27 16:18:28,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 255 flow [2024-06-27 16:18:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:18:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:18:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2024-06-27 16:18:28,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7992424242424242 [2024-06-27 16:18:28,962 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 180 flow. Second operand 3 states and 211 transitions. [2024-06-27 16:18:28,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 255 flow [2024-06-27 16:18:28,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 87 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:18:28,970 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 184 flow [2024-06-27 16:18:28,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2024-06-27 16:18:28,971 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-06-27 16:18:28,972 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 184 flow [2024-06-27 16:18:28,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-06-27 16:18:28,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:28,972 INFO L208 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, 1] [2024-06-27 16:18:28,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:18:28,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:28,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1443932317, now seen corresponding path program 1 times [2024-06-27 16:18:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:28,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102398619] [2024-06-27 16:18:28,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:28,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:29,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102398619] [2024-06-27 16:18:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102398619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:29,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:29,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:18:29,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711412075] [2024-06-27 16:18:29,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:29,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:18:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:18:29,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:18:29,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 88 [2024-06-27 16:18:29,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-06-27 16:18:29,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:29,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 88 [2024-06-27 16:18:29,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:29,419 INFO L124 PetriNetUnfolderBase]: 824/2058 cut-off events. [2024-06-27 16:18:29,419 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2024-06-27 16:18:29,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 2058 events. 824/2058 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14910 event pairs, 190 based on Foata normal form. 52/1983 useless extension candidates. Maximal degree in co-relation 3449. Up to 607 conditions per place. [2024-06-27 16:18:29,430 INFO L140 encePairwiseOnDemand]: 74/88 looper letters, 48 selfloop transitions, 10 changer transitions 10/120 dead transitions. [2024-06-27 16:18:29,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 120 transitions, 405 flow [2024-06-27 16:18:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:18:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:18:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2024-06-27 16:18:29,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775 [2024-06-27 16:18:29,433 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 184 flow. Second operand 5 states and 341 transitions. [2024-06-27 16:18:29,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 120 transitions, 405 flow [2024-06-27 16:18:29,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 120 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:18:29,438 INFO L231 Difference]: Finished difference. Result has 83 places, 89 transitions, 288 flow [2024-06-27 16:18:29,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=83, PETRI_TRANSITIONS=89} [2024-06-27 16:18:29,440 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-06-27 16:18:29,440 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 89 transitions, 288 flow [2024-06-27 16:18:29,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-06-27 16:18:29,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:29,441 INFO L208 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, 1] [2024-06-27 16:18:29,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:18:29,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:29,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1631250333, now seen corresponding path program 2 times [2024-06-27 16:18:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918062070] [2024-06-27 16:18:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:29,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918062070] [2024-06-27 16:18:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918062070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:29,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:18:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675327137] [2024-06-27 16:18:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:29,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:18:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:18:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:18:29,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2024-06-27 16:18:29,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-06-27 16:18:29,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:29,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2024-06-27 16:18:29,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:29,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res.base_1| 0) (= |v_thr2Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_1|, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_#res.offset][78], [Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 93#(= ~y~0 1), 101#true, Black: 94#(= thr2Thread1of1ForFork0_~y2~0 1), Black: 84#(= ~X~0 0), 80#true, 7#L846-4true, 91#true, 71#L753-1true, 52#thr2EXITtrue, thr2Thread1of1ForFork0InUse, 89#(= ~X~0 1)]) [2024-06-27 16:18:29,876 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-27 16:18:29,876 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 16:18:29,877 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-27 16:18:29,877 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-27 16:18:29,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res.base_1| 0) (= |v_thr2Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_1|, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_#res.offset][78], [Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), 42#L847true, Black: 93#(= ~y~0 1), 101#true, Black: 94#(= thr2Thread1of1ForFork0_~y2~0 1), Black: 84#(= ~X~0 0), 80#true, 91#true, 71#L753-1true, 52#thr2EXITtrue, thr2Thread1of1ForFork0InUse, 89#(= ~X~0 1)]) [2024-06-27 16:18:29,881 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-06-27 16:18:29,882 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 16:18:29,882 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 16:18:29,882 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-27 16:18:29,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res.base_1| 0) (= |v_thr2Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_1|, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_#res.offset][78], [72#L710true, Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), 42#L847true, Black: 93#(= ~y~0 1), 101#true, Black: 94#(= thr2Thread1of1ForFork0_~y2~0 1), Black: 84#(= ~X~0 0), 80#true, 91#true, 52#thr2EXITtrue, 89#(= ~X~0 1), thr2Thread1of1ForFork0InUse]) [2024-06-27 16:18:29,906 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-27 16:18:29,906 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 16:18:29,907 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 16:18:29,907 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 16:18:29,980 INFO L124 PetriNetUnfolderBase]: 1423/4164 cut-off events. [2024-06-27 16:18:29,980 INFO L125 PetriNetUnfolderBase]: For 1186/1395 co-relation queries the response was YES. [2024-06-27 16:18:29,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7855 conditions, 4164 events. 1423/4164 cut-off events. For 1186/1395 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 36255 event pairs, 249 based on Foata normal form. 96/3962 useless extension candidates. Maximal degree in co-relation 7846. Up to 600 conditions per place. [2024-06-27 16:18:30,007 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 55 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2024-06-27 16:18:30,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 130 transitions, 530 flow [2024-06-27 16:18:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:18:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:18:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2024-06-27 16:18:30,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8227272727272728 [2024-06-27 16:18:30,012 INFO L175 Difference]: Start difference. First operand has 83 places, 89 transitions, 288 flow. Second operand 5 states and 362 transitions. [2024-06-27 16:18:30,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 130 transitions, 530 flow [2024-06-27 16:18:30,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 130 transitions, 496 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-06-27 16:18:30,026 INFO L231 Difference]: Finished difference. Result has 89 places, 95 transitions, 322 flow [2024-06-27 16:18:30,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2024-06-27 16:18:30,029 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places. [2024-06-27 16:18:30,033 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 322 flow [2024-06-27 16:18:30,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-06-27 16:18:30,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:30,034 INFO L208 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, 1] [2024-06-27 16:18:30,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:18:30,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:30,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -395755455, now seen corresponding path program 3 times [2024-06-27 16:18:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:30,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977473025] [2024-06-27 16:18:30,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977473025] [2024-06-27 16:18:30,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977473025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:18:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754734172] [2024-06-27 16:18:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:30,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:18:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:18:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:18:30,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2024-06-27 16:18:30,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 95 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-06-27 16:18:30,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:30,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2024-06-27 16:18:30,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:30,780 INFO L124 PetriNetUnfolderBase]: 2328/6888 cut-off events. [2024-06-27 16:18:30,780 INFO L125 PetriNetUnfolderBase]: For 2167/2385 co-relation queries the response was YES. [2024-06-27 16:18:30,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12948 conditions, 6888 events. 2328/6888 cut-off events. For 2167/2385 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 65039 event pairs, 366 based on Foata normal form. 122/6627 useless extension candidates. Maximal degree in co-relation 12936. Up to 916 conditions per place. [2024-06-27 16:18:30,831 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 59 selfloop transitions, 11 changer transitions 0/141 dead transitions. [2024-06-27 16:18:30,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 141 transitions, 605 flow [2024-06-27 16:18:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:18:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:18:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 365 transitions. [2024-06-27 16:18:30,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8295454545454546 [2024-06-27 16:18:30,834 INFO L175 Difference]: Start difference. First operand has 89 places, 95 transitions, 322 flow. Second operand 5 states and 365 transitions. [2024-06-27 16:18:30,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 141 transitions, 605 flow [2024-06-27 16:18:30,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 141 transitions, 605 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:18:30,843 INFO L231 Difference]: Finished difference. Result has 97 places, 103 transitions, 416 flow [2024-06-27 16:18:30,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=416, PETRI_PLACES=97, PETRI_TRANSITIONS=103} [2024-06-27 16:18:30,846 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 24 predicate places. [2024-06-27 16:18:30,846 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 103 transitions, 416 flow [2024-06-27 16:18:30,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-06-27 16:18:30,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:30,847 INFO L208 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, 1] [2024-06-27 16:18:30,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:18:30,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:30,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:30,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1865793411, now seen corresponding path program 4 times [2024-06-27 16:18:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979547404] [2024-06-27 16:18:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:30,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979547404] [2024-06-27 16:18:30,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979547404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:30,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:30,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:18:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110266846] [2024-06-27 16:18:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:30,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:18:30,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:30,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:18:30,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:18:30,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 88 [2024-06-27 16:18:30,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 103 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-06-27 16:18:30,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:30,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 88 [2024-06-27 16:18:30,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:31,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][15], [72#L710true, Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), 111#true, Black: 93#(= ~y~0 1), 80#true, 91#true, Black: 106#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 101#true, Black: 104#(= 2 thr1Thread1of1ForFork1_~x1~0), thr2Thread1of1ForFork0InUse, 61#L780true, Black: 82#true, Black: 113#(= ~x~0 1), Black: 116#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 114#(= thr2Thread1of1ForFork0_~x2~0 1), 7#L846-4true, Black: 89#(= ~X~0 1), 103#(= 2 ~x~0), 121#true]) [2024-06-27 16:18:31,123 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 16:18:31,123 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-06-27 16:18:31,123 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 16:18:31,124 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 16:18:32,163 INFO L124 PetriNetUnfolderBase]: 4101/10813 cut-off events. [2024-06-27 16:18:32,163 INFO L125 PetriNetUnfolderBase]: For 4550/5184 co-relation queries the response was YES. [2024-06-27 16:18:32,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22456 conditions, 10813 events. 4101/10813 cut-off events. For 4550/5184 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 101278 event pairs, 1157 based on Foata normal form. 637/11278 useless extension candidates. Maximal degree in co-relation 22440. Up to 3489 conditions per place. [2024-06-27 16:18:32,239 INFO L140 encePairwiseOnDemand]: 74/88 looper letters, 50 selfloop transitions, 14 changer transitions 6/142 dead transitions. [2024-06-27 16:18:32,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 142 transitions, 663 flow [2024-06-27 16:18:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:18:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:18:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 339 transitions. [2024-06-27 16:18:32,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7704545454545455 [2024-06-27 16:18:32,242 INFO L175 Difference]: Start difference. First operand has 97 places, 103 transitions, 416 flow. Second operand 5 states and 339 transitions. [2024-06-27 16:18:32,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 142 transitions, 663 flow [2024-06-27 16:18:32,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 142 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:18:32,257 INFO L231 Difference]: Finished difference. Result has 105 places, 114 transitions, 542 flow [2024-06-27 16:18:32,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=542, PETRI_PLACES=105, PETRI_TRANSITIONS=114} [2024-06-27 16:18:32,258 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 32 predicate places. [2024-06-27 16:18:32,258 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 542 flow [2024-06-27 16:18:32,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-06-27 16:18:32,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:32,259 INFO L208 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, 1, 1, 1, 1, 1, 1] [2024-06-27 16:18:32,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:18:32,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:32,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash -489519782, now seen corresponding path program 1 times [2024-06-27 16:18:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:32,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922941016] [2024-06-27 16:18:32,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922941016] [2024-06-27 16:18:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922941016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:18:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886056380] [2024-06-27 16:18:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:18:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:18:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:18:32,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 88 [2024-06-27 16:18:32,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 114 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-06-27 16:18:32,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:32,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 88 [2024-06-27 16:18:32,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:32,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][16], [Black: 123#(= 2 ~y~0), Black: 126#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 111#true, Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 91#true, 80#true, 133#(= ~b2~0 1), Black: 106#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 101#true, Black: 104#(= 2 thr1Thread1of1ForFork1_~x1~0), thr2Thread1of1ForFork0InUse, 15#L733true, 61#L780true, Black: 82#true, Black: 113#(= ~x~0 1), Black: 116#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 114#(= thr2Thread1of1ForFork0_~x2~0 1), 7#L846-4true, Black: 89#(= ~X~0 1), 103#(= 2 ~x~0), 93#(= ~y~0 1), 121#true, Black: 124#(= 2 thr1Thread1of1ForFork1_~y1~0)]) [2024-06-27 16:18:32,940 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-27 16:18:32,941 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 16:18:32,941 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 16:18:32,941 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 16:18:32,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][16], [Black: 123#(= 2 ~y~0), Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 126#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 111#true, Black: 91#true, 42#L847true, 80#true, 133#(= ~b2~0 1), Black: 106#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 101#true, Black: 104#(= 2 thr1Thread1of1ForFork1_~x1~0), thr2Thread1of1ForFork0InUse, 15#L733true, 61#L780true, Black: 82#true, Black: 113#(= ~x~0 1), Black: 116#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 114#(= thr2Thread1of1ForFork0_~x2~0 1), Black: 89#(= ~X~0 1), 103#(= 2 ~x~0), 93#(= ~y~0 1), 121#true, Black: 124#(= 2 thr1Thread1of1ForFork1_~y1~0)]) [2024-06-27 16:18:32,970 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-06-27 16:18:32,970 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 16:18:32,970 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-27 16:18:32,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 16:18:33,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L737-->L744: Formula: (= v_~b2~0_5 v_thr1Thread1of1ForFork1_~b21~0_1) InVars {~b2~0=v_~b2~0_5} OutVars{~b2~0=v_~b2~0_5, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0][46], [Black: 123#(= 2 ~y~0), Black: 126#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 113#(= ~x~0 1), Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 91#true, 80#true, Black: 106#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 104#(= 2 thr1Thread1of1ForFork1_~x1~0), Black: 103#(= 2 ~x~0), thr2Thread1of1ForFork0InUse, 136#(and (= thr1Thread1of1ForFork1_~b21~0 1) (= ~b2~0 1)), 101#true, Black: 111#true, Black: 82#true, Black: 116#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 114#(= thr2Thread1of1ForFork0_~x2~0 1), 28#L777true, 7#L846-4true, Black: 89#(= ~X~0 1), 93#(= ~y~0 1), 68#L744true, 121#true, Black: 124#(= 2 thr1Thread1of1ForFork1_~y1~0)]) [2024-06-27 16:18:33,013 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-06-27 16:18:33,013 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-27 16:18:33,013 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 16:18:33,013 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 16:18:33,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L737-->L744: Formula: (= v_~b2~0_5 v_thr1Thread1of1ForFork1_~b21~0_1) InVars {~b2~0=v_~b2~0_5} OutVars{~b2~0=v_~b2~0_5, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0][46], [Black: 123#(= 2 ~y~0), Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 126#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 113#(= ~x~0 1), Black: 91#true, 42#L847true, 80#true, Black: 106#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 104#(= 2 thr1Thread1of1ForFork1_~x1~0), Black: 103#(= 2 ~x~0), thr2Thread1of1ForFork0InUse, 136#(and (= thr1Thread1of1ForFork1_~b21~0 1) (= ~b2~0 1)), 101#true, Black: 111#true, Black: 82#true, Black: 116#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 114#(= thr2Thread1of1ForFork0_~x2~0 1), 28#L777true, Black: 89#(= ~X~0 1), 93#(= ~y~0 1), 68#L744true, 121#true, Black: 124#(= 2 thr1Thread1of1ForFork1_~y1~0)]) [2024-06-27 16:18:33,027 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-27 16:18:33,028 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 16:18:33,028 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 16:18:33,028 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-27 16:18:33,490 INFO L124 PetriNetUnfolderBase]: 2683/7917 cut-off events. [2024-06-27 16:18:33,490 INFO L125 PetriNetUnfolderBase]: For 4351/4647 co-relation queries the response was YES. [2024-06-27 16:18:33,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17795 conditions, 7917 events. 2683/7917 cut-off events. For 4351/4647 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 75981 event pairs, 966 based on Foata normal form. 246/7760 useless extension candidates. Maximal degree in co-relation 17775. Up to 2635 conditions per place. [2024-06-27 16:18:33,542 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 35 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2024-06-27 16:18:33,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 136 transitions, 689 flow [2024-06-27 16:18:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:18:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:18:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2024-06-27 16:18:33,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7681818181818182 [2024-06-27 16:18:33,545 INFO L175 Difference]: Start difference. First operand has 105 places, 114 transitions, 542 flow. Second operand 5 states and 338 transitions. [2024-06-27 16:18:33,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 136 transitions, 689 flow [2024-06-27 16:18:33,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 136 transitions, 685 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 16:18:33,567 INFO L231 Difference]: Finished difference. Result has 112 places, 120 transitions, 595 flow [2024-06-27 16:18:33,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=595, PETRI_PLACES=112, PETRI_TRANSITIONS=120} [2024-06-27 16:18:33,572 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 39 predicate places. [2024-06-27 16:18:33,572 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 120 transitions, 595 flow [2024-06-27 16:18:33,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-06-27 16:18:33,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:18:33,573 INFO L208 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, 1, 1, 1, 1, 1, 1] [2024-06-27 16:18:33,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:18:33,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:18:33,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:18:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1926718147, now seen corresponding path program 1 times [2024-06-27 16:18:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:18:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970741837] [2024-06-27 16:18:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:18:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:18:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:18:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:18:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:18:33,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970741837] [2024-06-27 16:18:33,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970741837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:18:33,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:18:33,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:18:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655444740] [2024-06-27 16:18:33,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:18:33,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:18:33,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:18:33,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:18:33,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:18:33,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 88 [2024-06-27 16:18:33,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 120 transitions, 595 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-06-27 16:18:33,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:18:33,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 88 [2024-06-27 16:18:33,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:18:34,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res.base_1| 0) (= |v_thr2Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_1|, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_#res.offset][83], [Black: 123#(= 2 ~y~0), 111#true, Black: 126#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 42#L847true, Black: 136#(and (= thr1Thread1of1ForFork1_~b21~0 1) (= ~b2~0 1)), 131#true, 91#true, Black: 133#(= ~b2~0 1), 66#L707true, Black: 134#(= thr1Thread1of1ForFork1_~b21~0 1), thr2Thread1of1ForFork0InUse, Black: 84#(= ~X~0 0), 103#(= 2 ~x~0), 142#(= ~b1~0 1), 121#true, Black: 96#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 93#(= ~y~0 1), 80#true, Black: 106#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 101#true, Black: 104#(= 2 thr1Thread1of1ForFork1_~x1~0), 52#thr2EXITtrue, Black: 113#(= ~x~0 1), Black: 116#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 114#(= thr2Thread1of1ForFork0_~x2~0 1), 89#(= ~X~0 1), Black: 124#(= 2 thr1Thread1of1ForFork1_~y1~0)]) [2024-06-27 16:18:34,078 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-27 16:18:34,078 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 16:18:34,078 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 16:18:34,078 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 16:18:34,479 INFO L124 PetriNetUnfolderBase]: 2257/6835 cut-off events. [2024-06-27 16:18:34,480 INFO L125 PetriNetUnfolderBase]: For 4001/4209 co-relation queries the response was YES. [2024-06-27 16:18:34,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15936 conditions, 6835 events. 2257/6835 cut-off events. For 4001/4209 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 64547 event pairs, 796 based on Foata normal form. 207/6714 useless extension candidates. Maximal degree in co-relation 15912. Up to 2115 conditions per place. [2024-06-27 16:18:34,609 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 0 selfloop transitions, 0 changer transitions 138/138 dead transitions. [2024-06-27 16:18:34,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 138 transitions, 724 flow [2024-06-27 16:18:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:18:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:18:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 340 transitions. [2024-06-27 16:18:34,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7727272727272727 [2024-06-27 16:18:34,611 INFO L175 Difference]: Start difference. First operand has 112 places, 120 transitions, 595 flow. Second operand 5 states and 340 transitions. [2024-06-27 16:18:34,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 138 transitions, 724 flow [2024-06-27 16:18:34,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 138 transitions, 714 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 16:18:34,634 INFO L231 Difference]: Finished difference. Result has 111 places, 0 transitions, 0 flow [2024-06-27 16:18:34,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=111, PETRI_TRANSITIONS=0} [2024-06-27 16:18:34,635 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 38 predicate places. [2024-06-27 16:18:34,636 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 0 transitions, 0 flow [2024-06-27 16:18:34,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-06-27 16:18:34,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-06-27 16:18:34,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 16:18:34,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-06-27 16:18:34,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-27 16:18:34,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-06-27 16:18:34,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 16:18:34,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:18:34,640 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-06-27 16:18:34,645 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 16:18:34,645 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 16:18:34,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 04:18:34 BasicIcfg [2024-06-27 16:18:34,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 16:18:34,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 16:18:34,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 16:18:34,651 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 16:18:34,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:18:27" (3/4) ... [2024-06-27 16:18:34,653 INFO L137 WitnessPrinter]: Generating witness for correct program [2024-06-27 16:18:34,655 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-06-27 16:18:34,655 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-06-27 16:18:34,659 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-06-27 16:18:34,659 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-06-27 16:18:34,659 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-06-27 16:18:34,659 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-06-27 16:18:34,733 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 16:18:34,733 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-06-27 16:18:34,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 16:18:34,734 INFO L158 Benchmark]: Toolchain (without parser) took 8101.52ms. Allocated memory was 184.5MB in the beginning and 813.7MB in the end (delta: 629.1MB). Free memory was 125.8MB in the beginning and 628.1MB in the end (delta: -502.3MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2024-06-27 16:18:34,734 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:18:34,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.88ms. Allocated memory is still 184.5MB. Free memory was 125.4MB in the beginning and 103.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-06-27 16:18:34,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.34ms. Allocated memory is still 184.5MB. Free memory was 103.5MB in the beginning and 101.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:18:34,735 INFO L158 Benchmark]: Boogie Preprocessor took 43.93ms. Allocated memory is still 184.5MB. Free memory was 101.9MB in the beginning and 99.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:18:34,735 INFO L158 Benchmark]: RCFGBuilder took 544.52ms. Allocated memory is still 184.5MB. Free memory was 99.3MB in the beginning and 80.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 16:18:34,735 INFO L158 Benchmark]: TraceAbstraction took 6866.22ms. Allocated memory was 184.5MB in the beginning and 813.7MB in the end (delta: 629.1MB). Free memory was 79.6MB in the beginning and 632.3MB in the end (delta: -552.7MB). Peak memory consumption was 251.6MB. Max. memory is 16.1GB. [2024-06-27 16:18:34,736 INFO L158 Benchmark]: Witness Printer took 82.30ms. Allocated memory is still 813.7MB. Free memory was 632.3MB in the beginning and 628.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 16:18:34,737 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 184.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.88ms. Allocated memory is still 184.5MB. Free memory was 125.4MB in the beginning and 103.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.34ms. Allocated memory is still 184.5MB. Free memory was 103.5MB in the beginning and 101.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.93ms. Allocated memory is still 184.5MB. Free memory was 101.9MB in the beginning and 99.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.52ms. Allocated memory is still 184.5MB. Free memory was 99.3MB in the beginning and 80.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6866.22ms. Allocated memory was 184.5MB in the beginning and 813.7MB in the end (delta: 629.1MB). Free memory was 79.6MB in the beginning and 632.3MB in the end (delta: -552.7MB). Peak memory consumption was 251.6MB. Max. memory is 16.1GB. * Witness Printer took 82.30ms. Allocated memory is still 813.7MB. Free memory was 632.3MB in the beginning and 628.1MB 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: 834]: 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: 764]: 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, 135 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: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 785 IncrementalHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 65 mSDtfsCounter, 785 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=595occurred in iteration=8, InterpolantAutomatonStates: 38, 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.5s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 350 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-06-27 16:18:34,764 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