./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix023_tso.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/mix023_tso.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 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:28:16,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:28:16,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:28:16,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:28:16,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:28:16,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:28:16,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:28:16,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:28:16,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:28:16,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:28:16,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:28:16,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:28:16,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:28:16,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:28:16,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:28:16,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:28:16,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:28:16,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:28:16,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:28:16,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:28:16,283 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:28:16,287 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:28:16,287 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:28:16,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:28:16,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:28:16,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:28:16,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:28:16,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:28:16,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:28:16,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:28:16,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:28:16,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:28:16,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:28:16,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:28:16,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:28:16,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:28:16,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:28:16,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:28:16,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:28:16,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:28:16,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:28:16,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:28:16,293 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 -> 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 [2024-11-09 10:28:16,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:28:16,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:28:16,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:28:16,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:28:16,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:28:16,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix023_tso.i [2024-11-09 10:28:18,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:28:18,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:28:18,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix023_tso.i [2024-11-09 10:28:18,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f845b7f0d/626a3a0f3dad404e8b0447ffa4221a07/FLAGfba5a63c5 [2024-11-09 10:28:18,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f845b7f0d/626a3a0f3dad404e8b0447ffa4221a07 [2024-11-09 10:28:18,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:28:18,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:28:18,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:28:18,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:28:18,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:28:18,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:18,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c990f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18, skipping insertion in model container [2024-11-09 10:28:18,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:18,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:28:18,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:28:18,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:28:18,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:28:18,988 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:28:18,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18 WrapperNode [2024-11-09 10:28:18,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:28:18,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:28:18,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:28:18,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:28:18,998 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:28:18" (1/1) ... [2024-11-09 10:28:19,031 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:28:18" (1/1) ... [2024-11-09 10:28:19,084 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 279 [2024-11-09 10:28:19,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:28:19,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:28:19,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:28:19,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:28:19,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,148 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:28:19,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:28:19,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:28:19,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:28:19,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:28:19,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (1/1) ... [2024-11-09 10:28:19,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:28:19,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:28:19,342 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:28:19,347 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:28:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:28:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:28:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:28:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:28:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:28:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:28:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:28:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:28:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-09 10:28:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-09 10:28:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:28:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:28:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:28:19,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:28:19,403 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:28:19,592 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:28:19,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:28:20,114 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:28:20,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:28:20,587 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:28:20,588 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:28:20,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:20 BoogieIcfgContainer [2024-11-09 10:28:20,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:28:20,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:28:20,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:28:20,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:28:20,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:28:18" (1/3) ... [2024-11-09 10:28:20,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675533d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:20, skipping insertion in model container [2024-11-09 10:28:20,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:18" (2/3) ... [2024-11-09 10:28:20,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675533d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:20, skipping insertion in model container [2024-11-09 10:28:20,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:20" (3/3) ... [2024-11-09 10:28:20,601 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2024-11-09 10:28:20,616 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:28:20,617 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 10:28:20,617 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:28:20,709 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:28:20,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 56 transitions, 128 flow [2024-11-09 10:28:20,793 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2024-11-09 10:28:20,794 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:20,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-11-09 10:28:20,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 56 transitions, 128 flow [2024-11-09 10:28:20,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 52 transitions, 116 flow [2024-11-09 10:28:20,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:28:20,821 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;@43329d4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:28:20,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 10:28:20,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:28:20,827 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:28:20,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:20,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:20,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:28:20,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2139914244, now seen corresponding path program 1 times [2024-11-09 10:28:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:20,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756885384] [2024-11-09 10:28:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:20,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:21,327 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:28:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756885384] [2024-11-09 10:28:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756885384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:28:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284821203] [2024-11-09 10:28:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:21,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:28:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:21,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:28:21,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:28:21,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2024-11-09 10:28:21,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:28:21,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:21,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2024-11-09 10:28:21,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:23,927 INFO L124 PetriNetUnfolderBase]: 7180/11082 cut-off events. [2024-11-09 10:28:23,928 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:28:23,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20953 conditions, 11082 events. 7180/11082 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 81635 event pairs, 1032 based on Foata normal form. 540/11184 useless extension candidates. Maximal degree in co-relation 20941. Up to 8189 conditions per place. [2024-11-09 10:28:24,033 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 48 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-11-09 10:28:24,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 256 flow [2024-11-09 10:28:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:28:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:28:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-11-09 10:28:24,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-11-09 10:28:24,049 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 124 transitions. [2024-11-09 10:28:24,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 256 flow [2024-11-09 10:28:24,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:28:24,060 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2024-11-09 10:28:24,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-11-09 10:28:24,068 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2024-11-09 10:28:24,069 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2024-11-09 10:28:24,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:28:24,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:24,069 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:24,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:28:24,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:24,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1975186399, now seen corresponding path program 1 times [2024-11-09 10:28:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:24,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900056490] [2024-11-09 10:28:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:24,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:24,343 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:28:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900056490] [2024-11-09 10:28:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900056490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:24,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:24,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:28:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637402575] [2024-11-09 10:28:24,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:24,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:28:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:28:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:28:24,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2024-11-09 10:28:24,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:24,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2024-11-09 10:28:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:26,188 INFO L124 PetriNetUnfolderBase]: 5956/9267 cut-off events. [2024-11-09 10:28:26,188 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2024-11-09 10:28:26,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17936 conditions, 9267 events. 5956/9267 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 66112 event pairs, 1060 based on Foata normal form. 0/9207 useless extension candidates. Maximal degree in co-relation 17926. Up to 6517 conditions per place. [2024-11-09 10:28:26,265 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 40 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2024-11-09 10:28:26,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 228 flow [2024-11-09 10:28:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:28:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:28:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-09 10:28:26,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-11-09 10:28:26,269 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 3 states and 114 transitions. [2024-11-09 10:28:26,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 228 flow [2024-11-09 10:28:26,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:26,273 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-09 10:28:26,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-09 10:28:26,275 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2024-11-09 10:28:26,275 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-09 10:28:26,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:26,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:26,276 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:28:26,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:28:26,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:26,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash -476772857, now seen corresponding path program 1 times [2024-11-09 10:28:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178880279] [2024-11-09 10:28:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:26,397 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:28:26,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:26,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178880279] [2024-11-09 10:28:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178880279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:26,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:26,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:28:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486665169] [2024-11-09 10:28:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:28:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:26,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:28:26,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:28:26,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2024-11-09 10:28:26,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:26,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:26,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2024-11-09 10:28:26,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:27,965 INFO L124 PetriNetUnfolderBase]: 5296/8382 cut-off events. [2024-11-09 10:28:27,965 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2024-11-09 10:28:27,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16097 conditions, 8382 events. 5296/8382 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 60785 event pairs, 5296 based on Foata normal form. 225/8502 useless extension candidates. Maximal degree in co-relation 16087. Up to 7223 conditions per place. [2024-11-09 10:28:28,006 INFO L140 encePairwiseOnDemand]: 54/56 looper letters, 25 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-09 10:28:28,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 156 flow [2024-11-09 10:28:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:28:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:28:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-09 10:28:28,008 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-11-09 10:28:28,008 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 94 transitions. [2024-11-09 10:28:28,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 156 flow [2024-11-09 10:28:28,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:28,016 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-09 10:28:28,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-09 10:28:28,018 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2024-11-09 10:28:28,019 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-09 10:28:28,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:28,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:28,019 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:28:28,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:28:28,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:28,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash -476771573, now seen corresponding path program 1 times [2024-11-09 10:28:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:28,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926243114] [2024-11-09 10:28:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:28,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:28,407 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:28:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926243114] [2024-11-09 10:28:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926243114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:28,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:28,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:28:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613504810] [2024-11-09 10:28:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:28,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:28:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:28:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:28:28,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2024-11-09 10:28:28,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:28:28,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:28,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2024-11-09 10:28:28,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:29,861 INFO L124 PetriNetUnfolderBase]: 6013/9396 cut-off events. [2024-11-09 10:28:29,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:29,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17783 conditions, 9396 events. 6013/9396 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 68360 event pairs, 1213 based on Foata normal form. 0/9207 useless extension candidates. Maximal degree in co-relation 17777. Up to 3865 conditions per place. [2024-11-09 10:28:29,903 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 39 selfloop transitions, 2 changer transitions 56/114 dead transitions. [2024-11-09 10:28:29,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 114 transitions, 436 flow [2024-11-09 10:28:29,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:28:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:28:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2024-11-09 10:28:29,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6138392857142857 [2024-11-09 10:28:29,907 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 275 transitions. [2024-11-09 10:28:29,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 114 transitions, 436 flow [2024-11-09 10:28:29,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 114 transitions, 435 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:28:29,911 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 111 flow [2024-11-09 10:28:29,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-11-09 10:28:29,912 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-11-09 10:28:29,912 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 111 flow [2024-11-09 10:28:29,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:28:29,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:29,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:29,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:28:29,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:29,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1438825834, now seen corresponding path program 1 times [2024-11-09 10:28:29,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:29,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663257828] [2024-11-09 10:28:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:37,614 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:28:37,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663257828] [2024-11-09 10:28:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663257828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:37,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:37,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:28:37,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158217150] [2024-11-09 10:28:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:37,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:28:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:37,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:28:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:28:37,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2024-11-09 10:28:37,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:28:37,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:37,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2024-11-09 10:28:37,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:38,924 INFO L124 PetriNetUnfolderBase]: 6197/9292 cut-off events. [2024-11-09 10:28:38,924 INFO L125 PetriNetUnfolderBase]: For 1677/1677 co-relation queries the response was YES. [2024-11-09 10:28:38,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19666 conditions, 9292 events. 6197/9292 cut-off events. For 1677/1677 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 62773 event pairs, 1661 based on Foata normal form. 216/9433 useless extension candidates. Maximal degree in co-relation 19654. Up to 5041 conditions per place. [2024-11-09 10:28:38,998 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 38 selfloop transitions, 2 changer transitions 41/96 dead transitions. [2024-11-09 10:28:38,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 392 flow [2024-11-09 10:28:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:28:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:28:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2024-11-09 10:28:39,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5688775510204082 [2024-11-09 10:28:39,001 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 111 flow. Second operand 7 states and 223 transitions. [2024-11-09 10:28:39,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 392 flow [2024-11-09 10:28:39,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 370 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-09 10:28:39,066 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 115 flow [2024-11-09 10:28:39,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2024-11-09 10:28:39,068 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-11-09 10:28:39,068 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 115 flow [2024-11-09 10:28:39,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:28:39,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:39,068 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:39,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:28:39,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1482161367, now seen corresponding path program 1 times [2024-11-09 10:28:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:39,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848424941] [2024-11-09 10:28:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:39,558 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:28:39,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:39,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848424941] [2024-11-09 10:28:39,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848424941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:39,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:39,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:28:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332461030] [2024-11-09 10:28:39,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:39,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:28:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:39,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:28:39,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:28:39,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2024-11-09 10:28:39,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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:28:39,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:39,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2024-11-09 10:28:39,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:41,744 INFO L124 PetriNetUnfolderBase]: 11731/16537 cut-off events. [2024-11-09 10:28:41,744 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2024-11-09 10:28:41,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35826 conditions, 16537 events. 11731/16537 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 104041 event pairs, 1419 based on Foata normal form. 576/17055 useless extension candidates. Maximal degree in co-relation 35813. Up to 9073 conditions per place. [2024-11-09 10:28:41,868 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 60 selfloop transitions, 6 changer transitions 1/79 dead transitions. [2024-11-09 10:28:41,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 335 flow [2024-11-09 10:28:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:28:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:28:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-09 10:28:41,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6294642857142857 [2024-11-09 10:28:41,871 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 115 flow. Second operand 4 states and 141 transitions. [2024-11-09 10:28:41,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 335 flow [2024-11-09 10:28:41,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 319 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-09 10:28:41,929 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 145 flow [2024-11-09 10:28:41,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-11-09 10:28:41,931 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2024-11-09 10:28:41,932 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 145 flow [2024-11-09 10:28:41,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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:28:41,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:41,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:41,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:28:41,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:41,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2074912836, now seen corresponding path program 1 times [2024-11-09 10:28:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:41,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141511809] [2024-11-09 10:28:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:42,455 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:28:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141511809] [2024-11-09 10:28:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141511809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:42,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:28:42,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734648802] [2024-11-09 10:28:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:42,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:28:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:28:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:28:42,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2024-11-09 10:28:42,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:28:42,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:42,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2024-11-09 10:28:42,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:43,765 INFO L124 PetriNetUnfolderBase]: 8979/12809 cut-off events. [2024-11-09 10:28:43,765 INFO L125 PetriNetUnfolderBase]: For 3384/3384 co-relation queries the response was YES. [2024-11-09 10:28:43,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30940 conditions, 12809 events. 8979/12809 cut-off events. For 3384/3384 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 77409 event pairs, 655 based on Foata normal form. 512/13270 useless extension candidates. Maximal degree in co-relation 30929. Up to 5617 conditions per place. [2024-11-09 10:28:43,857 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 77 selfloop transitions, 10 changer transitions 1/100 dead transitions. [2024-11-09 10:28:43,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 100 transitions, 462 flow [2024-11-09 10:28:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:28:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:28:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-11-09 10:28:43,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-11-09 10:28:43,863 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 145 flow. Second operand 5 states and 180 transitions. [2024-11-09 10:28:43,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 100 transitions, 462 flow [2024-11-09 10:28:43,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 451 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:43,869 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 197 flow [2024-11-09 10:28:43,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-11-09 10:28:43,870 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-11-09 10:28:43,870 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 197 flow [2024-11-09 10:28:43,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:28:43,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:43,871 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] [2024-11-09 10:28:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:28:43,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash 275860485, now seen corresponding path program 1 times [2024-11-09 10:28:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007729529] [2024-11-09 10:28:43,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:44,435 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:28:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007729529] [2024-11-09 10:28:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007729529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:44,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:44,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:28:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129930446] [2024-11-09 10:28:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:44,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:28:44,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:28:44,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:28:44,449 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2024-11-09 10:28:44,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:44,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:44,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2024-11-09 10:28:44,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:45,578 INFO L124 PetriNetUnfolderBase]: 5779/8313 cut-off events. [2024-11-09 10:28:45,578 INFO L125 PetriNetUnfolderBase]: For 6305/6305 co-relation queries the response was YES. [2024-11-09 10:28:45,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22028 conditions, 8313 events. 5779/8313 cut-off events. For 6305/6305 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 46547 event pairs, 463 based on Foata normal form. 320/8582 useless extension candidates. Maximal degree in co-relation 22015. Up to 2528 conditions per place. [2024-11-09 10:28:45,605 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 92 selfloop transitions, 14 changer transitions 1/119 dead transitions. [2024-11-09 10:28:45,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 119 transitions, 603 flow [2024-11-09 10:28:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:28:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:28:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-11-09 10:28:45,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-09 10:28:45,608 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 197 flow. Second operand 6 states and 217 transitions. [2024-11-09 10:28:45,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 119 transitions, 603 flow [2024-11-09 10:28:45,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 573 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:28:45,638 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 247 flow [2024-11-09 10:28:45,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-09 10:28:45,639 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2024-11-09 10:28:45,639 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 247 flow [2024-11-09 10:28:45,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:45,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:45,640 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] [2024-11-09 10:28:45,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:28:45,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash -52135125, now seen corresponding path program 1 times [2024-11-09 10:28:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769424879] [2024-11-09 10:28:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:51,421 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:28:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769424879] [2024-11-09 10:28:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769424879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:51,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:28:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921840474] [2024-11-09 10:28:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:51,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:28:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:28:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:28:51,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2024-11-09 10:28:51,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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:28:51,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:51,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2024-11-09 10:28:51,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:53,071 INFO L124 PetriNetUnfolderBase]: 6932/10825 cut-off events. [2024-11-09 10:28:53,071 INFO L125 PetriNetUnfolderBase]: For 5633/6388 co-relation queries the response was YES. [2024-11-09 10:28:53,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25920 conditions, 10825 events. 6932/10825 cut-off events. For 5633/6388 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 70848 event pairs, 2067 based on Foata normal form. 213/10626 useless extension candidates. Maximal degree in co-relation 25906. Up to 5426 conditions per place. [2024-11-09 10:28:53,119 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 76 selfloop transitions, 11 changer transitions 22/135 dead transitions. [2024-11-09 10:28:53,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 135 transitions, 668 flow [2024-11-09 10:28:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:28:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:28:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 262 transitions. [2024-11-09 10:28:53,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5848214285714286 [2024-11-09 10:28:53,122 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 247 flow. Second operand 8 states and 262 transitions. [2024-11-09 10:28:53,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 135 transitions, 668 flow [2024-11-09 10:28:53,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 135 transitions, 621 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-11-09 10:28:53,152 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 283 flow [2024-11-09 10:28:53,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-11-09 10:28:53,155 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2024-11-09 10:28:53,155 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 283 flow [2024-11-09 10:28:53,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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:28:53,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:53,155 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] [2024-11-09 10:28:53,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:28:53,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:28:53,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash 113706749, now seen corresponding path program 2 times [2024-11-09 10:28:53,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:53,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359313821] [2024-11-09 10:28:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:56,975 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:28:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359313821] [2024-11-09 10:28:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359313821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:56,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:28:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123200270] [2024-11-09 10:28:56,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:56,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:28:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:28:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:28:56,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 56 [2024-11-09 10:28:56,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 283 flow. Second operand has 12 states, 12 states have (on average 22.833333333333332) internal successors, (274), 12 states have internal predecessors, (274), 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:28:56,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:56,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 56 [2024-11-09 10:28:56,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:59,923 INFO L124 PetriNetUnfolderBase]: 13266/20955 cut-off events. [2024-11-09 10:28:59,924 INFO L125 PetriNetUnfolderBase]: For 12632/13476 co-relation queries the response was YES. [2024-11-09 10:29:00,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53318 conditions, 20955 events. 13266/20955 cut-off events. For 12632/13476 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 157160 event pairs, 3870 based on Foata normal form. 437/20184 useless extension candidates. Maximal degree in co-relation 53299. Up to 6634 conditions per place. [2024-11-09 10:29:00,077 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 127 selfloop transitions, 13 changer transitions 16/186 dead transitions. [2024-11-09 10:29:00,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 186 transitions, 1013 flow [2024-11-09 10:29:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:29:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:29:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 357 transitions. [2024-11-09 10:29:00,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6375 [2024-11-09 10:29:00,080 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 283 flow. Second operand 10 states and 357 transitions. [2024-11-09 10:29:00,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 186 transitions, 1013 flow [2024-11-09 10:29:00,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 186 transitions, 995 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-11-09 10:29:00,206 INFO L231 Difference]: Finished difference. Result has 87 places, 73 transitions, 374 flow [2024-11-09 10:29:00,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=374, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2024-11-09 10:29:00,207 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 24 predicate places. [2024-11-09 10:29:00,207 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 73 transitions, 374 flow [2024-11-09 10:29:00,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.833333333333332) internal successors, (274), 12 states have internal predecessors, (274), 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:29:00,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:29:00,207 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] [2024-11-09 10:29:00,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:29:00,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:29:00,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:29:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash -828613945, now seen corresponding path program 3 times [2024-11-09 10:29:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:29:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369916122] [2024-11-09 10:29:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:29:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:29:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:29:00,689 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:29:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:29:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369916122] [2024-11-09 10:29:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369916122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:29:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:29:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:29:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835390083] [2024-11-09 10:29:00,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:29:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:29:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:29:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:29:00,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:29:00,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2024-11-09 10:29:00,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 73 transitions, 374 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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:29:00,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:29:00,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2024-11-09 10:29:00,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:29:02,897 INFO L124 PetriNetUnfolderBase]: 16417/23401 cut-off events. [2024-11-09 10:29:02,897 INFO L125 PetriNetUnfolderBase]: For 30165/30253 co-relation queries the response was YES. [2024-11-09 10:29:03,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71551 conditions, 23401 events. 16417/23401 cut-off events. For 30165/30253 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 148800 event pairs, 1177 based on Foata normal form. 616/23768 useless extension candidates. Maximal degree in co-relation 71525. Up to 7424 conditions per place. [2024-11-09 10:29:03,089 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 91 selfloop transitions, 18 changer transitions 18/141 dead transitions. [2024-11-09 10:29:03,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 141 transitions, 901 flow [2024-11-09 10:29:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:29:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:29:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2024-11-09 10:29:03,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2024-11-09 10:29:03,091 INFO L175 Difference]: Start difference. First operand has 87 places, 73 transitions, 374 flow. Second operand 7 states and 228 transitions. [2024-11-09 10:29:03,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 141 transitions, 901 flow [2024-11-09 10:29:03,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 141 transitions, 876 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:29:03,610 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 364 flow [2024-11-09 10:29:03,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2024-11-09 10:29:03,611 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 26 predicate places. [2024-11-09 10:29:03,611 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 364 flow [2024-11-09 10:29:03,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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:29:03,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:29:03,611 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, 1, 1] [2024-11-09 10:29:03,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:29:03,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:29:03,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:29:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash 460585269, now seen corresponding path program 1 times [2024-11-09 10:29:03,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:29:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237804796] [2024-11-09 10:29:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:29:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:29:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:29:03,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:29:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:29:04,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:29:04,059 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:29:04,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2024-11-09 10:29:04,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2024-11-09 10:29:04,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 10 remaining) [2024-11-09 10:29:04,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2024-11-09 10:29:04,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-11-09 10:29:04,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-11-09 10:29:04,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-11-09 10:29:04,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-11-09 10:29:04,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2024-11-09 10:29:04,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2024-11-09 10:29:04,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:29:04,066 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:29:04,201 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:29:04,201 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:29:04,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:29:04 BasicIcfg [2024-11-09 10:29:04,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:29:04,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:29:04,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:29:04,207 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:29:04,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:20" (3/4) ... [2024-11-09 10:29:04,209 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:29:04,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:29:04,211 INFO L158 Benchmark]: Toolchain (without parser) took 45915.12ms. Allocated memory was 167.8MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 111.0MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 535.1MB. Max. memory is 16.1GB. [2024-11-09 10:29:04,211 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:29:04,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.19ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 78.4MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 10:29:04,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.87ms. Allocated memory is still 167.8MB. Free memory was 77.9MB in the beginning and 73.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:29:04,211 INFO L158 Benchmark]: Boogie Preprocessor took 166.35ms. Allocated memory is still 167.8MB. Free memory was 73.2MB in the beginning and 135.3MB in the end (delta: -62.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-09 10:29:04,212 INFO L158 Benchmark]: RCFGBuilder took 1335.00ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 135.3MB in the beginning and 167.5MB in the end (delta: -32.2MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-11-09 10:29:04,212 INFO L158 Benchmark]: TraceAbstraction took 43613.78ms. Allocated memory was 243.3MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 167.5MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 514.1MB. Max. memory is 16.1GB. [2024-11-09 10:29:04,212 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 3.8GB. Free memory is still 3.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:29:04,213 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.14ms. Allocated memory is still 167.8MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.19ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 78.4MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.87ms. Allocated memory is still 167.8MB. Free memory was 77.9MB in the beginning and 73.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 166.35ms. Allocated memory is still 167.8MB. Free memory was 73.2MB in the beginning and 135.3MB in the end (delta: -62.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1335.00ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 135.3MB in the beginning and 167.5MB in the end (delta: -32.2MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43613.78ms. Allocated memory was 243.3MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 167.5MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 514.1MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 3.8GB. Free memory is still 3.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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t625=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t625=-1, t626=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L924] 0 pthread_t t627; [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t625=-1, t626=0, t627=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L926] 0 pthread_t t628; [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t625=-1, t626=0, t627=1, t628=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L890] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625=-1, t626=0, t627=1, t628=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625=-1, t626=0, t627=1, t628=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625=-1, t626=0, t627=1, t628=2, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L973] 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}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix023_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 927]: 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: 925]: 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: 921]: 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: 923]: 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, 91 locations, 10 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: 43.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 884 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 847 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1708 IncrementalHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 35 mSDtfsCounter, 1708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=10, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 2644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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:29:04,267 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/mix023_tso.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 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:29:06,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:29:06,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:29:06,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:29:06,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:29:06,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:29:06,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:29:06,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:29:06,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:29:06,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:29:06,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:29:06,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:29:06,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:29:06,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:29:06,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:29:06,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:29:06,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:29:06,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:29:06,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:29:06,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:29:06,947 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:29:06,947 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:29:06,948 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:29:06,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:29:06,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:29:06,951 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:29:06,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:29:06,952 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:29:06,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:29:06,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:29:06,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:29:06,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:29:06,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:29:06,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:29:06,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:29:06,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:29:06,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:29:06,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:29:06,954 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:29:06,955 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:29:06,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:29:06,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:29:06,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:29:06,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:29:06,958 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 -> 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 [2024-11-09 10:29:07,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:29:07,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:29:07,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:29:07,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:29:07,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:29:07,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix023_tso.i [2024-11-09 10:29:08,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:29:09,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:29:09,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix023_tso.i [2024-11-09 10:29:09,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65413693a/4bd5add3d1c64b8ca93a1f2b5bc20cd3/FLAG3342eb2ad [2024-11-09 10:29:09,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65413693a/4bd5add3d1c64b8ca93a1f2b5bc20cd3 [2024-11-09 10:29:09,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:29:09,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:29:09,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:29:09,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:29:09,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:29:09,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:09,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398d937a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09, skipping insertion in model container [2024-11-09 10:29:09,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:09,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:29:09,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:29:09,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:29:09,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:29:09,989 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:29:09,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09 WrapperNode [2024-11-09 10:29:09,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:29:09,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:29:09,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:29:09,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:29:09,998 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:29:09" (1/1) ... [2024-11-09 10:29:10,023 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:29:09" (1/1) ... [2024-11-09 10:29:10,063 INFO L138 Inliner]: procedures = 177, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 280 [2024-11-09 10:29:10,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:29:10,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:29:10,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:29:10,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:29:10,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,132 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:29:10,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:29:10,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:29:10,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:29:10,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:29:10,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (1/1) ... [2024-11-09 10:29:10,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:29:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:29:10,221 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:29:10,228 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:29:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:29:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:29:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:29:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:29:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:29:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:29:10,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:29:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:29:10,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:29:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-09 10:29:10,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-09 10:29:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:29:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:29:10,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:29:10,278 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:29:10,505 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:29:10,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:29:11,080 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:29:11,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:29:11,540 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:29:11,540 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:29:11,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:29:11 BoogieIcfgContainer [2024-11-09 10:29:11,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:29:11,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:29:11,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:29:11,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:29:11,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:29:09" (1/3) ... [2024-11-09 10:29:11,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb1d90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:29:11, skipping insertion in model container [2024-11-09 10:29:11,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:29:09" (2/3) ... [2024-11-09 10:29:11,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb1d90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:29:11, skipping insertion in model container [2024-11-09 10:29:11,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:29:11" (3/3) ... [2024-11-09 10:29:11,549 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2024-11-09 10:29:11,568 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:29:11,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 10:29:11,569 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:29:11,668 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:29:11,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 56 transitions, 128 flow [2024-11-09 10:29:11,751 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2024-11-09 10:29:11,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:29:11,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-11-09 10:29:11,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 56 transitions, 128 flow [2024-11-09 10:29:11,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 52 transitions, 116 flow [2024-11-09 10:29:11,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:29:11,782 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;@c9b4306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:29:11,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 10:29:11,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:29:11,790 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:29:11,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:29:11,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:29:11,791 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:29:11,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:29:11,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:29:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2101425344, now seen corresponding path program 1 times [2024-11-09 10:29:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:29:11,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182716245] [2024-11-09 10:29:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:29:11,814 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:29:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:29:11,818 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:29:11,819 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:29:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:29:11,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:29:11,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:29:11,994 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:29:11,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:29:11,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:29:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182716245] [2024-11-09 10:29:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182716245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:29:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:29:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:29:11,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437570716] [2024-11-09 10:29:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:29:12,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:29:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:29:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:29:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:29:12,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2024-11-09 10:29:12,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:29:12,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:29:12,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2024-11-09 10:29:12,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:29:14,773 INFO L124 PetriNetUnfolderBase]: 7180/11082 cut-off events. [2024-11-09 10:29:14,773 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:29:14,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20953 conditions, 11082 events. 7180/11082 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 82143 event pairs, 1032 based on Foata normal form. 540/11168 useless extension candidates. Maximal degree in co-relation 20941. Up to 8189 conditions per place. [2024-11-09 10:29:14,892 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 48 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-11-09 10:29:14,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 256 flow [2024-11-09 10:29:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:29:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:29:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-11-09 10:29:14,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-11-09 10:29:14,904 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 124 transitions. [2024-11-09 10:29:14,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 256 flow [2024-11-09 10:29:14,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:29:14,910 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2024-11-09 10:29:14,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-11-09 10:29:14,918 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2024-11-09 10:29:14,920 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2024-11-09 10:29:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:29:14,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:29:14,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:29:14,927 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:29:15,124 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:29:15,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:29:15,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:29:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash -926646175, now seen corresponding path program 1 times [2024-11-09 10:29:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:29:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470886844] [2024-11-09 10:29:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:29:15,129 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:29:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:29:15,131 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:29:15,133 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:29:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:29:15,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:29:15,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:29:15,311 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:29:15,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:29:15,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:29:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470886844] [2024-11-09 10:29:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470886844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:29:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:29:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:29:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415169082] [2024-11-09 10:29:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:29:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:29:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:29:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:29:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:29:15,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2024-11-09 10:29:15,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:29:15,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:29:15,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2024-11-09 10:29:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:29:17,110 INFO L124 PetriNetUnfolderBase]: 5956/9267 cut-off events. [2024-11-09 10:29:17,110 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2024-11-09 10:29:17,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17936 conditions, 9267 events. 5956/9267 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 65946 event pairs, 1060 based on Foata normal form. 0/9170 useless extension candidates. Maximal degree in co-relation 17926. Up to 6517 conditions per place. [2024-11-09 10:29:17,184 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 40 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2024-11-09 10:29:17,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 228 flow [2024-11-09 10:29:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:29:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:29:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-09 10:29:17,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-11-09 10:29:17,187 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 3 states and 114 transitions. [2024-11-09 10:29:17,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 228 flow [2024-11-09 10:29:17,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:29:17,191 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-09 10:29:17,192 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-09 10:29:17,193 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2024-11-09 10:29:17,194 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-09 10:29:17,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:29:17,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:29:17,195 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:29:17,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:29:17,396 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:29:17,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:29:17,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:29:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1775660791, now seen corresponding path program 1 times [2024-11-09 10:29:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:29:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269115807] [2024-11-09 10:29:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:29:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:29:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:29:17,402 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:29:17,403 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:29:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:29:17,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:29:17,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:29:17,570 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:29:17,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:29:17,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:29:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269115807] [2024-11-09 10:29:17,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269115807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:29:17,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:29:17,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:29:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422603680] [2024-11-09 10:29:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:29:17,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:29:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:29:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:29:17,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:29:17,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2024-11-09 10:29:17,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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:29:17,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:29:17,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2024-11-09 10:29:17,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:29:20,616 INFO L124 PetriNetUnfolderBase]: 15891/23593 cut-off events. [2024-11-09 10:29:20,617 INFO L125 PetriNetUnfolderBase]: For 848/848 co-relation queries the response was YES. [2024-11-09 10:29:20,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46147 conditions, 23593 events. 15891/23593 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 168289 event pairs, 1419 based on Foata normal form. 576/24106 useless extension candidates. Maximal degree in co-relation 46137. Up to 14561 conditions per place. [2024-11-09 10:29:20,775 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 61 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-09 10:29:20,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 322 flow [2024-11-09 10:29:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:29:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:29:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-11-09 10:29:20,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6339285714285714 [2024-11-09 10:29:20,908 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 142 transitions. [2024-11-09 10:29:20,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 322 flow [2024-11-09 10:29:20,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:29:20,933 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-11-09 10:29:20,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-09 10:29:20,934 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2024-11-09 10:29:20,934 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-11-09 10:29:20,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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:29:20,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:29:20,934 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:29:20,952 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:29:21,138 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:29:21,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:29:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:29:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1667424443, now seen corresponding path program 1 times [2024-11-09 10:29:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:29:21,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480156246] [2024-11-09 10:29:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:29:21,145 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:29:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:29:21,151 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:29:21,161 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:29:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:29:21,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:29:21,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:29:21,358 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:29:21,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:29:21,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:29:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480156246] [2024-11-09 10:29:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480156246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:29:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:29:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:29:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499350411] [2024-11-09 10:29:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:29:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:29:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:29:21,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:29:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:29:21,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2024-11-09 10:29:21,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:29:21,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:29:21,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2024-11-09 10:29:21,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:29:23,603 INFO L124 PetriNetUnfolderBase]: 11123/16633 cut-off events. [2024-11-09 10:29:23,604 INFO L125 PetriNetUnfolderBase]: For 3528/3528 co-relation queries the response was YES. [2024-11-09 10:29:23,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36801 conditions, 16633 events. 11123/16633 cut-off events. For 3528/3528 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 112787 event pairs, 655 based on Foata normal form. 512/17089 useless extension candidates. Maximal degree in co-relation 36789. Up to 8513 conditions per place. [2024-11-09 10:29:23,686 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 78 selfloop transitions, 10 changer transitions 1/103 dead transitions. [2024-11-09 10:29:23,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 455 flow [2024-11-09 10:29:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:29:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:29:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2024-11-09 10:29:23,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6464285714285715 [2024-11-09 10:29:23,689 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 181 transitions. [2024-11-09 10:29:23,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 455 flow [2024-11-09 10:29:23,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 444 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:29:23,695 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-11-09 10:29:23,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-09 10:29:23,696 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-11-09 10:29:23,696 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-11-09 10:29:23,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:29:23,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:29:23,697 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:29:23,703 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:29:23,897 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:29:23,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2024-11-09 10:29:23,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:29:23,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2119018579, now seen corresponding path program 1 times [2024-11-09 10:29:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:29:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045663616] [2024-11-09 10:29:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:29:23,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:29:23,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:29:23,903 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:29:23,904 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:29:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:29:24,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:29:24,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:29:24,122 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:29:24,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:29:24,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:29:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045663616] [2024-11-09 10:29:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045663616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:29:24,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:29:24,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:29:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347713303] [2024-11-09 10:29:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:29:24,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:29:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:29:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:29:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:29:24,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2024-11-09 10:29:24,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:29:24,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:29:24,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2024-11-09 10:29:24,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:29:25,174 INFO L124 PetriNetUnfolderBase]: 6291/9321 cut-off events. [2024-11-09 10:29:25,174 INFO L125 PetriNetUnfolderBase]: For 6321/6321 co-relation queries the response was YES. [2024-11-09 10:29:25,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23105 conditions, 9321 events. 6291/9321 cut-off events. For 6321/6321 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 55018 event pairs, 463 based on Foata normal form. 320/9585 useless extension candidates. Maximal degree in co-relation 23091. Up to 2689 conditions per place. [2024-11-09 10:29:25,224 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 93 selfloop transitions, 14 changer transitions 1/122 dead transitions. [2024-11-09 10:29:25,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 594 flow