./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:59:52,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:59:53,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:59:53,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:59:53,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:59:53,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:59:53,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:59:53,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:59:53,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:59:53,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:59:53,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:59:53,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:59:53,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:59:53,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:59:53,071 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:59:53,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:59:53,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:59:53,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:59:53,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:59:53,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:59:53,073 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:59:53,077 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:59:53,077 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:59:53,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:59:53,078 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:59:53,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:59:53,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:59:53,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:59:53,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:59:53,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:59:53,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:59:53,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:59:53,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:59:53,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:59:53,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:59:53,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:59:53,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:59:53,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:59:53,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:59:53,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:59:53,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:59:53,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:59:53,086 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 [2024-11-10 17:59:53,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:59:53,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:59:53,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:59:53,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:59:53,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:59:53,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2024-11-10 17:59:54,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:59:55,115 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:59:55,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2024-11-10 17:59:55,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ebb9f1b/e49aa6f7277c48a588d2797135b83bf9/FLAG0872ef6e6 [2024-11-10 17:59:55,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ebb9f1b/e49aa6f7277c48a588d2797135b83bf9 [2024-11-10 17:59:55,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:59:55,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:59:55,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:59:55,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:59:55,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:59:55,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6462b8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55, skipping insertion in model container [2024-11-10 17:59:55,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:59:55,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:59:55,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:59:55,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:59:55,810 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:59:55,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55 WrapperNode [2024-11-10 17:59:55,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:59:55,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:59:55,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:59:55,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:59:55,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,890 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-11-10 17:59:55,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:59:55,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:59:55,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:59:55,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:59:55,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,944 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-10 17:59:55,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:59:55,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:59:55,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:59:55,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:59:55,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (1/1) ... [2024-11-10 17:59:55,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:59:56,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:59:56,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:59:56,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:59:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:59:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:59:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:59:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:59:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:59:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:59:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:59:56,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:59:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:59:56,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:59:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:59:56,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:59:56,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:59:56,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:59:56,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:59:56,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:59:56,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:59:56,091 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:59:56,243 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:59:56,246 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:59:56,762 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:59:56,763 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:59:57,259 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:59:57,259 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:59:57,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:59:57 BoogieIcfgContainer [2024-11-10 17:59:57,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:59:57,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:59:57,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:59:57,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:59:57,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:59:55" (1/3) ... [2024-11-10 17:59:57,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7be1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:59:57, skipping insertion in model container [2024-11-10 17:59:57,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:55" (2/3) ... [2024-11-10 17:59:57,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7be1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:59:57, skipping insertion in model container [2024-11-10 17:59:57,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:59:57" (3/3) ... [2024-11-10 17:59:57,269 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2024-11-10 17:59:57,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:59:57,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-10 17:59:57,289 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:59:57,424 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:59:57,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 71 transitions, 154 flow [2024-11-10 17:59:57,536 INFO L124 PetriNetUnfolderBase]: 2/68 cut-off events. [2024-11-10 17:59:57,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:59:57,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 2/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 235 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-10 17:59:57,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 71 transitions, 154 flow [2024-11-10 17:59:57,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 68 transitions, 145 flow [2024-11-10 17:59:57,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:59:57,573 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=None, 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;@647a140d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:59:57,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-10 17:59:57,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:59:57,579 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-10 17:59:57,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:59:57,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:59:57,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 17:59:57,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 17:59:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:59:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash 21662552, now seen corresponding path program 1 times [2024-11-10 17:59:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:59:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357120416] [2024-11-10 17:59:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:59:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:59:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:59:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:59:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:59:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357120416] [2024-11-10 17:59:58,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357120416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:59:58,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:59:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:59:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409230068] [2024-11-10 17:59:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:59:58,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:59:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:59:58,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:59:58,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:59:58,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 17:59:58,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:59:58,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:59:58,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 17:59:58,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:01,008 INFO L124 PetriNetUnfolderBase]: 13427/20260 cut-off events. [2024-11-10 18:00:01,008 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-10 18:00:01,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39183 conditions, 20260 events. 13427/20260 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 135310 event pairs, 13427 based on Foata normal form. 756/16910 useless extension candidates. Maximal degree in co-relation 39172. Up to 18818 conditions per place. [2024-11-10 18:00:01,172 INFO L140 encePairwiseOnDemand]: 48/71 looper letters, 37 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-11-10 18:00:01,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 175 flow [2024-11-10 18:00:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-10 18:00:01,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4225352112676056 [2024-11-10 18:00:01,186 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 145 flow. Second operand 3 states and 90 transitions. [2024-11-10 18:00:01,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 175 flow [2024-11-10 18:00:01,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:00:01,195 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-11-10 18:00:01,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-10 18:00:01,205 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -22 predicate places. [2024-11-10 18:00:01,205 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-11-10 18:00:01,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:01,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:01,206 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:00:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:00:01,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:01,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 21662553, now seen corresponding path program 1 times [2024-11-10 18:00:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:01,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123702083] [2024-11-10 18:00:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123702083] [2024-11-10 18:00:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123702083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:01,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:01,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354719783] [2024-11-10 18:00:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:01,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:01,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:01,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:01,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:01,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:01,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:01,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:02,751 INFO L124 PetriNetUnfolderBase]: 6395/9875 cut-off events. [2024-11-10 18:00:02,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:02,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19037 conditions, 9875 events. 6395/9875 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 60667 event pairs, 6395 based on Foata normal form. 0/9392 useless extension candidates. Maximal degree in co-relation 19031. Up to 9072 conditions per place. [2024-11-10 18:00:02,823 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-10 18:00:02,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 150 flow [2024-11-10 18:00:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-10 18:00:02,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3192488262910798 [2024-11-10 18:00:02,826 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 68 transitions. [2024-11-10 18:00:02,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 150 flow [2024-11-10 18:00:02,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:02,828 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-10 18:00:02,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-10 18:00:02,829 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-11-10 18:00:02,829 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-10 18:00:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:02,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:02,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:02,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:00:02,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:02,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:02,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1066481463, now seen corresponding path program 1 times [2024-11-10 18:00:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126686640] [2024-11-10 18:00:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:02,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126686640] [2024-11-10 18:00:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126686640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:02,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470009240] [2024-11-10 18:00:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:02,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:02,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:02,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:02,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:02,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:02,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:04,096 INFO L124 PetriNetUnfolderBase]: 5663/8188 cut-off events. [2024-11-10 18:00:04,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:04,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16331 conditions, 8188 events. 5663/8188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 46671 event pairs, 803 based on Foata normal form. 0/7819 useless extension candidates. Maximal degree in co-relation 16324. Up to 7199 conditions per place. [2024-11-10 18:00:04,156 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-10 18:00:04,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 239 flow [2024-11-10 18:00:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-11-10 18:00:04,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39906103286384975 [2024-11-10 18:00:04,159 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 85 transitions. [2024-11-10 18:00:04,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 239 flow [2024-11-10 18:00:04,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:04,161 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-10 18:00:04,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-10 18:00:04,162 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-11-10 18:00:04,162 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-10 18:00:04,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:04,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:04,163 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:04,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:00:04,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1608524920, now seen corresponding path program 1 times [2024-11-10 18:00:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036768396] [2024-11-10 18:00:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:04,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:04,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036768396] [2024-11-10 18:00:04,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036768396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:04,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:04,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:00:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912971973] [2024-11-10 18:00:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:04,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:00:04,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:04,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:00:04,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:00:04,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:04,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:04,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:04,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:04,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:05,348 INFO L124 PetriNetUnfolderBase]: 5219/7564 cut-off events. [2024-11-10 18:00:05,349 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2024-11-10 18:00:05,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15941 conditions, 7564 events. 5219/7564 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 43107 event pairs, 659 based on Foata normal form. 0/7555 useless extension candidates. Maximal degree in co-relation 15932. Up to 6574 conditions per place. [2024-11-10 18:00:05,437 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-11-10 18:00:05,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow [2024-11-10 18:00:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-10 18:00:05,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3274647887323944 [2024-11-10 18:00:05,439 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions. [2024-11-10 18:00:05,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow [2024-11-10 18:00:05,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:05,451 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-10 18:00:05,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-10 18:00:05,453 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-11-10 18:00:05,453 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-10 18:00:05,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:05,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:05,454 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:00:05,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1608524921, now seen corresponding path program 1 times [2024-11-10 18:00:05,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:05,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74329295] [2024-11-10 18:00:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74329295] [2024-11-10 18:00:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74329295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:05,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:00:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685499483] [2024-11-10 18:00:05,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:05,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:05,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:05,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:05,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:05,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:06,758 INFO L124 PetriNetUnfolderBase]: 4775/6940 cut-off events. [2024-11-10 18:00:06,759 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2024-11-10 18:00:06,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14513 conditions, 6940 events. 4775/6940 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 39309 event pairs, 515 based on Foata normal form. 180/7111 useless extension candidates. Maximal degree in co-relation 14504. Up to 5950 conditions per place. [2024-11-10 18:00:06,832 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-11-10 18:00:06,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow [2024-11-10 18:00:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-10 18:00:06,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.323943661971831 [2024-11-10 18:00:06,834 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions. [2024-11-10 18:00:06,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow [2024-11-10 18:00:06,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:00:06,837 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-10 18:00:06,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-10 18:00:06,838 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-11-10 18:00:06,838 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-10 18:00:06,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:06,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:06,839 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:06,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:00:06,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:06,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash -400707183, now seen corresponding path program 1 times [2024-11-10 18:00:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322665132] [2024-11-10 18:00:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:06,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322665132] [2024-11-10 18:00:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322665132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:06,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172089177] [2024-11-10 18:00:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:06,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:06,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:06,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:06,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:06,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 71 [2024-11-10 18:00:06,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:06,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:06,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 71 [2024-11-10 18:00:06,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:07,835 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2024-11-10 18:00:07,835 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2024-11-10 18:00:07,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14999 conditions, 7427 events. 4775/7427 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43768 event pairs, 4775 based on Foata normal form. 216/7592 useless extension candidates. Maximal degree in co-relation 14991. Up to 6804 conditions per place. [2024-11-10 18:00:07,901 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-10 18:00:07,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow [2024-11-10 18:00:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-10 18:00:07,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2676056338028169 [2024-11-10 18:00:07,903 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions. [2024-11-10 18:00:07,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow [2024-11-10 18:00:07,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:07,905 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-10 18:00:07,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-10 18:00:07,908 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -28 predicate places. [2024-11-10 18:00:07,909 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-10 18:00:07,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:07,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:07,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:07,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:00:07,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:07,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash -400705099, now seen corresponding path program 1 times [2024-11-10 18:00:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:07,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815905692] [2024-11-10 18:00:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815905692] [2024-11-10 18:00:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815905692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:08,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158494857] [2024-11-10 18:00:08,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:08,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:08,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:08,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:08,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 71 [2024-11-10 18:00:08,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:08,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:08,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 71 [2024-11-10 18:00:08,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:09,633 INFO L124 PetriNetUnfolderBase]: 5831/8735 cut-off events. [2024-11-10 18:00:09,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:09,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18035 conditions, 8735 events. 5831/8735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 49775 event pairs, 827 based on Foata normal form. 0/8540 useless extension candidates. Maximal degree in co-relation 18027. Up to 4993 conditions per place. [2024-11-10 18:00:09,688 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 40 selfloop transitions, 2 changer transitions 70/117 dead transitions. [2024-11-10 18:00:09,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 117 transitions, 482 flow [2024-11-10 18:00:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:00:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:00:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-11-10 18:00:09,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3274647887323944 [2024-11-10 18:00:09,692 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 186 transitions. [2024-11-10 18:00:09,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 117 transitions, 482 flow [2024-11-10 18:00:09,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 117 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:09,698 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2024-11-10 18:00:09,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-11-10 18:00:09,700 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-11-10 18:00:09,700 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2024-11-10 18:00:09,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:09,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:09,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:09,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:00:09,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:09,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1353992308, now seen corresponding path program 1 times [2024-11-10 18:00:09,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903770928] [2024-11-10 18:00:09,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903770928] [2024-11-10 18:00:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903770928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485679950] [2024-11-10 18:00:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:09,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:09,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 71 [2024-11-10 18:00:09,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:09,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:09,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 71 [2024-11-10 18:00:09,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:11,507 INFO L124 PetriNetUnfolderBase]: 5671/8407 cut-off events. [2024-11-10 18:00:11,507 INFO L125 PetriNetUnfolderBase]: For 1032/1032 co-relation queries the response was YES. [2024-11-10 18:00:11,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18989 conditions, 8407 events. 5671/8407 cut-off events. For 1032/1032 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 46813 event pairs, 1039 based on Foata normal form. 180/8576 useless extension candidates. Maximal degree in co-relation 18975. Up to 3249 conditions per place. [2024-11-10 18:00:11,567 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 48 selfloop transitions, 3 changer transitions 59/115 dead transitions. [2024-11-10 18:00:11,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 506 flow [2024-11-10 18:00:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:00:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:00:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-11-10 18:00:11,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.323943661971831 [2024-11-10 18:00:11,570 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 8 states and 184 transitions. [2024-11-10 18:00:11,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 506 flow [2024-11-10 18:00:11,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 115 transitions, 484 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 18:00:11,640 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 103 flow [2024-11-10 18:00:11,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2024-11-10 18:00:11,645 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2024-11-10 18:00:11,645 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 103 flow [2024-11-10 18:00:11,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:11,645 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:11,646 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-10 18:00:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:00:11,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 464193540, now seen corresponding path program 1 times [2024-11-10 18:00:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419394226] [2024-11-10 18:00:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:12,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419394226] [2024-11-10 18:00:12,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419394226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:12,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:12,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111617818] [2024-11-10 18:00:12,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:12,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:12,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 71 [2024-11-10 18:00:12,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:12,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:12,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 71 [2024-11-10 18:00:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:12,795 INFO L124 PetriNetUnfolderBase]: 3002/4611 cut-off events. [2024-11-10 18:00:12,795 INFO L125 PetriNetUnfolderBase]: For 1792/1794 co-relation queries the response was YES. [2024-11-10 18:00:12,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10930 conditions, 4611 events. 3002/4611 cut-off events. For 1792/1794 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 24019 event pairs, 425 based on Foata normal form. 120/4731 useless extension candidates. Maximal degree in co-relation 10914. Up to 3366 conditions per place. [2024-11-10 18:00:12,823 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 44 selfloop transitions, 2 changer transitions 41/92 dead transitions. [2024-11-10 18:00:12,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 425 flow [2024-11-10 18:00:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:00:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:00:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-11-10 18:00:12,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3058350100603622 [2024-11-10 18:00:12,824 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 103 flow. Second operand 7 states and 152 transitions. [2024-11-10 18:00:12,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 425 flow [2024-11-10 18:00:12,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 388 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-10 18:00:12,840 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 99 flow [2024-11-10 18:00:12,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-11-10 18:00:12,841 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-11-10 18:00:12,841 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 99 flow [2024-11-10 18:00:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:12,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:12,842 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-10 18:00:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:00:12,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -689147107, now seen corresponding path program 1 times [2024-11-10 18:00:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18566667] [2024-11-10 18:00:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:14,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18566667] [2024-11-10 18:00:14,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18566667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:14,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:00:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210963116] [2024-11-10 18:00:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:14,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:00:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:00:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:00:14,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 71 [2024-11-10 18:00:14,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 99 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:14,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:14,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 71 [2024-11-10 18:00:14,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:15,263 INFO L124 PetriNetUnfolderBase]: 2767/4236 cut-off events. [2024-11-10 18:00:15,264 INFO L125 PetriNetUnfolderBase]: For 1236/1238 co-relation queries the response was YES. [2024-11-10 18:00:15,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9865 conditions, 4236 events. 2767/4236 cut-off events. For 1236/1238 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 21077 event pairs, 241 based on Foata normal form. 100/4336 useless extension candidates. Maximal degree in co-relation 9850. Up to 2417 conditions per place. [2024-11-10 18:00:15,288 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 51 selfloop transitions, 4 changer transitions 39/99 dead transitions. [2024-11-10 18:00:15,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 443 flow [2024-11-10 18:00:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:00:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:00:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-11-10 18:00:15,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29577464788732394 [2024-11-10 18:00:15,290 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 99 flow. Second operand 8 states and 168 transitions. [2024-11-10 18:00:15,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 443 flow [2024-11-10 18:00:15,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 421 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 18:00:15,301 INFO L231 Difference]: Finished difference. Result has 61 places, 35 transitions, 119 flow [2024-11-10 18:00:15,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=119, PETRI_PLACES=61, PETRI_TRANSITIONS=35} [2024-11-10 18:00:15,302 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -15 predicate places. [2024-11-10 18:00:15,303 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 35 transitions, 119 flow [2024-11-10 18:00:15,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:15,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:15,303 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:00:15,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:15,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -778509894, now seen corresponding path program 1 times [2024-11-10 18:00:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286611657] [2024-11-10 18:00:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286611657] [2024-11-10 18:00:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286611657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:15,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:00:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529502154] [2024-11-10 18:00:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:00:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:00:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:00:15,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:15,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 35 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:15,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:15,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:15,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:16,017 INFO L124 PetriNetUnfolderBase]: 2187/3439 cut-off events. [2024-11-10 18:00:16,017 INFO L125 PetriNetUnfolderBase]: For 802/811 co-relation queries the response was YES. [2024-11-10 18:00:16,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8320 conditions, 3439 events. 2187/3439 cut-off events. For 802/811 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 17481 event pairs, 337 based on Foata normal form. 157/3595 useless extension candidates. Maximal degree in co-relation 8303. Up to 1771 conditions per place. [2024-11-10 18:00:16,046 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 61 selfloop transitions, 5 changer transitions 1/72 dead transitions. [2024-11-10 18:00:16,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 373 flow [2024-11-10 18:00:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-10 18:00:16,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3626760563380282 [2024-11-10 18:00:16,048 INFO L175 Difference]: Start difference. First operand has 61 places, 35 transitions, 119 flow. Second operand 4 states and 103 transitions. [2024-11-10 18:00:16,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 373 flow [2024-11-10 18:00:16,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 358 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-10 18:00:16,056 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 142 flow [2024-11-10 18:00:16,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2024-11-10 18:00:16,056 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -19 predicate places. [2024-11-10 18:00:16,057 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 142 flow [2024-11-10 18:00:16,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:16,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:16,057 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:16,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:00:16,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2137657395, now seen corresponding path program 1 times [2024-11-10 18:00:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:16,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637711689] [2024-11-10 18:00:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:16,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637711689] [2024-11-10 18:00:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637711689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:16,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924083954] [2024-11-10 18:00:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:16,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:16,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:16,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:16,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:16,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:16,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:16,708 INFO L124 PetriNetUnfolderBase]: 1405/2253 cut-off events. [2024-11-10 18:00:16,709 INFO L125 PetriNetUnfolderBase]: For 956/965 co-relation queries the response was YES. [2024-11-10 18:00:16,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5959 conditions, 2253 events. 1405/2253 cut-off events. For 956/965 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 10353 event pairs, 209 based on Foata normal form. 117/2369 useless extension candidates. Maximal degree in co-relation 5943. Up to 733 conditions per place. [2024-11-10 18:00:16,728 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 70 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2024-11-10 18:00:16,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 450 flow [2024-11-10 18:00:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:00:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:00:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-10 18:00:16,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35774647887323946 [2024-11-10 18:00:16,730 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 142 flow. Second operand 5 states and 127 transitions. [2024-11-10 18:00:16,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 450 flow [2024-11-10 18:00:16,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 440 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:16,736 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 182 flow [2024-11-10 18:00:16,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-10 18:00:16,738 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -15 predicate places. [2024-11-10 18:00:16,739 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 182 flow [2024-11-10 18:00:16,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:16,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:16,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:16,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:00:16,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:16,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:16,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1293788948, now seen corresponding path program 1 times [2024-11-10 18:00:16,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936613640] [2024-11-10 18:00:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936613640] [2024-11-10 18:00:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936613640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163691087] [2024-11-10 18:00:17,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:17,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:17,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:17,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:17,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:17,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:17,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:17,413 INFO L124 PetriNetUnfolderBase]: 871/1391 cut-off events. [2024-11-10 18:00:17,414 INFO L125 PetriNetUnfolderBase]: For 1208/1217 co-relation queries the response was YES. [2024-11-10 18:00:17,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4037 conditions, 1391 events. 871/1391 cut-off events. For 1208/1217 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5748 event pairs, 183 based on Foata normal form. 49/1439 useless extension candidates. Maximal degree in co-relation 4019. Up to 484 conditions per place. [2024-11-10 18:00:17,423 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 61 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2024-11-10 18:00:17,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 440 flow [2024-11-10 18:00:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-11-10 18:00:17,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3075117370892019 [2024-11-10 18:00:17,426 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 182 flow. Second operand 6 states and 131 transitions. [2024-11-10 18:00:17,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 440 flow [2024-11-10 18:00:17,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 394 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-10 18:00:17,431 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 183 flow [2024-11-10 18:00:17,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-10 18:00:17,432 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -15 predicate places. [2024-11-10 18:00:17,433 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 183 flow [2024-11-10 18:00:17,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:17,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:17,433 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:17,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:00:17,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1042015198, now seen corresponding path program 1 times [2024-11-10 18:00:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992598771] [2024-11-10 18:00:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:17,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992598771] [2024-11-10 18:00:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992598771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:17,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:00:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843525152] [2024-11-10 18:00:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:17,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:17,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:17,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 71 [2024-11-10 18:00:17,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:17,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:17,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 71 [2024-11-10 18:00:17,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:18,139 INFO L124 PetriNetUnfolderBase]: 1271/2019 cut-off events. [2024-11-10 18:00:18,139 INFO L125 PetriNetUnfolderBase]: For 1836/1836 co-relation queries the response was YES. [2024-11-10 18:00:18,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 2019 events. 1271/2019 cut-off events. For 1836/1836 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8970 event pairs, 269 based on Foata normal form. 8/2026 useless extension candidates. Maximal degree in co-relation 5601. Up to 1110 conditions per place. [2024-11-10 18:00:18,150 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 39 selfloop transitions, 1 changer transitions 36/81 dead transitions. [2024-11-10 18:00:18,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 81 transitions, 505 flow [2024-11-10 18:00:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-11-10 18:00:18,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2746478873239437 [2024-11-10 18:00:18,154 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 183 flow. Second operand 6 states and 117 transitions. [2024-11-10 18:00:18,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 81 transitions, 505 flow [2024-11-10 18:00:18,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 392 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-10 18:00:18,161 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 128 flow [2024-11-10 18:00:18,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2024-11-10 18:00:18,162 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -14 predicate places. [2024-11-10 18:00:18,162 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 128 flow [2024-11-10 18:00:18,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:18,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:18,163 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:18,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 18:00:18,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:18,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:18,164 INFO L85 PathProgramCache]: Analyzing trace with hash -755679450, now seen corresponding path program 2 times [2024-11-10 18:00:18,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:18,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255119923] [2024-11-10 18:00:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:00:18,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:00:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:00:18,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:00:18,397 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:00:18,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-10 18:00:18,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-10 18:00:18,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-10 18:00:18,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2024-11-10 18:00:18,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-10 18:00:18,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-10 18:00:18,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-10 18:00:18,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-10 18:00:18,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-10 18:00:18,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-10 18:00:18,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-10 18:00:18,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-10 18:00:18,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-10 18:00:18,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-10 18:00:18,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-10 18:00:18,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-10 18:00:18,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-10 18:00:18,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-10 18:00:18,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-10 18:00:18,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-10 18:00:18,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-11-10 18:00:18,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-10 18:00:18,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-10 18:00:18,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-10 18:00:18,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-10 18:00:18,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-11-10 18:00:18,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2024-11-10 18:00:18,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2024-11-10 18:00:18,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2024-11-10 18:00:18,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2024-11-10 18:00:18,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-10 18:00:18,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-10 18:00:18,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-10 18:00:18,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-10 18:00:18,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-10 18:00:18,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-10 18:00:18,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-10 18:00:18,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-10 18:00:18,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-10 18:00:18,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-10 18:00:18,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-10 18:00:18,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-10 18:00:18,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-10 18:00:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-10 18:00:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-10 18:00:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-10 18:00:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-10 18:00:18,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-10 18:00:18,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:00:18,411 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:18,548 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:00:18,548 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:00:18,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:00:18 BasicIcfg [2024-11-10 18:00:18,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:00:18,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:00:18,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:00:18,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:00:18,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:59:57" (3/4) ... [2024-11-10 18:00:18,560 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:00:18,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:00:18,562 INFO L158 Benchmark]: Toolchain (without parser) took 23409.62ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 68.4MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 546.4MB. Max. memory is 16.1GB. [2024-11-10 18:00:18,562 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:18,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.65ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 68.2MB in the beginning and 137.4MB in the end (delta: -69.1MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-10 18:00:18,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.55ms. Allocated memory is still 186.6MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:00:18,563 INFO L158 Benchmark]: Boogie Preprocessor took 91.70ms. Allocated memory is still 186.6MB. Free memory was 135.3MB in the beginning and 131.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:00:18,563 INFO L158 Benchmark]: IcfgBuilder took 1275.74ms. Allocated memory is still 186.6MB. Free memory was 131.1MB in the beginning and 93.2MB in the end (delta: 37.9MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-11-10 18:00:18,564 INFO L158 Benchmark]: TraceAbstraction took 21293.79ms. Allocated memory was 186.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 93.2MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 525.2MB. Max. memory is 16.1GB. [2024-11-10 18:00:18,564 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 3.5GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:18,565 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.20ms. Allocated memory is still 142.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.65ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 68.2MB in the beginning and 137.4MB in the end (delta: -69.1MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.55ms. Allocated memory is still 186.6MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.70ms. Allocated memory is still 186.6MB. Free memory was 135.3MB in the beginning and 131.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1275.74ms. Allocated memory is still 186.6MB. Free memory was 131.1MB in the beginning and 93.2MB in the end (delta: 37.9MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21293.79ms. Allocated memory was 186.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 93.2MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 525.2MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 3.5GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2049=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2049=-2, t2050=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 __unbuffered_p0_EBX = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t2051; [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2049=-2, t2050=-1, t2051=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 x = 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049=-2, t2050=-1, t2051=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049=-2, t2050=-1, t2051=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049=-2, t2050=-1, t2051=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L18] 0 __assert_fail ("0", "safe012_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 842]: 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: 840]: 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 7 procedures, 116 locations, 55 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: 21.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 786 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 777 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1680 IncrementalHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 6 mSDtfsCounter, 1680 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=13, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:00:18,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:00:21,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:00:21,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:00:21,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:00:21,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:00:21,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:00:21,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:00:21,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:00:21,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:00:21,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:00:21,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:00:21,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:00:21,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:00:21,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:00:21,725 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:00:21,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:00:21,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:00:21,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:00:21,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:00:21,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:00:21,730 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:00:21,731 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:00:21,731 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:00:21,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:00:21,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:00:21,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:00:21,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:00:21,732 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:00:21,733 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:00:21,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:00:21,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:00:21,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:00:21,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:00:21,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:00:21,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:00:21,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:00:21,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:00:21,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:00:21,739 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:00:21,739 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:00:21,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:00:21,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:00:21,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:00:21,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:00:21,742 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 [2024-11-10 18:00:22,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:00:22,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:00:22,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:00:22,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:00:22,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:00:22,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2024-11-10 18:00:23,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:00:24,080 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:00:24,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2024-11-10 18:00:24,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff532488/633214722b33467a929d6ab8ec8d14a5/FLAG328740632 [2024-11-10 18:00:24,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff532488/633214722b33467a929d6ab8ec8d14a5 [2024-11-10 18:00:24,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:00:24,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:00:24,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:00:24,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:00:24,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:00:24,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65647a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24, skipping insertion in model container [2024-11-10 18:00:24,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:00:24,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:00:24,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:00:24,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:00:24,763 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:00:24,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24 WrapperNode [2024-11-10 18:00:24,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:00:24,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:00:24,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:00:24,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:00:24,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,840 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-11-10 18:00:24,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:00:24,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:00:24,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:00:24,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:00:24,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,895 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-10 18:00:24,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:00:24,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:00:24,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:00:24,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:00:24,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (1/1) ... [2024-11-10 18:00:24,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:00:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:00:24,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:00:24,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:00:24,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 18:00:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 18:00:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:00:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:00:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 18:00:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 18:00:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:00:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 18:00:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 18:00:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 18:00:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 18:00:24,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 18:00:25,000 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 18:00:25,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 18:00:25,000 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 18:00:25,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 18:00:25,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:00:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:00:25,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:00:25,004 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:00:25,267 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:00:25,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:00:25,913 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:00:25,913 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:00:26,503 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:00:26,503 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:00:26,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:26 BoogieIcfgContainer [2024-11-10 18:00:26,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:00:26,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:00:26,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:00:26,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:00:26,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:00:24" (1/3) ... [2024-11-10 18:00:26,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30469643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:26, skipping insertion in model container [2024-11-10 18:00:26,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:24" (2/3) ... [2024-11-10 18:00:26,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30469643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:26, skipping insertion in model container [2024-11-10 18:00:26,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:26" (3/3) ... [2024-11-10 18:00:26,516 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2024-11-10 18:00:26,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:00:26,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-10 18:00:26,535 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:00:26,734 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:00:26,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 71 transitions, 154 flow [2024-11-10 18:00:26,847 INFO L124 PetriNetUnfolderBase]: 2/68 cut-off events. [2024-11-10 18:00:26,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:26,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 2/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 235 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-10 18:00:26,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 71 transitions, 154 flow [2024-11-10 18:00:26,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 68 transitions, 145 flow [2024-11-10 18:00:26,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:00:26,873 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=None, 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;@609293c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:00:26,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-10 18:00:26,878 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:00:26,878 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-10 18:00:26,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:26,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:26,879 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:00:26,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:26,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash 21724120, now seen corresponding path program 1 times [2024-11-10 18:00:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155108262] [2024-11-10 18:00:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:26,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:26,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:26,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:26,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:00:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:27,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:00:27,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:27,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:27,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:27,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155108262] [2024-11-10 18:00:27,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155108262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:27,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70403807] [2024-11-10 18:00:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:27,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:27,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:27,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:27,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:27,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:27,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:27,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:30,249 INFO L124 PetriNetUnfolderBase]: 13427/20260 cut-off events. [2024-11-10 18:00:30,249 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-10 18:00:30,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39183 conditions, 20260 events. 13427/20260 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 135310 event pairs, 13427 based on Foata normal form. 756/16910 useless extension candidates. Maximal degree in co-relation 39172. Up to 18818 conditions per place. [2024-11-10 18:00:30,425 INFO L140 encePairwiseOnDemand]: 48/71 looper letters, 37 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-11-10 18:00:30,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 175 flow [2024-11-10 18:00:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-10 18:00:30,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4225352112676056 [2024-11-10 18:00:30,441 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 145 flow. Second operand 3 states and 90 transitions. [2024-11-10 18:00:30,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 175 flow [2024-11-10 18:00:30,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:00:30,451 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-11-10 18:00:30,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-10 18:00:30,457 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -22 predicate places. [2024-11-10 18:00:30,457 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-11-10 18:00:30,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:30,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:30,458 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:00:30,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 18:00:30,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:30,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:30,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 21724121, now seen corresponding path program 1 times [2024-11-10 18:00:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301548001] [2024-11-10 18:00:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:30,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:30,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:30,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:00:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:30,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:00:30,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:30,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:30,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:30,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301548001] [2024-11-10 18:00:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301548001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:30,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:30,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:30,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803332017] [2024-11-10 18:00:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:30,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:30,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:30,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:30,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:30,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:30,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:30,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:32,557 INFO L124 PetriNetUnfolderBase]: 6395/9875 cut-off events. [2024-11-10 18:00:32,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:32,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19037 conditions, 9875 events. 6395/9875 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 60667 event pairs, 6395 based on Foata normal form. 0/9392 useless extension candidates. Maximal degree in co-relation 19031. Up to 9072 conditions per place. [2024-11-10 18:00:32,617 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-10 18:00:32,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 150 flow [2024-11-10 18:00:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-10 18:00:32,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3192488262910798 [2024-11-10 18:00:32,621 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 68 transitions. [2024-11-10 18:00:32,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 150 flow [2024-11-10 18:00:32,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:32,625 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-10 18:00:32,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-10 18:00:32,629 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-11-10 18:00:32,629 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-10 18:00:32,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:32,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:32,630 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:32,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 18:00:32,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:32,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:32,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash 946442123, now seen corresponding path program 1 times [2024-11-10 18:00:32,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:32,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267729426] [2024-11-10 18:00:32,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:32,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:32,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:32,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:32,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:00:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:32,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:00:32,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:32,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:33,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:33,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267729426] [2024-11-10 18:00:33,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267729426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:33,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:33,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:00:33,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578540699] [2024-11-10 18:00:33,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:33,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:00:33,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:33,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:00:33,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:00:33,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:33,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:33,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:33,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:33,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:33,701 INFO L124 PetriNetUnfolderBase]: 4515/7235 cut-off events. [2024-11-10 18:00:33,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:33,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13942 conditions, 7235 events. 4515/7235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 44766 event pairs, 535 based on Foata normal form. 216/7134 useless extension candidates. Maximal degree in co-relation 13935. Up to 4501 conditions per place. [2024-11-10 18:00:33,749 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 58 selfloop transitions, 5 changer transitions 1/71 dead transitions. [2024-11-10 18:00:33,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 283 flow [2024-11-10 18:00:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-10 18:00:33,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3732394366197183 [2024-11-10 18:00:33,752 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 4 states and 106 transitions. [2024-11-10 18:00:33,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 283 flow [2024-11-10 18:00:33,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:33,755 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 118 flow [2024-11-10 18:00:33,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-10 18:00:33,756 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -24 predicate places. [2024-11-10 18:00:33,756 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 118 flow [2024-11-10 18:00:33,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:33,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:33,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:33,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 18:00:33,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:33,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:33,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash -539614236, now seen corresponding path program 1 times [2024-11-10 18:00:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:33,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439650564] [2024-11-10 18:00:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:33,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:33,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:33,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:33,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:00:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:34,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:00:34,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:34,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:34,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439650564] [2024-11-10 18:00:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439650564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118158570] [2024-11-10 18:00:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:34,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:34,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:34,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:34,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:34,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:34,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:34,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:34,716 INFO L124 PetriNetUnfolderBase]: 2259/3667 cut-off events. [2024-11-10 18:00:34,716 INFO L125 PetriNetUnfolderBase]: For 648/648 co-relation queries the response was YES. [2024-11-10 18:00:34,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8133 conditions, 3667 events. 2259/3667 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 19560 event pairs, 339 based on Foata normal form. 152/3694 useless extension candidates. Maximal degree in co-relation 8123. Up to 1477 conditions per place. [2024-11-10 18:00:34,738 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 73 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2024-11-10 18:00:34,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 399 flow [2024-11-10 18:00:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:00:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:00:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-10 18:00:34,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37746478873239436 [2024-11-10 18:00:34,741 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 118 flow. Second operand 5 states and 134 transitions. [2024-11-10 18:00:34,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 399 flow [2024-11-10 18:00:34,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 389 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:34,747 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 158 flow [2024-11-10 18:00:34,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-10 18:00:34,749 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -20 predicate places. [2024-11-10 18:00:34,749 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 158 flow [2024-11-10 18:00:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:34,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:34,749 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:34,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 18:00:34,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:34,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:34,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1709862062, now seen corresponding path program 1 times [2024-11-10 18:00:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:34,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597580129] [2024-11-10 18:00:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:34,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:34,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:34,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:00:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:35,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:00:35,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:35,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:35,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597580129] [2024-11-10 18:00:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597580129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:35,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:35,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807018222] [2024-11-10 18:00:35,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:35,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:35,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:35,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:35,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:35,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:35,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:35,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:35,623 INFO L124 PetriNetUnfolderBase]: 1203/1891 cut-off events. [2024-11-10 18:00:35,624 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2024-11-10 18:00:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4697 conditions, 1891 events. 1203/1891 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8412 event pairs, 303 based on Foata normal form. 56/1918 useless extension candidates. Maximal degree in co-relation 4685. Up to 672 conditions per place. [2024-11-10 18:00:35,636 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 62 selfloop transitions, 11 changer transitions 1/81 dead transitions. [2024-11-10 18:00:35,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 390 flow [2024-11-10 18:00:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-11-10 18:00:35,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3192488262910798 [2024-11-10 18:00:35,638 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 158 flow. Second operand 6 states and 136 transitions. [2024-11-10 18:00:35,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 390 flow [2024-11-10 18:00:35,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 81 transitions, 365 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 18:00:35,648 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 172 flow [2024-11-10 18:00:35,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-11-10 18:00:35,649 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2024-11-10 18:00:35,649 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 172 flow [2024-11-10 18:00:35,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:35,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:35,650 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:35,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:00:35,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:35,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:35,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1676353689, now seen corresponding path program 1 times [2024-11-10 18:00:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:35,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640454334] [2024-11-10 18:00:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:35,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:35,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:35,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:35,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 18:00:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:36,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:00:36,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:36,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:36,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:36,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640454334] [2024-11-10 18:00:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640454334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:00:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482761457] [2024-11-10 18:00:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:36,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:00:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:36,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:00:36,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:00:36,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:36,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:36,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:36,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:36,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:36,593 INFO L124 PetriNetUnfolderBase]: 1091/1708 cut-off events. [2024-11-10 18:00:36,594 INFO L125 PetriNetUnfolderBase]: For 1100/1100 co-relation queries the response was YES. [2024-11-10 18:00:36,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 1708 events. 1091/1708 cut-off events. For 1100/1100 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7652 event pairs, 247 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 4262. Up to 1490 conditions per place. [2024-11-10 18:00:36,604 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-10 18:00:36,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 338 flow [2024-11-10 18:00:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-11-10 18:00:36,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3028169014084507 [2024-11-10 18:00:36,606 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 172 flow. Second operand 4 states and 86 transitions. [2024-11-10 18:00:36,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 338 flow [2024-11-10 18:00:36,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 266 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-10 18:00:36,613 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 118 flow [2024-11-10 18:00:36,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-10 18:00:36,614 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -23 predicate places. [2024-11-10 18:00:36,614 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 118 flow [2024-11-10 18:00:36,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:36,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:36,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:36,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 18:00:36,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:36,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:36,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2004719668, now seen corresponding path program 1 times [2024-11-10 18:00:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683878680] [2024-11-10 18:00:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:36,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:36,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:36,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:36,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 18:00:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:36,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:00:36,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:37,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:37,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683878680] [2024-11-10 18:00:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683878680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:00:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650074708] [2024-11-10 18:00:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:00:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:37,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:00:37,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:00:37,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:37,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:37,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:37,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:37,511 INFO L124 PetriNetUnfolderBase]: 1079/1688 cut-off events. [2024-11-10 18:00:37,511 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-10 18:00:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 1688 events. 1079/1688 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7565 event pairs, 235 based on Foata normal form. 0/1685 useless extension candidates. Maximal degree in co-relation 3752. Up to 1470 conditions per place. [2024-11-10 18:00:37,521 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-11-10 18:00:37,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 266 flow [2024-11-10 18:00:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-11-10 18:00:37,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2992957746478873 [2024-11-10 18:00:37,526 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 118 flow. Second operand 4 states and 85 transitions. [2024-11-10 18:00:37,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 266 flow [2024-11-10 18:00:37,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:37,528 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 117 flow [2024-11-10 18:00:37,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-11-10 18:00:37,530 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -23 predicate places. [2024-11-10 18:00:37,532 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 117 flow [2024-11-10 18:00:37,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:37,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:37,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:37,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 18:00:37,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:37,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:37,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1423981926, now seen corresponding path program 1 times [2024-11-10 18:00:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:37,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326430667] [2024-11-10 18:00:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:37,737 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:37,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 18:00:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:37,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:00:37,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:37,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:37,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:37,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326430667] [2024-11-10 18:00:37,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326430667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:37,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:37,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31700884] [2024-11-10 18:00:37,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:37,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:37,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:37,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 71 [2024-11-10 18:00:37,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:37,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:37,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 71 [2024-11-10 18:00:37,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:38,181 INFO L124 PetriNetUnfolderBase]: 1079/1687 cut-off events. [2024-11-10 18:00:38,182 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-11-10 18:00:38,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 1687 events. 1079/1687 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7248 event pairs, 1011 based on Foata normal form. 8/1680 useless extension candidates. Maximal degree in co-relation 3837. Up to 1652 conditions per place. [2024-11-10 18:00:38,188 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 33 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-10 18:00:38,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 185 flow [2024-11-10 18:00:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-10 18:00:38,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2676056338028169 [2024-11-10 18:00:38,190 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 117 flow. Second operand 3 states and 57 transitions. [2024-11-10 18:00:38,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 185 flow [2024-11-10 18:00:38,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:38,191 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 112 flow [2024-11-10 18:00:38,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-11-10 18:00:38,192 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -24 predicate places. [2024-11-10 18:00:38,192 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 112 flow [2024-11-10 18:00:38,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:38,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:38,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:38,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 18:00:38,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:38,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:38,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1102841932, now seen corresponding path program 1 times [2024-11-10 18:00:38,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:38,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668022291] [2024-11-10 18:00:38,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:38,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:38,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:38,400 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:38,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 18:00:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:38,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:00:38,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:38,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:38,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668022291] [2024-11-10 18:00:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668022291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:38,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:38,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:00:38,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725914834] [2024-11-10 18:00:38,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:38,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:38,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:39,060 INFO L124 PetriNetUnfolderBase]: 1641/2565 cut-off events. [2024-11-10 18:00:39,060 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-11-10 18:00:39,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5804 conditions, 2565 events. 1641/2565 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12274 event pairs, 189 based on Foata normal form. 8/2567 useless extension candidates. Maximal degree in co-relation 5795. Up to 1360 conditions per place. [2024-11-10 18:00:39,070 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 46 selfloop transitions, 1 changer transitions 34/87 dead transitions. [2024-11-10 18:00:39,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 401 flow [2024-11-10 18:00:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-11-10 18:00:39,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3004694835680751 [2024-11-10 18:00:39,071 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 112 flow. Second operand 6 states and 128 transitions. [2024-11-10 18:00:39,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 401 flow [2024-11-10 18:00:39,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:39,074 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 122 flow [2024-11-10 18:00:39,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-11-10 18:00:39,075 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2024-11-10 18:00:39,075 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 122 flow [2024-11-10 18:00:39,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:39,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:39,075 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:39,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 18:00:39,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:39,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:39,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1847003672, now seen corresponding path program 2 times [2024-11-10 18:00:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:39,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612771049] [2024-11-10 18:00:39,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:00:39,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:39,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:39,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:39,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 18:00:39,443 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:00:39,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:00:39,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:00:39,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:39,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:39,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:39,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612771049] [2024-11-10 18:00:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612771049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:39,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205811393] [2024-11-10 18:00:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:39,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:39,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2024-11-10 18:00:39,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:39,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:39,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2024-11-10 18:00:39,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:39,878 INFO L124 PetriNetUnfolderBase]: 1469/2357 cut-off events. [2024-11-10 18:00:39,878 INFO L125 PetriNetUnfolderBase]: For 453/455 co-relation queries the response was YES. [2024-11-10 18:00:39,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5550 conditions, 2357 events. 1469/2357 cut-off events. For 453/455 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11568 event pairs, 317 based on Foata normal form. 8/2354 useless extension candidates. Maximal degree in co-relation 5537. Up to 1004 conditions per place. [2024-11-10 18:00:39,888 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 46 selfloop transitions, 3 changer transitions 28/83 dead transitions. [2024-11-10 18:00:39,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 399 flow [2024-11-10 18:00:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-11-10 18:00:39,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29107981220657275 [2024-11-10 18:00:39,891 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 122 flow. Second operand 6 states and 124 transitions. [2024-11-10 18:00:39,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 399 flow [2024-11-10 18:00:39,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 388 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 18:00:39,894 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 129 flow [2024-11-10 18:00:39,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2024-11-10 18:00:39,896 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -16 predicate places. [2024-11-10 18:00:39,896 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 129 flow [2024-11-10 18:00:39,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:39,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:39,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:39,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 18:00:40,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:40,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-10 18:00:40,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1396173232, now seen corresponding path program 3 times [2024-11-10 18:00:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131113931] [2024-11-10 18:00:40,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:00:40,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:40,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:40,108 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:40,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 18:00:40,264 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-10 18:00:40,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-10 18:00:40,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:00:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:00:40,421 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:00:40,421 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:00:40,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-10 18:00:40,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-10 18:00:40,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-10 18:00:40,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2024-11-10 18:00:40,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-10 18:00:40,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-10 18:00:40,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-10 18:00:40,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-10 18:00:40,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-10 18:00:40,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-10 18:00:40,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-10 18:00:40,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-10 18:00:40,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-10 18:00:40,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-10 18:00:40,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-10 18:00:40,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-10 18:00:40,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-10 18:00:40,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-10 18:00:40,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-10 18:00:40,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-10 18:00:40,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-10 18:00:40,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-10 18:00:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-10 18:00:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-10 18:00:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-10 18:00:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-10 18:00:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-10 18:00:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-10 18:00:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-10 18:00:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-10 18:00:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-10 18:00:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-10 18:00:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-10 18:00:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-10 18:00:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-10 18:00:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-10 18:00:40,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-10 18:00:40,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 18:00:40,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:40,633 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:40,754 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:00:40,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:00:40,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:00:40 BasicIcfg [2024-11-10 18:00:40,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:00:40,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:00:40,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:00:40,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:00:40,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:26" (3/4) ... [2024-11-10 18:00:40,764 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:00:40,766 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:00:40,766 INFO L158 Benchmark]: Toolchain (without parser) took 16649.81ms. Allocated memory was 79.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 45.8MB in the beginning and 1.0GB in the end (delta: -959.0MB). Peak memory consumption was 653.5MB. Max. memory is 16.1GB. [2024-11-10 18:00:40,767 INFO L158 Benchmark]: CDTParser took 1.83ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:40,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.09ms. Allocated memory is still 79.7MB. Free memory was 45.6MB in the beginning and 40.6MB in the end (delta: 5.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-10 18:00:40,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.58ms. Allocated memory is still 79.7MB. Free memory was 40.6MB in the beginning and 38.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:00:40,768 INFO L158 Benchmark]: Boogie Preprocessor took 74.81ms. Allocated memory is still 79.7MB. Free memory was 38.0MB in the beginning and 34.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:00:40,768 INFO L158 Benchmark]: IcfgBuilder took 1584.07ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 41.2MB in the end (delta: -7.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-10 18:00:40,769 INFO L158 Benchmark]: TraceAbstraction took 14254.95ms. Allocated memory was 96.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 40.5MB in the beginning and 1.0GB in the end (delta: -964.3MB). Peak memory consumption was 631.6MB. Max. memory is 16.1GB. [2024-11-10 18:00:40,769 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 1.7GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:40,770 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.83ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.09ms. Allocated memory is still 79.7MB. Free memory was 45.6MB in the beginning and 40.6MB in the end (delta: 5.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.58ms. Allocated memory is still 79.7MB. Free memory was 40.6MB in the beginning and 38.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.81ms. Allocated memory is still 79.7MB. Free memory was 38.0MB in the beginning and 34.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1584.07ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 41.2MB in the end (delta: -7.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14254.95ms. Allocated memory was 96.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 40.5MB in the beginning and 1.0GB in the end (delta: -964.3MB). Peak memory consumption was 631.6MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 1.7GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2049=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2049=-1, t2050=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 __unbuffered_p0_EBX = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t2051; [L794] 2 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2049=-1, t2050=0, t2051=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049=-1, t2050=0, t2051=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049=-1, t2050=0, t2051=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049=-1, t2050=0, t2051=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L18] 0 __assert_fail ("0", "safe012_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 842]: 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: 840]: 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 7 procedures, 116 locations, 55 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: 13.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 454 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 5 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=5, InterpolantAutomatonStates: 44, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1006 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:00:40,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample