./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.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 e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:14:45,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:14:45,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:14:45,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:14:45,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:14:45,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:14:45,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:14:45,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:14:45,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:14:45,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:14:45,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:14:45,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:14:45,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:14:45,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:14:45,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:14:45,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:14:45,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:14:45,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:14:45,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:14:45,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:14:45,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:14:45,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:14:45,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:14:45,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:14:45,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:14:45,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:14:45,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:14:45,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:14:45,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:14:45,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:14:45,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:14:45,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:14:45,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:14:45,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:14:45,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:14:45,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:14:45,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:14:45,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:14:45,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:14:45,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:14:45,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:14:45,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:14:45,197 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2024-11-16 19:14:45,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:14:45,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:14:45,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:14:45,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:14:45,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:14:45,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-11-16 19:14:46,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:14:47,174 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:14:47,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-11-16 19:14:47,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e43025a1/fd00a8f2468e45a3b09b3ab8bb4adaa6/FLAG211efc466 [2024-11-16 19:14:47,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e43025a1/fd00a8f2468e45a3b09b3ab8bb4adaa6 [2024-11-16 19:14:47,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:14:47,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:14:47,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:14:47,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:14:47,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:14:47,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:14:47" (1/1) ... [2024-11-16 19:14:47,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf216d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:47, skipping insertion in model container [2024-11-16 19:14:47,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:14:47" (1/1) ... [2024-11-16 19:14:47,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:14:47,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2024-11-16 19:14:47,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:14:47,944 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:14:47,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2024-11-16 19:14:48,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:14:48,063 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:14:48,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48 WrapperNode [2024-11-16 19:14:48,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:14:48,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:14:48,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:14:48,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:14:48,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,128 INFO L138 Inliner]: procedures = 174, calls = 48, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2024-11-16 19:14:48,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:14:48,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:14:48,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:14:48,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:14:48,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,181 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-16 19:14:48,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:14:48,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:14:48,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:14:48,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:14:48,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (1/1) ... [2024-11-16 19:14:48,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:14:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:14:48,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:14:48,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:14:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 19:14:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 19:14:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 19:14:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 19:14:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:14:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:14:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:14:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:14:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:14:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:14:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:14:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 19:14:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:14:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:14:48,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:14:48,305 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:14:48,484 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:14:48,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:14:48,882 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:14:48,882 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:14:49,226 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:14:49,226 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:14:49,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:14:49 BoogieIcfgContainer [2024-11-16 19:14:49,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:14:49,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:14:49,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:14:49,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:14:49,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:14:47" (1/3) ... [2024-11-16 19:14:49,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630ecf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:14:49, skipping insertion in model container [2024-11-16 19:14:49,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:48" (2/3) ... [2024-11-16 19:14:49,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630ecf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:14:49, skipping insertion in model container [2024-11-16 19:14:49,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:14:49" (3/3) ... [2024-11-16 19:14:49,241 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-11-16 19:14:49,258 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:14:49,258 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:14:49,259 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:14:49,355 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:14:49,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 66 flow [2024-11-16 19:14:49,426 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2024-11-16 19:14:49,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:14:49,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 1/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-11-16 19:14:49,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 29 transitions, 66 flow [2024-11-16 19:14:49,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-11-16 19:14:49,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:14:49,455 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5eba4987, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:14:49,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-16 19:14:49,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:14:49,471 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-16 19:14:49,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:14:49,471 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:49,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:49,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:14:49,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash 519806792, now seen corresponding path program 1 times [2024-11-16 19:14:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:49,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057899105] [2024-11-16 19:14:49,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057899105] [2024-11-16 19:14:50,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057899105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:50,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:50,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:14:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983808183] [2024-11-16 19:14:50,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:50,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:14:50,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:50,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:14:50,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:14:50,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-11-16 19:14:50,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:50,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:50,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-11-16 19:14:50,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:50,693 INFO L124 PetriNetUnfolderBase]: 512/900 cut-off events. [2024-11-16 19:14:50,694 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 19:14:50,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 900 events. 512/900 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4039 event pairs, 102 based on Foata normal form. 36/933 useless extension candidates. Maximal degree in co-relation 1775. Up to 633 conditions per place. [2024-11-16 19:14:50,704 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 28 selfloop transitions, 2 changer transitions 33/66 dead transitions. [2024-11-16 19:14:50,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 66 transitions, 264 flow [2024-11-16 19:14:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:14:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:14:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2024-11-16 19:14:50,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49261083743842365 [2024-11-16 19:14:50,720 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 7 states and 100 transitions. [2024-11-16 19:14:50,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 66 transitions, 264 flow [2024-11-16 19:14:50,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 66 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:14:50,726 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 68 flow [2024-11-16 19:14:50,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2024-11-16 19:14:50,732 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-11-16 19:14:50,732 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 68 flow [2024-11-16 19:14:50,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:50,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:50,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:50,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:14:50,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:14:50,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -980827007, now seen corresponding path program 1 times [2024-11-16 19:14:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707488027] [2024-11-16 19:14:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:51,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707488027] [2024-11-16 19:14:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707488027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:51,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:14:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065073918] [2024-11-16 19:14:51,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:51,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:14:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:14:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:14:51,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-11-16 19:14:51,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:51,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:51,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-11-16 19:14:51,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:51,439 INFO L124 PetriNetUnfolderBase]: 601/1037 cut-off events. [2024-11-16 19:14:51,439 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-16 19:14:51,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2324 conditions, 1037 events. 601/1037 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4899 event pairs, 119 based on Foata normal form. 30/1065 useless extension candidates. Maximal degree in co-relation 2309. Up to 409 conditions per place. [2024-11-16 19:14:51,447 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 31 selfloop transitions, 3 changer transitions 39/76 dead transitions. [2024-11-16 19:14:51,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 335 flow [2024-11-16 19:14:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:14:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:14:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2024-11-16 19:14:51,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4956896551724138 [2024-11-16 19:14:51,451 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 68 flow. Second operand 8 states and 115 transitions. [2024-11-16 19:14:51,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 335 flow [2024-11-16 19:14:51,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 76 transitions, 313 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-16 19:14:51,464 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 78 flow [2024-11-16 19:14:51,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2024-11-16 19:14:51,465 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-11-16 19:14:51,465 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 78 flow [2024-11-16 19:14:51,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:51,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:51,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:51,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:14:51,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:14:51,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1940486894, now seen corresponding path program 1 times [2024-11-16 19:14:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:51,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768441712] [2024-11-16 19:14:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:52,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768441712] [2024-11-16 19:14:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768441712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:52,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:52,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:14:52,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948833679] [2024-11-16 19:14:52,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:52,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:14:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:52,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:14:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:14:52,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-11-16 19:14:52,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:52,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:52,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-11-16 19:14:52,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:53,295 INFO L124 PetriNetUnfolderBase]: 303/552 cut-off events. [2024-11-16 19:14:53,296 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2024-11-16 19:14:53,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 552 events. 303/552 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2126 event pairs, 51 based on Foata normal form. 20/572 useless extension candidates. Maximal degree in co-relation 1332. Up to 325 conditions per place. [2024-11-16 19:14:53,299 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 31 selfloop transitions, 3 changer transitions 23/60 dead transitions. [2024-11-16 19:14:53,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 280 flow [2024-11-16 19:14:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:14:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:14:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-11-16 19:14:53,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4267241379310345 [2024-11-16 19:14:53,301 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 78 flow. Second operand 8 states and 99 transitions. [2024-11-16 19:14:53,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 280 flow [2024-11-16 19:14:53,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 248 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-16 19:14:53,304 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 76 flow [2024-11-16 19:14:53,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2024-11-16 19:14:53,305 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-11-16 19:14:53,305 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 76 flow [2024-11-16 19:14:53,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:53,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:53,306 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:53,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:14:53,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:14:53,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash -989264658, now seen corresponding path program 1 times [2024-11-16 19:14:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:53,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95762778] [2024-11-16 19:14:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95762778] [2024-11-16 19:14:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95762778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:14:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129711533] [2024-11-16 19:14:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:53,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:14:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:14:53,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:14:53,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-16 19:14:53,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:53,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:53,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-16 19:14:53,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:53,671 INFO L124 PetriNetUnfolderBase]: 203/393 cut-off events. [2024-11-16 19:14:53,671 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2024-11-16 19:14:53,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 393 events. 203/393 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1455 event pairs, 39 based on Foata normal form. 26/419 useless extension candidates. Maximal degree in co-relation 915. Up to 199 conditions per place. [2024-11-16 19:14:53,673 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 34 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-16 19:14:53,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 202 flow [2024-11-16 19:14:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:14:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:14:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-16 19:14:53,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2024-11-16 19:14:53,675 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 76 flow. Second operand 4 states and 65 transitions. [2024-11-16 19:14:53,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 202 flow [2024-11-16 19:14:53,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 184 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-11-16 19:14:53,677 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 88 flow [2024-11-16 19:14:53,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2024-11-16 19:14:53,678 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-11-16 19:14:53,678 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 88 flow [2024-11-16 19:14:53,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:53,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:53,679 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:53,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:14:53,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:14:53,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:53,681 INFO L85 PathProgramCache]: Analyzing trace with hash -86338551, now seen corresponding path program 1 times [2024-11-16 19:14:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618364815] [2024-11-16 19:14:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:53,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618364815] [2024-11-16 19:14:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618364815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:14:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761944981] [2024-11-16 19:14:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:14:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:14:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:14:53,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-16 19:14:53,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:53,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:53,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-16 19:14:53,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:54,026 INFO L124 PetriNetUnfolderBase]: 107/219 cut-off events. [2024-11-16 19:14:54,027 INFO L125 PetriNetUnfolderBase]: For 76/78 co-relation queries the response was YES. [2024-11-16 19:14:54,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 219 events. 107/219 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 628 event pairs, 27 based on Foata normal form. 16/235 useless extension candidates. Maximal degree in co-relation 551. Up to 86 conditions per place. [2024-11-16 19:14:54,028 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 29 selfloop transitions, 6 changer transitions 1/39 dead transitions. [2024-11-16 19:14:54,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 194 flow [2024-11-16 19:14:54,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:14:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:14:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2024-11-16 19:14:54,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793 [2024-11-16 19:14:54,031 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 88 flow. Second operand 5 states and 68 transitions. [2024-11-16 19:14:54,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 194 flow [2024-11-16 19:14:54,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 175 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-16 19:14:54,032 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 96 flow [2024-11-16 19:14:54,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2024-11-16 19:14:54,035 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2024-11-16 19:14:54,035 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 96 flow [2024-11-16 19:14:54,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:54,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:54,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:54,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:14:54,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:14:54,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 215039928, now seen corresponding path program 1 times [2024-11-16 19:14:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:54,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743167381] [2024-11-16 19:14:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:14:54,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:14:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:14:54,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:14:54,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:14:54,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-16 19:14:54,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-16 19:14:54,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-16 19:14:54,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:14:54,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 19:14:54,362 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:14:54,362 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:14:54,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:14:54 BasicIcfg [2024-11-16 19:14:54,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:14:54,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:14:54,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:14:54,368 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:14:54,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:14:49" (3/4) ... [2024-11-16 19:14:54,371 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:14:54,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:14:54,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:14:54,474 INFO L158 Benchmark]: Toolchain (without parser) took 6983.32ms. Allocated memory was 125.8MB in the beginning and 201.3MB in the end (delta: 75.5MB). Free memory was 70.6MB in the beginning and 91.3MB in the end (delta: -20.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-11-16 19:14:54,474 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:14:54,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.83ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 70.4MB in the beginning and 128.6MB in the end (delta: -58.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-16 19:14:54,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.75ms. Allocated memory is still 163.6MB. Free memory was 128.6MB in the beginning and 125.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:14:54,475 INFO L158 Benchmark]: Boogie Preprocessor took 64.06ms. Allocated memory is still 163.6MB. Free memory was 125.4MB in the beginning and 122.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:14:54,475 INFO L158 Benchmark]: IcfgBuilder took 1029.34ms. Allocated memory is still 163.6MB. Free memory was 122.3MB in the beginning and 128.8MB in the end (delta: -6.5MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-11-16 19:14:54,476 INFO L158 Benchmark]: TraceAbstraction took 5136.77ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 127.8MB in the beginning and 105.0MB in the end (delta: 22.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2024-11-16 19:14:54,476 INFO L158 Benchmark]: Witness Printer took 105.79ms. Allocated memory is still 201.3MB. Free memory was 105.0MB in the beginning and 91.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 19:14:54,477 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.54ms. Allocated memory is still 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.83ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 70.4MB in the beginning and 128.6MB in the end (delta: -58.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.75ms. Allocated memory is still 163.6MB. Free memory was 128.6MB in the beginning and 125.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.06ms. Allocated memory is still 163.6MB. Free memory was 125.4MB in the beginning and 122.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1029.34ms. Allocated memory is still 163.6MB. Free memory was 122.3MB in the beginning and 128.8MB in the end (delta: -6.5MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5136.77ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 127.8MB in the beginning and 105.0MB in the end (delta: 22.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Witness Printer took 105.79ms. Allocated memory is still 201.3MB. Free memory was 105.0MB in the beginning and 91.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 3 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: 4.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=5, InterpolantAutomatonStates: 32, 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.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-16 19:14:54,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE