./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/mix053_tso.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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:31:31,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:31:31,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:31:31,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:31:31,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:31:31,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:31:31,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:31:31,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:31:31,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:31:31,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:31:31,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:31:31,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:31:31,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:31:31,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:31:31,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:31:31,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:31:31,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:31:31,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:31:31,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:31:31,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:31:31,770 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:31:31,770 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:31:31,770 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:31:31,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:31:31,771 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:31:31,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:31:31,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:31:31,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:31:31,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:31:31,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:31:31,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:31:31,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:31:31,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:31:31,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:31,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:31:31,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:31:31,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:31:31,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:31:31,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:31:31,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:31:31,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:31:31,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:31:31,779 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2024-11-09 10:31:32,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:31:32,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:31:32,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:31:32,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:31:32,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:31:32,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2024-11-09 10:31:33,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:31:33,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:31:33,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2024-11-09 10:31:33,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc0e93d6/aec6cfc8f18f4afab98223e5e4df0f11/FLAG080f44274 [2024-11-09 10:31:33,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc0e93d6/aec6cfc8f18f4afab98223e5e4df0f11 [2024-11-09 10:31:33,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:31:33,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:31:33,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:33,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:31:33,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:31:33,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:33" (1/1) ... [2024-11-09 10:31:33,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552cb4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:33, skipping insertion in model container [2024-11-09 10:31:33,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:33" (1/1) ... [2024-11-09 10:31:34,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:31:34,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:34,455 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:31:34,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:34,572 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:31:34,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34 WrapperNode [2024-11-09 10:31:34,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:34,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:34,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:31:34,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:31:34,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,630 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-11-09 10:31:34,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:34,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:31:34,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:31:34,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:31:34,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:31:34,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:31:34,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:31:34,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:31:34,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:31:34,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (1/1) ... [2024-11-09 10:31:34,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:31:34,745 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-09 10:31:34,749 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-09 10:31:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:31:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:31:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:31:34,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:31:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:31:34,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:31:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:31:34,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:31:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-09 10:31:34,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-09 10:31:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:31:34,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:31:34,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:31:34,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:31:34,815 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:31:35,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:31:35,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:31:35,432 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:31:35,432 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:31:35,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:31:35,649 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:31:35,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:35 BoogieIcfgContainer [2024-11-09 10:31:35,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:31:35,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:31:35,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:31:35,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:31:35,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:31:33" (1/3) ... [2024-11-09 10:31:35,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b3ff82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:35, skipping insertion in model container [2024-11-09 10:31:35,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:34" (2/3) ... [2024-11-09 10:31:35,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b3ff82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:35, skipping insertion in model container [2024-11-09 10:31:35,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:35" (3/3) ... [2024-11-09 10:31:35,659 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2024-11-09 10:31:35,677 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:31:35,677 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:31:35,677 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:31:35,745 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:31:35,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:31:35,823 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-09 10:31:35,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:35,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-09 10:31:35,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:31:35,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-09 10:31:35,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:31:35,854 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;@4385b944, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:31:35,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:31:35,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:31:35,888 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-09 10:31:35,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:35,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:35,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:35,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1406875628, now seen corresponding path program 1 times [2024-11-09 10:31:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590077172] [2024-11-09 10:31:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:36,480 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-09 10:31:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590077172] [2024-11-09 10:31:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590077172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:36,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:31:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078644079] [2024-11-09 10:31:36,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:36,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:31:36,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:36,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:31:36,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:31:36,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-11-09 10:31:36,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-09 10:31:36,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:36,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-11-09 10:31:36,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:37,239 INFO L124 PetriNetUnfolderBase]: 1711/2905 cut-off events. [2024-11-09 10:31:37,240 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-09 10:31:37,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 2905 events. 1711/2905 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 21158 event pairs, 310 based on Foata normal form. 144/3015 useless extension candidates. Maximal degree in co-relation 5389. Up to 1924 conditions per place. [2024-11-09 10:31:37,273 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 35 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-09 10:31:37,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 213 flow [2024-11-09 10:31:37,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:31:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:31:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-09 10:31:37,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2024-11-09 10:31:37,287 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 119 transitions. [2024-11-09 10:31:37,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 213 flow [2024-11-09 10:31:37,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:37,294 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-09 10:31:37,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-09 10:31:37,302 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-09 10:31:37,303 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-09 10:31:37,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-09 10:31:37,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:37,303 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:37,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:31:37,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:37,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash -390843965, now seen corresponding path program 1 times [2024-11-09 10:31:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35867928] [2024-11-09 10:31:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:37,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:37,417 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-09 10:31:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35867928] [2024-11-09 10:31:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35867928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:37,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:31:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977949757] [2024-11-09 10:31:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:37,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:31:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:31:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:31:37,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-09 10:31:37,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-09 10:31:37,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:37,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-09 10:31:37,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:37,849 INFO L124 PetriNetUnfolderBase]: 1525/2581 cut-off events. [2024-11-09 10:31:37,849 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-11-09 10:31:37,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4973 conditions, 2581 events. 1525/2581 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 18756 event pairs, 1525 based on Foata normal form. 72/2559 useless extension candidates. Maximal degree in co-relation 4963. Up to 2166 conditions per place. [2024-11-09 10:31:37,867 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 21 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-09 10:31:37,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 144 flow [2024-11-09 10:31:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:31:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:31:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-09 10:31:37,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-11-09 10:31:37,871 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 96 transitions. [2024-11-09 10:31:37,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 144 flow [2024-11-09 10:31:37,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:31:37,875 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2024-11-09 10:31:37,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-09 10:31:37,876 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-09 10:31:37,876 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2024-11-09 10:31:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-09 10:31:37,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:37,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:31:37,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:37,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash -390842678, now seen corresponding path program 1 times [2024-11-09 10:31:37,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:37,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415461942] [2024-11-09 10:31:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:38,189 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-09 10:31:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415461942] [2024-11-09 10:31:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415461942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:31:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66147719] [2024-11-09 10:31:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:31:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:31:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:31:38,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:31:38,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-09 10:31:38,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:38,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:31:38,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:39,264 INFO L124 PetriNetUnfolderBase]: 5957/8909 cut-off events. [2024-11-09 10:31:39,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:39,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17261 conditions, 8909 events. 5957/8909 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 60201 event pairs, 663 based on Foata normal form. 240/9104 useless extension candidates. Maximal degree in co-relation 17255. Up to 5353 conditions per place. [2024-11-09 10:31:39,319 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 48 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-11-09 10:31:39,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 266 flow [2024-11-09 10:31:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:31:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:31:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-11-09 10:31:39,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6462264150943396 [2024-11-09 10:31:39,322 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 4 states and 137 transitions. [2024-11-09 10:31:39,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 266 flow [2024-11-09 10:31:39,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:31:39,324 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 135 flow [2024-11-09 10:31:39,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-09 10:31:39,325 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-11-09 10:31:39,326 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 135 flow [2024-11-09 10:31:39,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-09 10:31:39,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:39,326 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-09 10:31:39,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:31:39,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:39,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash -587265265, now seen corresponding path program 1 times [2024-11-09 10:31:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:39,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960650808] [2024-11-09 10:31:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:39,612 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-09 10:31:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960650808] [2024-11-09 10:31:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960650808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:39,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:31:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734425417] [2024-11-09 10:31:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:39,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:31:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:31:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:31:39,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:31:39,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-09 10:31:39,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:39,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:31:39,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:40,648 INFO L124 PetriNetUnfolderBase]: 4789/7225 cut-off events. [2024-11-09 10:31:40,649 INFO L125 PetriNetUnfolderBase]: For 1840/1840 co-relation queries the response was YES. [2024-11-09 10:31:40,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16544 conditions, 7225 events. 4789/7225 cut-off events. For 1840/1840 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 47057 event pairs, 249 based on Foata normal form. 228/7416 useless extension candidates. Maximal degree in co-relation 16535. Up to 3841 conditions per place. [2024-11-09 10:31:40,712 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 61 selfloop transitions, 10 changer transitions 1/87 dead transitions. [2024-11-09 10:31:40,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 390 flow [2024-11-09 10:31:40,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:31:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:31:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-11-09 10:31:40,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6566037735849056 [2024-11-09 10:31:40,715 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 135 flow. Second operand 5 states and 174 transitions. [2024-11-09 10:31:40,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 390 flow [2024-11-09 10:31:40,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 379 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:31:40,720 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 187 flow [2024-11-09 10:31:40,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-09 10:31:40,726 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2024-11-09 10:31:40,729 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 187 flow [2024-11-09 10:31:40,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-09 10:31:40,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:40,730 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-09 10:31:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:31:40,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:40,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1653429520, now seen corresponding path program 1 times [2024-11-09 10:31:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644918102] [2024-11-09 10:31:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:41,032 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-09 10:31:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:41,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644918102] [2024-11-09 10:31:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644918102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:41,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:31:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634029520] [2024-11-09 10:31:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:41,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:31:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:41,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:31:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:31:41,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:31:41,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:41,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:41,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:31:41,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:41,633 INFO L124 PetriNetUnfolderBase]: 3029/4581 cut-off events. [2024-11-09 10:31:41,634 INFO L125 PetriNetUnfolderBase]: For 3441/3441 co-relation queries the response was YES. [2024-11-09 10:31:41,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11816 conditions, 4581 events. 3029/4581 cut-off events. For 3441/3441 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 26463 event pairs, 115 based on Foata normal form. 172/4721 useless extension candidates. Maximal degree in co-relation 11805. Up to 1633 conditions per place. [2024-11-09 10:31:41,669 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 72 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2024-11-09 10:31:41,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 513 flow [2024-11-09 10:31:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:31:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:31:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-11-09 10:31:41,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6572327044025157 [2024-11-09 10:31:41,673 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 187 flow. Second operand 6 states and 209 transitions. [2024-11-09 10:31:41,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 513 flow [2024-11-09 10:31:41,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 483 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:41,692 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 237 flow [2024-11-09 10:31:41,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-09 10:31:41,695 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-09 10:31:41,696 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 237 flow [2024-11-09 10:31:41,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:41,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:41,696 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, 1, 1] [2024-11-09 10:31:41,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:31:41,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:41,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1871255593, now seen corresponding path program 1 times [2024-11-09 10:31:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282254409] [2024-11-09 10:31:41,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:42,092 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-09 10:31:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282254409] [2024-11-09 10:31:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282254409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94469414] [2024-11-09 10:31:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:42,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:31:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:31:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:31:42,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:31:42,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-09 10:31:42,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:42,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:31:42,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:42,521 INFO L124 PetriNetUnfolderBase]: 1857/2741 cut-off events. [2024-11-09 10:31:42,522 INFO L125 PetriNetUnfolderBase]: For 3621/3621 co-relation queries the response was YES. [2024-11-09 10:31:42,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7921 conditions, 2741 events. 1857/2741 cut-off events. For 3621/3621 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14014 event pairs, 77 based on Foata normal form. 80/2789 useless extension candidates. Maximal degree in co-relation 7909. Up to 828 conditions per place. [2024-11-09 10:31:42,542 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 65 selfloop transitions, 18 changer transitions 1/99 dead transitions. [2024-11-09 10:31:42,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 99 transitions, 511 flow [2024-11-09 10:31:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:31:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:31:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-11-09 10:31:42,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091644204851752 [2024-11-09 10:31:42,544 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 237 flow. Second operand 7 states and 226 transitions. [2024-11-09 10:31:42,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 99 transitions, 511 flow [2024-11-09 10:31:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 99 transitions, 465 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-09 10:31:42,559 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 247 flow [2024-11-09 10:31:42,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-09 10:31:42,560 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-11-09 10:31:42,560 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 247 flow [2024-11-09 10:31:42,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-09 10:31:42,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:42,561 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:42,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:31:42,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:42,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 38577073, now seen corresponding path program 1 times [2024-11-09 10:31:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:42,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752551589] [2024-11-09 10:31:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:42,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:42,988 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-09 10:31:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:42,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752551589] [2024-11-09 10:31:42,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752551589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:42,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:31:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070578667] [2024-11-09 10:31:42,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:42,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:31:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:42,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:31:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:31:42,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-09 10:31:43,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-09 10:31:43,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:43,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-09 10:31:43,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:43,479 INFO L124 PetriNetUnfolderBase]: 2438/4220 cut-off events. [2024-11-09 10:31:43,479 INFO L125 PetriNetUnfolderBase]: For 2064/2235 co-relation queries the response was YES. [2024-11-09 10:31:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9667 conditions, 4220 events. 2438/4220 cut-off events. For 2064/2235 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 27652 event pairs, 1118 based on Foata normal form. 16/3858 useless extension candidates. Maximal degree in co-relation 9654. Up to 1681 conditions per place. [2024-11-09 10:31:43,507 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 36 selfloop transitions, 2 changer transitions 14/82 dead transitions. [2024-11-09 10:31:43,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 423 flow [2024-11-09 10:31:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:31:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:31:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-11-09 10:31:43,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6339622641509434 [2024-11-09 10:31:43,509 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 247 flow. Second operand 5 states and 168 transitions. [2024-11-09 10:31:43,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 423 flow [2024-11-09 10:31:43,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 317 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-09 10:31:43,523 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 167 flow [2024-11-09 10:31:43,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-11-09 10:31:43,524 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-09 10:31:43,524 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 167 flow [2024-11-09 10:31:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-09 10:31:43,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:43,525 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:43,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:31:43,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:43,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1531975643, now seen corresponding path program 2 times [2024-11-09 10:31:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740650243] [2024-11-09 10:31:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:44,861 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-09 10:31:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740650243] [2024-11-09 10:31:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740650243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:44,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:31:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957955449] [2024-11-09 10:31:44,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:44,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:31:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:44,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:31:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:31:44,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:31:44,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 167 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-09 10:31:44,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:44,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:31:44,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:46,792 INFO L124 PetriNetUnfolderBase]: 10216/16122 cut-off events. [2024-11-09 10:31:46,793 INFO L125 PetriNetUnfolderBase]: For 1876/1876 co-relation queries the response was YES. [2024-11-09 10:31:46,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33783 conditions, 16122 events. 10216/16122 cut-off events. For 1876/1876 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 115473 event pairs, 513 based on Foata normal form. 16/15535 useless extension candidates. Maximal degree in co-relation 33773. Up to 5298 conditions per place. [2024-11-09 10:31:46,872 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 57 selfloop transitions, 18 changer transitions 97/198 dead transitions. [2024-11-09 10:31:46,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 198 transitions, 869 flow [2024-11-09 10:31:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:31:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:31:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 435 transitions. [2024-11-09 10:31:46,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5862533692722371 [2024-11-09 10:31:46,875 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 167 flow. Second operand 14 states and 435 transitions. [2024-11-09 10:31:46,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 198 transitions, 869 flow [2024-11-09 10:31:46,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 198 transitions, 851 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:31:46,882 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 309 flow [2024-11-09 10:31:46,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=309, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2024-11-09 10:31:46,883 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2024-11-09 10:31:46,883 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 309 flow [2024-11-09 10:31:46,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-09 10:31:46,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:46,884 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:46,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:31:46,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:46,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1665988335, now seen corresponding path program 3 times [2024-11-09 10:31:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399577945] [2024-11-09 10:31:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:47,585 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-09 10:31:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399577945] [2024-11-09 10:31:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399577945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:31:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399156589] [2024-11-09 10:31:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:47,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:31:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:31:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:31:47,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:31:47,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 309 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-09 10:31:47,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:47,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:31:47,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:48,876 INFO L124 PetriNetUnfolderBase]: 7942/13175 cut-off events. [2024-11-09 10:31:48,877 INFO L125 PetriNetUnfolderBase]: For 9320/9498 co-relation queries the response was YES. [2024-11-09 10:31:48,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33629 conditions, 13175 events. 7942/13175 cut-off events. For 9320/9498 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 103019 event pairs, 1458 based on Foata normal form. 22/12248 useless extension candidates. Maximal degree in co-relation 33608. Up to 4223 conditions per place. [2024-11-09 10:31:48,939 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 34 selfloop transitions, 7 changer transitions 58/126 dead transitions. [2024-11-09 10:31:48,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 734 flow [2024-11-09 10:31:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:31:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:31:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2024-11-09 10:31:48,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5731132075471698 [2024-11-09 10:31:48,942 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 309 flow. Second operand 8 states and 243 transitions. [2024-11-09 10:31:48,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 734 flow [2024-11-09 10:31:48,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 126 transitions, 712 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-11-09 10:31:48,959 INFO L231 Difference]: Finished difference. Result has 86 places, 58 transitions, 261 flow [2024-11-09 10:31:48,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=86, PETRI_TRANSITIONS=58} [2024-11-09 10:31:48,960 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 26 predicate places. [2024-11-09 10:31:48,960 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 58 transitions, 261 flow [2024-11-09 10:31:48,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-09 10:31:48,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:48,961 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:48,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:31:48,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:48,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -254579987, now seen corresponding path program 4 times [2024-11-09 10:31:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:48,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516945239] [2024-11-09 10:31:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:51,804 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-09 10:31:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516945239] [2024-11-09 10:31:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516945239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 10:31:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95509964] [2024-11-09 10:31:51,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:51,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:31:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:51,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:31:51,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:31:51,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:31:51,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 58 transitions, 261 flow. Second operand has 11 states, 11 states have (on average 22.09090909090909) internal successors, (243), 11 states have internal predecessors, (243), 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-09 10:31:51,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:51,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:31:51,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:53,259 INFO L124 PetriNetUnfolderBase]: 7196/12528 cut-off events. [2024-11-09 10:31:53,260 INFO L125 PetriNetUnfolderBase]: For 13116/13252 co-relation queries the response was YES. [2024-11-09 10:31:53,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31970 conditions, 12528 events. 7196/12528 cut-off events. For 13116/13252 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 100980 event pairs, 2218 based on Foata normal form. 16/11503 useless extension candidates. Maximal degree in co-relation 31947. Up to 2778 conditions per place. [2024-11-09 10:31:53,312 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 49 selfloop transitions, 14 changer transitions 59/149 dead transitions. [2024-11-09 10:31:53,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 149 transitions, 951 flow [2024-11-09 10:31:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:31:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:31:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 316 transitions. [2024-11-09 10:31:53,315 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5962264150943396 [2024-11-09 10:31:53,315 INFO L175 Difference]: Start difference. First operand has 86 places, 58 transitions, 261 flow. Second operand 10 states and 316 transitions. [2024-11-09 10:31:53,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 149 transitions, 951 flow [2024-11-09 10:31:53,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 149 transitions, 849 flow, removed 35 selfloop flow, removed 10 redundant places. [2024-11-09 10:31:53,335 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 348 flow [2024-11-09 10:31:53,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=348, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2024-11-09 10:31:53,336 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 25 predicate places. [2024-11-09 10:31:53,336 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 348 flow [2024-11-09 10:31:53,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.09090909090909) internal successors, (243), 11 states have internal predecessors, (243), 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-09 10:31:53,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:53,337 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:53,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:31:53,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:53,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash 424802037, now seen corresponding path program 5 times [2024-11-09 10:31:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:53,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245662632] [2024-11-09 10:31:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:31:53,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:31:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:31:53,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:31:53,505 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:31:53,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-09 10:31:53,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-09 10:31:53,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-09 10:31:53,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-09 10:31:53,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-09 10:31:53,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-09 10:31:53,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-09 10:31:53,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-09 10:31:53,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:31:53,510 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:53,604 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:31:53,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:31:53,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:31:53 BasicIcfg [2024-11-09 10:31:53,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:31:53,612 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:31:53,612 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:31:53,613 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:31:53,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:35" (3/4) ... [2024-11-09 10:31:53,618 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:31:53,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:31:53,622 INFO L158 Benchmark]: Toolchain (without parser) took 19673.76ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 107.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 287.4MB. Max. memory is 16.1GB. [2024-11-09 10:31:53,622 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:31:53,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.19ms. Allocated memory is still 163.6MB. Free memory was 107.5MB in the beginning and 122.5MB in the end (delta: -15.0MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-09 10:31:53,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.84ms. Allocated memory is still 163.6MB. Free memory was 122.5MB in the beginning and 119.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:31:53,623 INFO L158 Benchmark]: Boogie Preprocessor took 75.65ms. Allocated memory is still 163.6MB. Free memory was 119.2MB in the beginning and 115.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:31:53,623 INFO L158 Benchmark]: RCFGBuilder took 941.52ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 76.9MB in the end (delta: 38.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 10:31:53,623 INFO L158 Benchmark]: TraceAbstraction took 17959.31ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 76.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 259.1MB. Max. memory is 16.1GB. [2024-11-09 10:31:53,623 INFO L158 Benchmark]: Witness Printer took 6.55ms. Allocated memory is still 1.6GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:31:53,625 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.16ms. Allocated memory is still 96.5MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.19ms. Allocated memory is still 163.6MB. Free memory was 107.5MB in the beginning and 122.5MB in the end (delta: -15.0MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.84ms. Allocated memory is still 163.6MB. Free memory was 122.5MB in the beginning and 119.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.65ms. Allocated memory is still 163.6MB. Free memory was 119.2MB in the beginning and 115.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 941.52ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 76.9MB in the end (delta: 38.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17959.31ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 76.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 259.1MB. Max. memory is 16.1GB. * Witness Printer took 6.55ms. Allocated memory is still 1.6GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, t1434=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=-3, t1434=-2, t1435=-1, t1436=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix053_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 844]: 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: 848]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 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: 17.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 798 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 771 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1766 IncrementalHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 60 mSDtfsCounter, 1766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=10, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 1498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-09 10:31:53,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/mix053_tso.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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:31:56,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:31:56,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:31:56,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:31:56,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:31:56,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:31:56,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:31:56,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:31:56,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:31:56,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:31:56,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:31:56,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:31:56,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:31:56,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:31:56,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:31:56,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:31:56,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:31:56,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:31:56,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:31:56,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:31:56,267 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:31:56,268 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:31:56,268 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:31:56,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:31:56,269 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:31:56,270 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:31:56,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:31:56,270 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:31:56,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:31:56,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:31:56,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:31:56,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:31:56,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:31:56,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:31:56,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:31:56,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:56,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:31:56,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:31:56,275 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:31:56,275 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:31:56,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:31:56,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:31:56,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:31:56,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:31:56,276 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2024-11-09 10:31:56,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:31:56,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:31:56,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:31:56,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:31:56,652 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:31:56,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2024-11-09 10:31:58,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:31:58,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:31:58,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2024-11-09 10:31:58,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579114da1/3470d1ed885f41e3a36dfd55557b6372/FLAG92739707e [2024-11-09 10:31:58,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579114da1/3470d1ed885f41e3a36dfd55557b6372 [2024-11-09 10:31:58,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:31:58,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:31:58,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:58,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:31:58,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:31:58,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:58" (1/1) ... [2024-11-09 10:31:58,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd98346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:58, skipping insertion in model container [2024-11-09 10:31:58,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:58" (1/1) ... [2024-11-09 10:31:58,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:31:59,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:59,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:31:59,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:59,499 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:31:59,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59 WrapperNode [2024-11-09 10:31:59,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:59,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:59,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:31:59,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:31:59,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,581 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2024-11-09 10:31:59,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:59,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:31:59,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:31:59,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:31:59,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,621 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:31:59,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:31:59,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:31:59,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:31:59,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:31:59,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (1/1) ... [2024-11-09 10:31:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:59,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:31:59,677 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-09 10:31:59,679 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-09 10:31:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:31:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:31:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:31:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:31:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:31:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:31:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:31:59,731 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:31:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:31:59,731 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-09 10:31:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-09 10:31:59,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:31:59,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:31:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:31:59,733 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:31:59,891 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:31:59,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:32:00,261 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:32:00,262 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:32:00,576 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:32:00,577 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:32:00,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:32:00 BoogieIcfgContainer [2024-11-09 10:32:00,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:32:00,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:32:00,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:32:00,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:32:00,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:31:58" (1/3) ... [2024-11-09 10:32:00,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee86c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:32:00, skipping insertion in model container [2024-11-09 10:32:00,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:59" (2/3) ... [2024-11-09 10:32:00,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee86c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:32:00, skipping insertion in model container [2024-11-09 10:32:00,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:32:00" (3/3) ... [2024-11-09 10:32:00,588 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2024-11-09 10:32:00,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:32:00,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:32:00,608 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:32:00,680 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:32:00,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:32:00,744 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-09 10:32:00,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:00,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-09 10:32:00,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:32:00,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-09 10:32:00,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:32:00,770 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;@7491459c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:32:00,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:32:00,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:32:00,781 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-09 10:32:00,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:00,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:00,782 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:00,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -382047980, now seen corresponding path program 1 times [2024-11-09 10:32:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311488282] [2024-11-09 10:32:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:00,805 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-09 10:32:00,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:00,810 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-09 10:32:00,811 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-09 10:32:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:00,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:32:00,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:00,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-09 10:32:01,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:01,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311488282] [2024-11-09 10:32:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311488282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:01,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:01,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:32:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692797800] [2024-11-09 10:32:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:32:01,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:01,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:32:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:32:01,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-11-09 10:32:01,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-09 10:32:01,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:01,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-11-09 10:32:01,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:01,727 INFO L124 PetriNetUnfolderBase]: 1711/2905 cut-off events. [2024-11-09 10:32:01,727 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-09 10:32:01,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 2905 events. 1711/2905 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 21158 event pairs, 310 based on Foata normal form. 144/3015 useless extension candidates. Maximal degree in co-relation 5389. Up to 1924 conditions per place. [2024-11-09 10:32:01,757 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 35 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-09 10:32:01,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 213 flow [2024-11-09 10:32:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:32:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:32:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-09 10:32:01,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2024-11-09 10:32:01,774 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 119 transitions. [2024-11-09 10:32:01,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 213 flow [2024-11-09 10:32:01,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:01,780 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-09 10:32:01,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-09 10:32:01,786 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-09 10:32:01,786 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-09 10:32:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-09 10:32:01,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:01,787 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:01,794 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-09 10:32:01,991 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-09 10:32:01,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:01,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:01,993 INFO L85 PathProgramCache]: Analyzing trace with hash 688009157, now seen corresponding path program 1 times [2024-11-09 10:32:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:01,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706819591] [2024-11-09 10:32:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:01,994 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-09 10:32:01,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:01,998 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-09 10:32:01,999 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-09 10:32:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:02,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:32:02,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:02,170 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-09 10:32:02,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:02,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706819591] [2024-11-09 10:32:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706819591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:02,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:02,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:32:02,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487497973] [2024-11-09 10:32:02,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:02,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:32:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:02,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:32:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:32:02,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:32:02,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-09 10:32:02,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:02,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:32:02,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:03,449 INFO L124 PetriNetUnfolderBase]: 6621/10029 cut-off events. [2024-11-09 10:32:03,449 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2024-11-09 10:32:03,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19749 conditions, 10029 events. 6621/10029 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 69783 event pairs, 663 based on Foata normal form. 240/10224 useless extension candidates. Maximal degree in co-relation 19739. Up to 6245 conditions per place. [2024-11-09 10:32:03,532 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 49 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2024-11-09 10:32:03,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 278 flow [2024-11-09 10:32:03,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:32:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:32:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-11-09 10:32:03,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-11-09 10:32:03,535 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 4 states and 138 transitions. [2024-11-09 10:32:03,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 278 flow [2024-11-09 10:32:03,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:32:03,539 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 138 flow [2024-11-09 10:32:03,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-11-09 10:32:03,541 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2024-11-09 10:32:03,542 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 138 flow [2024-11-09 10:32:03,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-09 10:32:03,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:03,542 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-09 10:32:03,548 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-09 10:32:03,746 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-09 10:32:03,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:03,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1241542780, now seen corresponding path program 1 times [2024-11-09 10:32:03,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:03,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529987260] [2024-11-09 10:32:03,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:03,748 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-09 10:32:03,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:03,750 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-09 10:32:03,752 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-09 10:32:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:03,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:32:03,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:03,900 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-09 10:32:03,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:03,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529987260] [2024-11-09 10:32:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529987260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:32:03,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914324859] [2024-11-09 10:32:03,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:32:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:03,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:32:03,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:32:03,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:32:03,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-09 10:32:03,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:03,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:32:03,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:04,988 INFO L124 PetriNetUnfolderBase]: 5257/8037 cut-off events. [2024-11-09 10:32:04,988 INFO L125 PetriNetUnfolderBase]: For 1968/1968 co-relation queries the response was YES. [2024-11-09 10:32:05,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18123 conditions, 8037 events. 5257/8037 cut-off events. For 1968/1968 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 53942 event pairs, 249 based on Foata normal form. 228/8228 useless extension candidates. Maximal degree in co-relation 18111. Up to 4481 conditions per place. [2024-11-09 10:32:05,064 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 62 selfloop transitions, 10 changer transitions 1/89 dead transitions. [2024-11-09 10:32:05,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 395 flow [2024-11-09 10:32:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:32:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:32:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-09 10:32:05,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.660377358490566 [2024-11-09 10:32:05,067 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 138 flow. Second operand 5 states and 175 transitions. [2024-11-09 10:32:05,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 395 flow [2024-11-09 10:32:05,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 384 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:32:05,165 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 190 flow [2024-11-09 10:32:05,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-11-09 10:32:05,166 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-11-09 10:32:05,167 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 190 flow [2024-11-09 10:32:05,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-09 10:32:05,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:05,172 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-09 10:32:05,189 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-09 10:32:05,373 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-09 10:32:05,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash 47573675, now seen corresponding path program 1 times [2024-11-09 10:32:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73812565] [2024-11-09 10:32:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:05,375 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-09 10:32:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:05,378 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-09 10:32:05,380 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-09 10:32:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:05,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:32:05,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:05,568 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-09 10:32:05,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:05,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73812565] [2024-11-09 10:32:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73812565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:32:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130590737] [2024-11-09 10:32:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:05,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:05,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:32:05,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:32:05,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:05,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:32:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:06,224 INFO L124 PetriNetUnfolderBase]: 3221/4933 cut-off events. [2024-11-09 10:32:06,224 INFO L125 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2024-11-09 10:32:06,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12503 conditions, 4933 events. 3221/4933 cut-off events. For 3537/3537 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 29220 event pairs, 115 based on Foata normal form. 172/5073 useless extension candidates. Maximal degree in co-relation 12489. Up to 1905 conditions per place. [2024-11-09 10:32:06,405 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 73 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2024-11-09 10:32:06,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 518 flow [2024-11-09 10:32:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-11-09 10:32:06,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.660377358490566 [2024-11-09 10:32:06,407 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 190 flow. Second operand 6 states and 210 transitions. [2024-11-09 10:32:06,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 518 flow [2024-11-09 10:32:06,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 104 transitions, 488 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:06,423 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 240 flow [2024-11-09 10:32:06,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-11-09 10:32:06,424 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2024-11-09 10:32:06,425 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 240 flow [2024-11-09 10:32:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:32:06,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:06,425 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, 1, 1] [2024-11-09 10:32:06,441 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-09 10:32:06,626 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-09 10:32:06,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1705469648, now seen corresponding path program 1 times [2024-11-09 10:32:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129825183] [2024-11-09 10:32:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:06,628 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-09 10:32:06,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:06,631 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-09 10:32:06,632 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-09 10:32:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:06,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:06,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:06,793 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-09 10:32:06,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:06,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129825183] [2024-11-09 10:32:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129825183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:06,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:06,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171623901] [2024-11-09 10:32:06,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:32:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:32:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:32:06,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-09 10:32:06,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-09 10:32:06,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:06,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-09 10:32:06,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:07,291 INFO L124 PetriNetUnfolderBase]: 1889/2805 cut-off events. [2024-11-09 10:32:07,291 INFO L125 PetriNetUnfolderBase]: For 3621/3621 co-relation queries the response was YES. [2024-11-09 10:32:07,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8032 conditions, 2805 events. 1889/2805 cut-off events. For 3621/3621 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14352 event pairs, 77 based on Foata normal form. 80/2853 useless extension candidates. Maximal degree in co-relation 8017. Up to 828 conditions per place. [2024-11-09 10:32:07,312 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 66 selfloop transitions, 18 changer transitions 1/101 dead transitions. [2024-11-09 10:32:07,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 516 flow [2024-11-09 10:32:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:32:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:32:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2024-11-09 10:32:07,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6118598382749326 [2024-11-09 10:32:07,313 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 240 flow. Second operand 7 states and 227 transitions. [2024-11-09 10:32:07,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 516 flow [2024-11-09 10:32:07,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 470 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-09 10:32:07,327 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 250 flow [2024-11-09 10:32:07,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-11-09 10:32:07,328 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-11-09 10:32:07,328 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 250 flow [2024-11-09 10:32:07,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-09 10:32:07,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:07,329 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:07,334 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 (6)] Ended with exit code 0 [2024-11-09 10:32:07,532 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-09 10:32:07,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:07,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1609149032, now seen corresponding path program 1 times [2024-11-09 10:32:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904061023] [2024-11-09 10:32:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:07,535 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-09 10:32:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:07,537 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-09 10:32:07,538 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-09 10:32:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:07,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:32:07,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:07,692 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-09 10:32:07,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:07,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:07,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904061023] [2024-11-09 10:32:07,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904061023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:07,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:07,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:32:07,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944078274] [2024-11-09 10:32:07,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:07,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:32:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:32:07,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:32:07,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-09 10:32:07,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-09 10:32:07,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:07,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-09 10:32:07,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:07,861 INFO L124 PetriNetUnfolderBase]: 855/1541 cut-off events. [2024-11-09 10:32:07,861 INFO L125 PetriNetUnfolderBase]: For 562/595 co-relation queries the response was YES. [2024-11-09 10:32:07,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3386 conditions, 1541 events. 855/1541 cut-off events. For 562/595 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9063 event pairs, 803 based on Foata normal form. 16/1392 useless extension candidates. Maximal degree in co-relation 3370. Up to 1236 conditions per place. [2024-11-09 10:32:07,875 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 21 selfloop transitions, 1 changer transitions 1/55 dead transitions. [2024-11-09 10:32:07,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 294 flow [2024-11-09 10:32:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:32:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:32:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-09 10:32:07,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-11-09 10:32:07,878 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 250 flow. Second operand 3 states and 96 transitions. [2024-11-09 10:32:07,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 294 flow [2024-11-09 10:32:07,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 198 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-09 10:32:07,882 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 152 flow [2024-11-09 10:32:07,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-09 10:32:07,885 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-11-09 10:32:07,885 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 152 flow [2024-11-09 10:32:07,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-09 10:32:07,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:07,886 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:07,891 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 (7)] Ended with exit code 0 [2024-11-09 10:32:08,089 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-09 10:32:08,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2123788651, now seen corresponding path program 1 times [2024-11-09 10:32:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633392569] [2024-11-09 10:32:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:08,092 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-09 10:32:08,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:08,093 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-09 10:32:08,094 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-09 10:32:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:08,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:32:08,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:08,503 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-09 10:32:08,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:08,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633392569] [2024-11-09 10:32:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633392569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:08,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:32:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901170901] [2024-11-09 10:32:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:08,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:32:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:08,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:32:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:32:08,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-09 10:32:08,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-09 10:32:08,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:08,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-09 10:32:08,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:09,069 INFO L124 PetriNetUnfolderBase]: 2438/4220 cut-off events. [2024-11-09 10:32:09,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:09,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8253 conditions, 4220 events. 2438/4220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 27661 event pairs, 1118 based on Foata normal form. 16/3858 useless extension candidates. Maximal degree in co-relation 8246. Up to 1681 conditions per place. [2024-11-09 10:32:09,102 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 36 selfloop transitions, 2 changer transitions 14/82 dead transitions. [2024-11-09 10:32:09,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 318 flow [2024-11-09 10:32:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:32:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:32:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-11-09 10:32:09,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6339622641509434 [2024-11-09 10:32:09,105 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 152 flow. Second operand 5 states and 168 transitions. [2024-11-09 10:32:09,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 318 flow [2024-11-09 10:32:09,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:32:09,109 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 167 flow [2024-11-09 10:32:09,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-11-09 10:32:09,110 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-09 10:32:09,110 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 167 flow [2024-11-09 10:32:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-09 10:32:09,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:09,111 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:09,117 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-09 10:32:09,311 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-09 10:32:09,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:09,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:09,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1099332899, now seen corresponding path program 2 times [2024-11-09 10:32:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:09,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977696922] [2024-11-09 10:32:09,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:32:09,314 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-09 10:32:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:09,317 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-09 10:32:09,318 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-09 10:32:09,422 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:32:09,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:09,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:09,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:09,613 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-09 10:32:09,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:09,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:09,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977696922] [2024-11-09 10:32:09,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977696922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:09,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220149169] [2024-11-09 10:32:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:09,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:09,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:09,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:09,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-09 10:32:09,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-09 10:32:09,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:09,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-09 10:32:09,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:10,430 INFO L124 PetriNetUnfolderBase]: 3872/6666 cut-off events. [2024-11-09 10:32:10,430 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-09 10:32:10,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13293 conditions, 6666 events. 3872/6666 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 48416 event pairs, 870 based on Foata normal form. 16/6172 useless extension candidates. Maximal degree in co-relation 13283. Up to 2714 conditions per place. [2024-11-09 10:32:10,471 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 1 changer transitions 29/91 dead transitions. [2024-11-09 10:32:10,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 369 flow [2024-11-09 10:32:10,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-11-09 10:32:10,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6257861635220126 [2024-11-09 10:32:10,473 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 167 flow. Second operand 6 states and 199 transitions. [2024-11-09 10:32:10,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 369 flow [2024-11-09 10:32:10,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 361 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:32:10,488 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 172 flow [2024-11-09 10:32:10,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-11-09 10:32:10,489 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-11-09 10:32:10,489 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 172 flow [2024-11-09 10:32:10,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-09 10:32:10,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:10,489 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:10,499 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:32:10,690 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-09 10:32:10,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:10,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1463766977, now seen corresponding path program 3 times [2024-11-09 10:32:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:10,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896056561] [2024-11-09 10:32:10,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:32:10,692 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-09 10:32:10,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:10,697 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-09 10:32:10,700 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-09 10:32:10,809 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:32:10,809 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:10,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 10:32:10,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:11,169 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-09 10:32:11,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:11,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:11,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896056561] [2024-11-09 10:32:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896056561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:11,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:32:11,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362453839] [2024-11-09 10:32:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:11,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:32:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:32:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:32:11,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-09 10:32:11,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 172 flow. Second operand has 8 states, 8 states have (on average 26.375) internal successors, (211), 8 states have internal predecessors, (211), 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-09 10:32:11,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:11,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-09 10:32:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:11,784 INFO L124 PetriNetUnfolderBase]: 3608/6116 cut-off events. [2024-11-09 10:32:11,784 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-09 10:32:11,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12387 conditions, 6116 events. 3608/6116 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 43763 event pairs, 1253 based on Foata normal form. 16/5505 useless extension candidates. Maximal degree in co-relation 12375. Up to 2592 conditions per place. [2024-11-09 10:32:11,822 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 32 selfloop transitions, 4 changer transitions 12/80 dead transitions. [2024-11-09 10:32:11,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 328 flow [2024-11-09 10:32:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2024-11-09 10:32:11,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6069182389937107 [2024-11-09 10:32:11,825 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 172 flow. Second operand 6 states and 193 transitions. [2024-11-09 10:32:11,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 328 flow [2024-11-09 10:32:11,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 317 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:11,829 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 190 flow [2024-11-09 10:32:11,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-09 10:32:11,830 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2024-11-09 10:32:11,831 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 190 flow [2024-11-09 10:32:11,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.375) internal successors, (211), 8 states have internal predecessors, (211), 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-09 10:32:11,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:11,832 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:11,837 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-09 10:32:12,032 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-09 10:32:12,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:12,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1105411759, now seen corresponding path program 4 times [2024-11-09 10:32:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446340657] [2024-11-09 10:32:12,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:32:12,034 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-09 10:32:12,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:12,035 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-09 10:32:12,036 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-09 10:32:12,133 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:32:12,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:12,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 10:32:12,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:12,335 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-09 10:32:12,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:12,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446340657] [2024-11-09 10:32:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446340657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:32:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704118143] [2024-11-09 10:32:12,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:12,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:32:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:32:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:32:12,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-09 10:32:12,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 26.375) internal successors, (211), 8 states have internal predecessors, (211), 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-09 10:32:12,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:12,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-09 10:32:12,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:13,087 INFO L124 PetriNetUnfolderBase]: 6439/10949 cut-off events. [2024-11-09 10:32:13,087 INFO L125 PetriNetUnfolderBase]: For 1480/1538 co-relation queries the response was YES. [2024-11-09 10:32:13,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23458 conditions, 10949 events. 6439/10949 cut-off events. For 1480/1538 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 85157 event pairs, 1731 based on Foata normal form. 23/9950 useless extension candidates. Maximal degree in co-relation 23445. Up to 2955 conditions per place. [2024-11-09 10:32:13,152 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 54 selfloop transitions, 9 changer transitions 13/108 dead transitions. [2024-11-09 10:32:13,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 487 flow [2024-11-09 10:32:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:32:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:32:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-11-09 10:32:13,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6495956873315364 [2024-11-09 10:32:13,155 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 190 flow. Second operand 7 states and 241 transitions. [2024-11-09 10:32:13,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 487 flow [2024-11-09 10:32:13,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 467 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:13,160 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 255 flow [2024-11-09 10:32:13,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2024-11-09 10:32:13,161 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2024-11-09 10:32:13,162 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 255 flow [2024-11-09 10:32:13,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.375) internal successors, (211), 8 states have internal predecessors, (211), 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-09 10:32:13,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:13,162 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:13,167 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-09 10:32:13,363 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-09 10:32:13,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash -282265737, now seen corresponding path program 5 times [2024-11-09 10:32:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090648471] [2024-11-09 10:32:13,365 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:32:13,365 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-09 10:32:13,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:13,372 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-09 10:32:13,373 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-09 10:32:13,464 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:32:13,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:13,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:13,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:13,534 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-09 10:32:13,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:13,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090648471] [2024-11-09 10:32:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090648471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:13,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862924902] [2024-11-09 10:32:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:13,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:13,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-09 10:32:13,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-09 10:32:13,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:13,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-09 10:32:13,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:14,849 INFO L124 PetriNetUnfolderBase]: 12360/20705 cut-off events. [2024-11-09 10:32:14,849 INFO L125 PetriNetUnfolderBase]: For 5828/5866 co-relation queries the response was YES. [2024-11-09 10:32:14,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47172 conditions, 20705 events. 12360/20705 cut-off events. For 5828/5866 co-relation queries the response was YES. Maximal size of possible extension queue 1536. Compared 175371 event pairs, 4948 based on Foata normal form. 38/18902 useless extension candidates. Maximal degree in co-relation 47156. Up to 7629 conditions per place. [2024-11-09 10:32:15,239 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 1 changer transitions 41/103 dead transitions. [2024-11-09 10:32:15,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 555 flow [2024-11-09 10:32:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-11-09 10:32:15,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.60062893081761 [2024-11-09 10:32:15,242 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 255 flow. Second operand 6 states and 191 transitions. [2024-11-09 10:32:15,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 555 flow [2024-11-09 10:32:15,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 541 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:32:15,253 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 236 flow [2024-11-09 10:32:15,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2024-11-09 10:32:15,254 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2024-11-09 10:32:15,258 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 236 flow [2024-11-09 10:32:15,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-09 10:32:15,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:15,259 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:15,268 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-09 10:32:15,459 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-09 10:32:15,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:15,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1488954595, now seen corresponding path program 6 times [2024-11-09 10:32:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712695164] [2024-11-09 10:32:15,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 10:32:15,461 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-09 10:32:15,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:15,463 INFO L229 MonitoredProcess]: Starting monitored process 13 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-09 10:32:15,466 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 (13)] Waiting until timeout for monitored process [2024-11-09 10:32:15,548 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-09 10:32:15,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:32:15,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:32:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:32:15,673 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:32:15,673 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:32:15,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-09 10:32:15,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-09 10:32:15,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-09 10:32:15,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-09 10:32:15,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-09 10:32:15,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-09 10:32:15,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-09 10:32:15,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-09 10:32:15,684 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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 10:32:15,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-09 10:32:15,879 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:15,984 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:32:15,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:32:15,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:32:15 BasicIcfg [2024-11-09 10:32:15,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:32:15,990 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:32:15,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:32:15,990 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:32:15,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:32:00" (3/4) ... [2024-11-09 10:32:15,992 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:32:15,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:32:15,994 INFO L158 Benchmark]: Toolchain (without parser) took 17142.15ms. Allocated memory was 77.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 43.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 248.9MB. Max. memory is 16.1GB. [2024-11-09 10:32:15,995 INFO L158 Benchmark]: CDTParser took 1.87ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:15,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.40ms. Allocated memory is still 77.6MB. Free memory was 43.6MB in the beginning and 38.8MB in the end (delta: 4.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 10:32:15,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.52ms. Allocated memory is still 77.6MB. Free memory was 38.8MB in the beginning and 36.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:15,995 INFO L158 Benchmark]: Boogie Preprocessor took 55.64ms. Allocated memory is still 77.6MB. Free memory was 36.1MB in the beginning and 32.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:15,996 INFO L158 Benchmark]: RCFGBuilder took 938.67ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 32.3MB in the beginning and 59.5MB in the end (delta: -27.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:15,996 INFO L158 Benchmark]: TraceAbstraction took 15408.68ms. Allocated memory was 94.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 58.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. [2024-11-09 10:32:15,996 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:16,000 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.87ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.40ms. Allocated memory is still 77.6MB. Free memory was 43.6MB in the beginning and 38.8MB in the end (delta: 4.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.52ms. Allocated memory is still 77.6MB. Free memory was 38.8MB in the beginning and 36.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.64ms. Allocated memory is still 77.6MB. Free memory was 36.1MB in the beginning and 32.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 938.67ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 32.3MB in the beginning and 59.5MB in the end (delta: -27.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15408.68ms. Allocated memory was 94.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 58.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433=0, t1434=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433=0, t1434=1, t1435=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433=0, t1434=1, t1435=2, t1436=3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=0, t1434=1, t1435=2, t1436=3, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=0, t1434=1, t1435=2, t1436=3, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433=0, t1434=1, t1435=2, t1436=3, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix053_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 844]: 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: 848]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 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: 15.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 8 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=10, InterpolantAutomatonStates: 58, 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, 1.5s InterpolantComputationTime, 365 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 1198 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1410 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-09 10:32:16,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample