./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:28:02,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:28:02,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:28:02,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:28:02,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:28:02,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:28:02,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:28:02,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:28:02,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:28:02,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:28:02,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:28:02,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:28:02,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:28:02,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:28:02,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:28:02,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:28:02,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:28:02,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:28:02,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:28:02,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:28:02,294 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:28:02,294 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:28:02,294 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:28:02,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:28:02,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:28:02,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:28:02,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:28:02,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:28:02,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:28:02,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:28:02,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:28:02,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:28:02,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:28:02,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:28:02,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:28:02,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:28:02,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:28:02,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:28:02,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:28:02,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:28:02,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:28:02,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:28:02,300 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-22 21:28:02,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:28:02,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:28:02,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:28:02,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:28:02,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:28:02,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-22 21:28:03,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:28:03,987 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:28:03,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-22 21:28:03,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6241aa1/8be215d5abdb48d19c1b0a44aff5bfbd/FLAG12e2ff8c4 [2024-11-22 21:28:04,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6241aa1/8be215d5abdb48d19c1b0a44aff5bfbd [2024-11-22 21:28:04,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:28:04,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:28:04,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:28:04,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:28:04,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:28:04,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523d02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04, skipping insertion in model container [2024-11-22 21:28:04,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:28:04,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:28:04,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:28:04,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:28:04,469 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:28:04,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04 WrapperNode [2024-11-22 21:28:04,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:28:04,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:28:04,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:28:04,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:28:04,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,508 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2024-11-22 21:28:04,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:28:04,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:28:04,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:28:04,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:28:04,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,540 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-22 21:28:04,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:28:04,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:28:04,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:28:04,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:28:04,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (1/1) ... [2024-11-22 21:28:04,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:28:04,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:28:04,594 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-22 21:28:04,596 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-22 21:28:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:28:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:28:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:28:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:28:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:28:04,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:28:04,633 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:28:04,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:28:04,633 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:28:04,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:28:04,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:28:04,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:28:04,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:28:04,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:28:04,635 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:28:04,737 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:28:04,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:28:05,026 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:28:05,027 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:28:05,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:28:05,200 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:28:05,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:28:05 BoogieIcfgContainer [2024-11-22 21:28:05,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:28:05,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:28:05,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:28:05,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:28:05,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:28:04" (1/3) ... [2024-11-22 21:28:05,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cdb378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:28:05, skipping insertion in model container [2024-11-22 21:28:05,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:04" (2/3) ... [2024-11-22 21:28:05,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cdb378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:28:05, skipping insertion in model container [2024-11-22 21:28:05,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:28:05" (3/3) ... [2024-11-22 21:28:05,210 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-22 21:28:05,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:28:05,225 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:28:05,225 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:28:05,273 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:28:05,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-22 21:28:05,329 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-22 21:28:05,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:28:05,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-22 21:28:05,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-22 21:28:05,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-22 21:28:05,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:28:05,362 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;@1066742, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:28:05,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-22 21:28:05,368 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:28:05,369 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-22 21:28:05,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:28:05,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:05,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:28:05,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:05,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -589101247, now seen corresponding path program 1 times [2024-11-22 21:28:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631603118] [2024-11-22 21:28:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:05,798 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-22 21:28:05,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:05,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631603118] [2024-11-22 21:28:05,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631603118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:05,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:05,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:28:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845926947] [2024-11-22 21:28:05,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:05,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:28:05,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:05,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:28:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:28:05,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-22 21:28:05,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-22 21:28:05,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:05,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-22 21:28:05,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:06,524 INFO L124 PetriNetUnfolderBase]: 2754/4553 cut-off events. [2024-11-22 21:28:06,525 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-22 21:28:06,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8492 conditions, 4553 events. 2754/4553 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31890 event pairs, 492 based on Foata normal form. 216/4711 useless extension candidates. Maximal degree in co-relation 8480. Up to 3064 conditions per place. [2024-11-22 21:28:06,553 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 39 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2024-11-22 21:28:06,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 230 flow [2024-11-22 21:28:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:28:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:28:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-11-22 21:28:06,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2024-11-22 21:28:06,564 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 120 transitions. [2024-11-22 21:28:06,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 230 flow [2024-11-22 21:28:06,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:28:06,572 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-22 21:28:06,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-22 21:28:06,577 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-22 21:28:06,578 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-22 21:28:06,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-22 21:28:06,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:06,578 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:06,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:28:06,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:06,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1317713306, now seen corresponding path program 1 times [2024-11-22 21:28:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:06,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70627792] [2024-11-22 21:28:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:06,658 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-22 21:28:06,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70627792] [2024-11-22 21:28:06,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70627792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:06,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:06,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:28:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168476953] [2024-11-22 21:28:06,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:06,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:28:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:28:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:28:06,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-22 21:28:06,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-22 21:28:06,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:06,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-22 21:28:06,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:07,184 INFO L124 PetriNetUnfolderBase]: 2457/4061 cut-off events. [2024-11-22 21:28:07,184 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-11-22 21:28:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 4061 events. 2457/4061 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27530 event pairs, 2457 based on Foata normal form. 108/4000 useless extension candidates. Maximal degree in co-relation 7823. Up to 3424 conditions per place. [2024-11-22 21:28:07,203 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 22 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-22 21:28:07,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 146 flow [2024-11-22 21:28:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:28:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:28:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-22 21:28:07,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5911949685534591 [2024-11-22 21:28:07,206 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 94 transitions. [2024-11-22 21:28:07,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 146 flow [2024-11-22 21:28:07,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:28:07,209 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2024-11-22 21:28:07,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-22 21:28:07,210 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-22 21:28:07,210 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2024-11-22 21:28:07,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-22 21:28:07,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:07,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:07,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:28:07,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1317711957, now seen corresponding path program 1 times [2024-11-22 21:28:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:07,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379511823] [2024-11-22 21:28:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:07,708 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-22 21:28:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379511823] [2024-11-22 21:28:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379511823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:07,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:28:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814671348] [2024-11-22 21:28:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:07,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:28:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:28:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:28:07,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-22 21:28:07,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 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-22 21:28:07,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:07,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-22 21:28:07,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:08,588 INFO L124 PetriNetUnfolderBase]: 4352/6805 cut-off events. [2024-11-22 21:28:08,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:28:08,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12984 conditions, 6805 events. 4352/6805 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 48737 event pairs, 875 based on Foata normal form. 0/6646 useless extension candidates. Maximal degree in co-relation 12978. Up to 3913 conditions per place. [2024-11-22 21:28:08,619 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 36 selfloop transitions, 3 changer transitions 48/104 dead transitions. [2024-11-22 21:28:08,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 398 flow [2024-11-22 21:28:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:28:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:28:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2024-11-22 21:28:08,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-22 21:28:08,622 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 8 states and 265 transitions. [2024-11-22 21:28:08,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 398 flow [2024-11-22 21:28:08,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:28:08,624 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 126 flow [2024-11-22 21:28:08,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2024-11-22 21:28:08,625 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-22 21:28:08,625 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 126 flow [2024-11-22 21:28:08,625 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-22 21:28:08,625 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:08,625 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:08,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:28:08,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:08,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1260050401, now seen corresponding path program 1 times [2024-11-22 21:28:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:08,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697897526] [2024-11-22 21:28:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:08,806 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-22 21:28:08,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697897526] [2024-11-22 21:28:08,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697897526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:08,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:28:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247500087] [2024-11-22 21:28:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:08,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:28:08,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:08,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:28:08,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:28:08,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:08,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-22 21:28:08,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:08,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:08,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:10,109 INFO L124 PetriNetUnfolderBase]: 9378/13675 cut-off events. [2024-11-22 21:28:10,110 INFO L125 PetriNetUnfolderBase]: For 4215/4217 co-relation queries the response was YES. [2024-11-22 21:28:10,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30818 conditions, 13675 events. 9378/13675 cut-off events. For 4215/4217 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 88749 event pairs, 1001 based on Foata normal form. 384/13846 useless extension candidates. Maximal degree in co-relation 30806. Up to 8149 conditions per place. [2024-11-22 21:28:10,241 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 55 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2024-11-22 21:28:10,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 336 flow [2024-11-22 21:28:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:28:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:28:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-22 21:28:10,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2024-11-22 21:28:10,243 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 126 flow. Second operand 4 states and 136 transitions. [2024-11-22 21:28:10,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 336 flow [2024-11-22 21:28:10,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 327 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-22 21:28:10,253 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 165 flow [2024-11-22 21:28:10,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-11-22 21:28:10,254 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2024-11-22 21:28:10,254 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 165 flow [2024-11-22 21:28:10,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-22 21:28:10,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:10,255 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-22 21:28:10,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:28:10,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1376895166, now seen corresponding path program 1 times [2024-11-22 21:28:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954719694] [2024-11-22 21:28:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:10,855 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-22 21:28:10,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954719694] [2024-11-22 21:28:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954719694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600169003] [2024-11-22 21:28:10,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:10,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:28:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:28:10,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:28:10,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-22 21:28:10,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-22 21:28:10,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:10,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-22 21:28:10,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:12,104 INFO L124 PetriNetUnfolderBase]: 6436/10364 cut-off events. [2024-11-22 21:28:12,104 INFO L125 PetriNetUnfolderBase]: For 4682/4994 co-relation queries the response was YES. [2024-11-22 21:28:12,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24251 conditions, 10364 events. 6436/10364 cut-off events. For 4682/4994 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 78964 event pairs, 1405 based on Foata normal form. 205/9890 useless extension candidates. Maximal degree in co-relation 24238. Up to 6472 conditions per place. [2024-11-22 21:28:12,167 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 73 selfloop transitions, 15 changer transitions 0/110 dead transitions. [2024-11-22 21:28:12,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 110 transitions, 509 flow [2024-11-22 21:28:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:28:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:28:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2024-11-22 21:28:12,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-22 21:28:12,170 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 165 flow. Second operand 8 states and 265 transitions. [2024-11-22 21:28:12,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 110 transitions, 509 flow [2024-11-22 21:28:12,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 110 transitions, 499 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-22 21:28:12,175 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 260 flow [2024-11-22 21:28:12,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2024-11-22 21:28:12,176 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2024-11-22 21:28:12,176 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 260 flow [2024-11-22 21:28:12,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-22 21:28:12,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:12,177 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-22 21:28:12,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:28:12,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:12,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash 631646020, now seen corresponding path program 1 times [2024-11-22 21:28:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:12,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446970678] [2024-11-22 21:28:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:12,372 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-22 21:28:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446970678] [2024-11-22 21:28:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446970678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:28:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461691247] [2024-11-22 21:28:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:12,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:28:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:12,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:28:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:28:12,384 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:12,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-22 21:28:12,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:12,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:12,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:13,628 INFO L124 PetriNetUnfolderBase]: 8553/12617 cut-off events. [2024-11-22 21:28:13,629 INFO L125 PetriNetUnfolderBase]: For 9883/9993 co-relation queries the response was YES. [2024-11-22 21:28:13,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34974 conditions, 12617 events. 8553/12617 cut-off events. For 9883/9993 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 80372 event pairs, 544 based on Foata normal form. 472/12816 useless extension candidates. Maximal degree in co-relation 34957. Up to 5977 conditions per place. [2024-11-22 21:28:13,703 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 84 selfloop transitions, 10 changer transitions 6/114 dead transitions. [2024-11-22 21:28:13,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 114 transitions, 682 flow [2024-11-22 21:28:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:28:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:28:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-11-22 21:28:13,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6566037735849056 [2024-11-22 21:28:13,705 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 260 flow. Second operand 5 states and 174 transitions. [2024-11-22 21:28:13,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 114 transitions, 682 flow [2024-11-22 21:28:13,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 644 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-22 21:28:13,740 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 276 flow [2024-11-22 21:28:13,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-11-22 21:28:13,740 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2024-11-22 21:28:13,740 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 276 flow [2024-11-22 21:28:13,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-22 21:28:13,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:13,741 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-22 21:28:13,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:28:13,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash -355854259, now seen corresponding path program 1 times [2024-11-22 21:28:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:13,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631336814] [2024-11-22 21:28:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:14,014 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-22 21:28:14,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631336814] [2024-11-22 21:28:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631336814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:28:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295550214] [2024-11-22 21:28:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:14,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:14,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:14,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-22 21:28:14,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:14,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:14,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:15,017 INFO L124 PetriNetUnfolderBase]: 6017/8893 cut-off events. [2024-11-22 21:28:15,018 INFO L125 PetriNetUnfolderBase]: For 11079/11181 co-relation queries the response was YES. [2024-11-22 21:28:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27209 conditions, 8893 events. 6017/8893 cut-off events. For 11079/11181 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 53477 event pairs, 394 based on Foata normal form. 344/8965 useless extension candidates. Maximal degree in co-relation 27188. Up to 2656 conditions per place. [2024-11-22 21:28:15,071 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 93 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2024-11-22 21:28:15,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 728 flow [2024-11-22 21:28:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-11-22 21:28:15,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.660377358490566 [2024-11-22 21:28:15,073 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 276 flow. Second operand 6 states and 210 transitions. [2024-11-22 21:28:15,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 728 flow [2024-11-22 21:28:15,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 121 transitions, 706 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-22 21:28:15,082 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 335 flow [2024-11-22 21:28:15,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2024-11-22 21:28:15,083 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2024-11-22 21:28:15,084 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 335 flow [2024-11-22 21:28:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-22 21:28:15,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:15,084 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:28:15,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1305080659, now seen corresponding path program 1 times [2024-11-22 21:28:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738123458] [2024-11-22 21:28:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:15,348 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-22 21:28:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738123458] [2024-11-22 21:28:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738123458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:15,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:15,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882574682] [2024-11-22 21:28:15,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:15,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:28:15,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:15,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:28:15,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:28:15,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:15,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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-22 21:28:15,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:15,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:15,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:16,141 INFO L124 PetriNetUnfolderBase]: 5109/7481 cut-off events. [2024-11-22 21:28:16,141 INFO L125 PetriNetUnfolderBase]: For 15525/15627 co-relation queries the response was YES. [2024-11-22 21:28:16,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24861 conditions, 7481 events. 5109/7481 cut-off events. For 15525/15627 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 44349 event pairs, 394 based on Foata normal form. 196/7405 useless extension candidates. Maximal degree in co-relation 24840. Up to 2656 conditions per place. [2024-11-22 21:28:16,196 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 86 selfloop transitions, 18 changer transitions 0/118 dead transitions. [2024-11-22 21:28:16,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 118 transitions, 730 flow [2024-11-22 21:28:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:28:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:28:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-11-22 21:28:16,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091644204851752 [2024-11-22 21:28:16,198 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 335 flow. Second operand 7 states and 226 transitions. [2024-11-22 21:28:16,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 118 transitions, 730 flow [2024-11-22 21:28:16,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 673 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-11-22 21:28:16,256 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 349 flow [2024-11-22 21:28:16,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2024-11-22 21:28:16,257 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2024-11-22 21:28:16,257 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 349 flow [2024-11-22 21:28:16,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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-22 21:28:16,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:16,258 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:16,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:28:16,258 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:16,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1215573617, now seen corresponding path program 1 times [2024-11-22 21:28:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:16,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781958423] [2024-11-22 21:28:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:16,563 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-22 21:28:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781958423] [2024-11-22 21:28:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781958423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:16,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:16,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102902690] [2024-11-22 21:28:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:16,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:16,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:16,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-22 21:28:16,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-22 21:28:16,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:16,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-22 21:28:16,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:17,447 INFO L124 PetriNetUnfolderBase]: 5267/9065 cut-off events. [2024-11-22 21:28:17,447 INFO L125 PetriNetUnfolderBase]: For 17735/21445 co-relation queries the response was YES. [2024-11-22 21:28:17,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26193 conditions, 9065 events. 5267/9065 cut-off events. For 17735/21445 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 69921 event pairs, 1403 based on Foata normal form. 193/8368 useless extension candidates. Maximal degree in co-relation 26173. Up to 3527 conditions per place. [2024-11-22 21:28:17,492 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 43 selfloop transitions, 1 changer transitions 28/105 dead transitions. [2024-11-22 21:28:17,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 629 flow [2024-11-22 21:28:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-22 21:28:17,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5943396226415094 [2024-11-22 21:28:17,495 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 349 flow. Second operand 6 states and 189 transitions. [2024-11-22 21:28:17,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 629 flow [2024-11-22 21:28:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 582 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-22 21:28:17,619 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 313 flow [2024-11-22 21:28:17,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2024-11-22 21:28:17,621 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 21 predicate places. [2024-11-22 21:28:17,621 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 313 flow [2024-11-22 21:28:17,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-22 21:28:17,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:17,622 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:17,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:28:17,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:17,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1487766087, now seen corresponding path program 2 times [2024-11-22 21:28:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333282848] [2024-11-22 21:28:17,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:28:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:17,647 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:28:17,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:28:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:28:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:17,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333282848] [2024-11-22 21:28:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333282848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:17,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:17,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653286928] [2024-11-22 21:28:17,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:17,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:17,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:17,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-22 21:28:17,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-22 21:28:17,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:17,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-22 21:28:17,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:18,650 INFO L124 PetriNetUnfolderBase]: 5986/10239 cut-off events. [2024-11-22 21:28:18,651 INFO L125 PetriNetUnfolderBase]: For 13892/16057 co-relation queries the response was YES. [2024-11-22 21:28:18,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27539 conditions, 10239 events. 5986/10239 cut-off events. For 13892/16057 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 80695 event pairs, 1644 based on Foata normal form. 241/9321 useless extension candidates. Maximal degree in co-relation 27516. Up to 3669 conditions per place. [2024-11-22 21:28:18,714 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 35 selfloop transitions, 1 changer transitions 34/103 dead transitions. [2024-11-22 21:28:18,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 594 flow [2024-11-22 21:28:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-11-22 21:28:18,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5754716981132075 [2024-11-22 21:28:18,716 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 313 flow. Second operand 6 states and 183 transitions. [2024-11-22 21:28:18,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 594 flow [2024-11-22 21:28:18,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 103 transitions, 583 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:28:18,863 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 317 flow [2024-11-22 21:28:18,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-22 21:28:18,864 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2024-11-22 21:28:18,865 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 317 flow [2024-11-22 21:28:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-22 21:28:18,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:18,865 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:28:18,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1379918383, now seen corresponding path program 3 times [2024-11-22 21:28:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857050001] [2024-11-22 21:28:18,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:28:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:18,896 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:28:18,896 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:28:19,084 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-22 21:28:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857050001] [2024-11-22 21:28:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857050001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:19,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378902179] [2024-11-22 21:28:19,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:19,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:19,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-22 21:28:19,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-22 21:28:19,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:19,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-22 21:28:19,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:19,888 INFO L124 PetriNetUnfolderBase]: 5979/10616 cut-off events. [2024-11-22 21:28:19,888 INFO L125 PetriNetUnfolderBase]: For 13374/15041 co-relation queries the response was YES. [2024-11-22 21:28:19,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28653 conditions, 10616 events. 5979/10616 cut-off events. For 13374/15041 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 86112 event pairs, 1660 based on Foata normal form. 171/9681 useless extension candidates. Maximal degree in co-relation 28629. Up to 4076 conditions per place. [2024-11-22 21:28:19,943 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 1 changer transitions 39/101 dead transitions. [2024-11-22 21:28:19,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 101 transitions, 577 flow [2024-11-22 21:28:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-11-22 21:28:19,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-11-22 21:28:19,944 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 317 flow. Second operand 6 states and 186 transitions. [2024-11-22 21:28:19,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 101 transitions, 577 flow [2024-11-22 21:28:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 566 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:28:20,121 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 290 flow [2024-11-22 21:28:20,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2024-11-22 21:28:20,121 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 25 predicate places. [2024-11-22 21:28:20,122 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 290 flow [2024-11-22 21:28:20,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-22 21:28:20,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:20,122 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:20,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:28:20,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:20,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1732254501, now seen corresponding path program 4 times [2024-11-22 21:28:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930143607] [2024-11-22 21:28:20,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:28:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:20,204 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:28:20,204 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:28:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:28:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:28:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930143607] [2024-11-22 21:28:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930143607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:22,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:22,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 21:28:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720686620] [2024-11-22 21:28:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:28:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:28:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:28:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:28:22,384 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-22 21:28:22,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 57 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 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-22 21:28:22,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:22,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-22 21:28:22,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:23,322 INFO L124 PetriNetUnfolderBase]: 5635/9712 cut-off events. [2024-11-22 21:28:23,322 INFO L125 PetriNetUnfolderBase]: For 12051/13454 co-relation queries the response was YES. [2024-11-22 21:28:23,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26544 conditions, 9712 events. 5635/9712 cut-off events. For 12051/13454 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 77262 event pairs, 1738 based on Foata normal form. 111/8489 useless extension candidates. Maximal degree in co-relation 26519. Up to 2368 conditions per place. [2024-11-22 21:28:23,370 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 60 selfloop transitions, 5 changer transitions 20/118 dead transitions. [2024-11-22 21:28:23,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 118 transitions, 662 flow [2024-11-22 21:28:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:28:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:28:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2024-11-22 21:28:23,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6367924528301887 [2024-11-22 21:28:23,371 INFO L175 Difference]: Start difference. First operand has 85 places, 57 transitions, 290 flow. Second operand 8 states and 270 transitions. [2024-11-22 21:28:23,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 118 transitions, 662 flow [2024-11-22 21:28:23,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 118 transitions, 641 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-22 21:28:23,506 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 317 flow [2024-11-22 21:28:23,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2024-11-22 21:28:23,507 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 27 predicate places. [2024-11-22 21:28:23,507 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 317 flow [2024-11-22 21:28:23,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 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-22 21:28:23,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:23,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:23,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:28:23,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:23,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2120596073, now seen corresponding path program 5 times [2024-11-22 21:28:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:28:23,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234129866] [2024-11-22 21:28:23,509 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:28:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:28:23,570 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:28:23,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:28:23,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:28:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:28:23,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:28:23,664 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:28:23,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-22 21:28:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-22 21:28:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-22 21:28:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-22 21:28:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-22 21:28:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-22 21:28:23,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-22 21:28:23,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-22 21:28:23,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:28:23,670 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:23,761 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:28:23,762 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:28:23,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:28:23 BasicIcfg [2024-11-22 21:28:23,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:28:23,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:28:23,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:28:23,767 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:28:23,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:28:05" (3/4) ... [2024-11-22 21:28:23,768 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:28:23,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:28:23,769 INFO L158 Benchmark]: Toolchain (without parser) took 19755.40ms. Allocated memory was 121.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 66.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 635.3MB. Max. memory is 16.1GB. [2024-11-22 21:28:23,770 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:28:23,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.26ms. Allocated memory was 121.6MB in the beginning and 163.6MB in the end (delta: 41.9MB). Free memory was 66.4MB in the beginning and 123.6MB in the end (delta: -57.3MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-22 21:28:23,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.70ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 120.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:28:23,770 INFO L158 Benchmark]: Boogie Preprocessor took 47.94ms. Allocated memory is still 163.6MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:28:23,770 INFO L158 Benchmark]: RCFGBuilder took 642.22ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 120.8MB in the end (delta: -3.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-11-22 21:28:23,771 INFO L158 Benchmark]: TraceAbstraction took 18562.05ms. Allocated memory was 163.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 119.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 643.6MB. Max. memory is 16.1GB. [2024-11-22 21:28:23,771 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 2.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:28:23,772 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.13ms. Allocated memory is still 121.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.26ms. Allocated memory was 121.6MB in the beginning and 163.6MB in the end (delta: 41.9MB). Free memory was 66.4MB in the beginning and 123.6MB in the end (delta: -57.3MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.70ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 120.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.94ms. Allocated memory is still 163.6MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 642.22ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 120.8MB in the end (delta: -3.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18562.05ms. Allocated memory was 163.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 119.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 643.6MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 2.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-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=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-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=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=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=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=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=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, z=1] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, z=1] [L826] 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) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, z=1] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 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) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 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 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 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}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=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=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=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 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 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=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=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=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 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) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, 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=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1] [L17] 0 __assert_fail ("0", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 849]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 746 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1813 IncrementalHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 12 mSDtfsCounter, 1813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 1931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-22 21:28:23,787 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:28:25,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:28:25,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:28:25,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:28:25,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:28:25,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:28:25,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:28:25,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:28:25,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:28:25,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:28:25,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:28:25,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:28:25,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:28:25,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:28:25,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:28:25,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:28:25,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:28:25,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:28:25,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:28:25,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:28:25,958 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:28:25,961 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:28:25,961 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:28:25,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:28:25,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:28:25,962 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:28:25,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:28:25,962 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:28:25,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:28:25,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:28:25,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:28:25,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:28:25,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:28:25,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:28:25,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:28:25,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:28:25,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:28:25,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:28:25,963 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:28:25,964 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:28:25,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:28:25,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:28:25,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:28:25,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:28:25,966 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-22 21:28:26,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:28:26,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:28:26,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:28:26,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:28:26,262 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:28:26,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-22 21:28:27,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:28:27,806 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:28:27,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-22 21:28:27,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126a71264/05f92c0cce1c45f2810c432acc93cda6/FLAG846e7b300 [2024-11-22 21:28:28,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126a71264/05f92c0cce1c45f2810c432acc93cda6 [2024-11-22 21:28:28,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:28:28,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:28:28,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:28:28,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:28:28,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:28:28,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3202d359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28, skipping insertion in model container [2024-11-22 21:28:28,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:28:28,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:28:28,559 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:28:28,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:28:28,651 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:28:28,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28 WrapperNode [2024-11-22 21:28:28,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:28:28,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:28:28,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:28:28,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:28:28,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,706 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-11-22 21:28:28,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:28:28,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:28:28,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:28:28,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:28:28,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,744 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-22 21:28:28,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:28:28,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:28:28,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:28:28,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:28:28,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (1/1) ... [2024-11-22 21:28:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:28:28,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:28:28,805 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-22 21:28:28,807 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-22 21:28:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:28:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:28:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:28:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:28:28,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:28:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:28:28,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:28:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:28:28,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:28:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:28:28,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:28:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:28:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:28:28,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:28:28,850 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:28:28,988 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:28:28,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:28:29,257 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:28:29,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:28:29,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:28:29,467 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:28:29,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:28:29 BoogieIcfgContainer [2024-11-22 21:28:29,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:28:29,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:28:29,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:28:29,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:28:29,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:28:28" (1/3) ... [2024-11-22 21:28:29,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e34e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:28:29, skipping insertion in model container [2024-11-22 21:28:29,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:28:28" (2/3) ... [2024-11-22 21:28:29,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e34e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:28:29, skipping insertion in model container [2024-11-22 21:28:29,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:28:29" (3/3) ... [2024-11-22 21:28:29,473 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-22 21:28:29,487 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:28:29,487 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:28:29,487 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:28:29,552 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:28:29,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-22 21:28:29,611 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-22 21:28:29,612 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:28:29,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-22 21:28:29,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-22 21:28:29,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-22 21:28:29,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:28:29,635 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;@3f423ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:28:29,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-22 21:28:29,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:28:29,640 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-22 21:28:29,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:28:29,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:29,641 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:28:29,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:29,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash -529934335, now seen corresponding path program 1 times [2024-11-22 21:28:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524391928] [2024-11-22 21:28:29,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:29,655 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-22 21:28:29,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:29,657 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-22 21:28:29,658 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-22 21:28:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:29,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:28:29,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:29,782 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-22 21:28:29,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:29,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524391928] [2024-11-22 21:28:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524391928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:28:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113113379] [2024-11-22 21:28:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:28:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:28:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:28:29,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-22 21:28:29,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-22 21:28:29,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:29,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-22 21:28:29,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:30,535 INFO L124 PetriNetUnfolderBase]: 2754/4553 cut-off events. [2024-11-22 21:28:30,535 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-22 21:28:30,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8492 conditions, 4553 events. 2754/4553 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31890 event pairs, 492 based on Foata normal form. 216/4711 useless extension candidates. Maximal degree in co-relation 8480. Up to 3064 conditions per place. [2024-11-22 21:28:30,566 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 39 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2024-11-22 21:28:30,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 230 flow [2024-11-22 21:28:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:28:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:28:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-11-22 21:28:30,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2024-11-22 21:28:30,580 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 120 transitions. [2024-11-22 21:28:30,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 230 flow [2024-11-22 21:28:30,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:28:30,587 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-22 21:28:30,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-22 21:28:30,593 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-22 21:28:30,594 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-22 21:28:30,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-22 21:28:30,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:30,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:30,600 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-22 21:28:30,796 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-22 21:28:30,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:30,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -238860184, now seen corresponding path program 1 times [2024-11-22 21:28:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12630303] [2024-11-22 21:28:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:30,802 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-22 21:28:30,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:30,805 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-22 21:28:30,809 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-22 21:28:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:30,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:28:30,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:30,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-22 21:28:30,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:30,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12630303] [2024-11-22 21:28:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12630303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:30,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:28:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735834298] [2024-11-22 21:28:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:30,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:28:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:28:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:28:30,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:30,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 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-22 21:28:30,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:30,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:32,183 INFO L124 PetriNetUnfolderBase]: 8909/13395 cut-off events. [2024-11-22 21:28:32,183 INFO L125 PetriNetUnfolderBase]: For 624/624 co-relation queries the response was YES. [2024-11-22 21:28:32,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26383 conditions, 13395 events. 8909/13395 cut-off events. For 624/624 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 91357 event pairs, 869 based on Foata normal form. 320/13542 useless extension candidates. Maximal degree in co-relation 26373. Up to 8233 conditions per place. [2024-11-22 21:28:32,262 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-22 21:28:32,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 288 flow [2024-11-22 21:28:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:28:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:28:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-11-22 21:28:32,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6462264150943396 [2024-11-22 21:28:32,265 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 4 states and 137 transitions. [2024-11-22 21:28:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 288 flow [2024-11-22 21:28:32,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:28:32,268 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 138 flow [2024-11-22 21:28:32,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-11-22 21:28:32,269 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2024-11-22 21:28:32,269 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 138 flow [2024-11-22 21:28:32,269 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-22 21:28:32,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:32,269 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-22 21:28:32,274 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 (3)] Forceful destruction successful, exit code 0 [2024-11-22 21:28:32,470 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-22 21:28:32,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:32,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash 137743549, now seen corresponding path program 1 times [2024-11-22 21:28:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915693422] [2024-11-22 21:28:32,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:32,473 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-22 21:28:32,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:32,474 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-22 21:28:32,476 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-22 21:28:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:32,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:28:32,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:32,592 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-22 21:28:32,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:32,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915693422] [2024-11-22 21:28:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915693422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:32,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:28:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381605599] [2024-11-22 21:28:32,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:32,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:28:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:32,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:28:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:28:32,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:32,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-22 21:28:32,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:32,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:33,684 INFO L124 PetriNetUnfolderBase]: 6745/10239 cut-off events. [2024-11-22 21:28:33,684 INFO L125 PetriNetUnfolderBase]: For 2356/2356 co-relation queries the response was YES. [2024-11-22 21:28:33,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22921 conditions, 10239 events. 6745/10239 cut-off events. For 2356/2356 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 67122 event pairs, 369 based on Foata normal form. 296/10386 useless extension candidates. Maximal degree in co-relation 22909. Up to 5461 conditions per place. [2024-11-22 21:28:33,727 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 66 selfloop transitions, 10 changer transitions 1/92 dead transitions. [2024-11-22 21:28:33,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 409 flow [2024-11-22 21:28:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:28:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:28:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-11-22 21:28:33,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6566037735849056 [2024-11-22 21:28:33,729 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 138 flow. Second operand 5 states and 174 transitions. [2024-11-22 21:28:33,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 409 flow [2024-11-22 21:28:33,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 398 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:28:33,782 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 190 flow [2024-11-22 21:28:33,783 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-11-22 21:28:33,783 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-11-22 21:28:33,784 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 190 flow [2024-11-22 21:28:33,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-22 21:28:33,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:33,784 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-22 21:28:33,795 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-22 21:28:33,985 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-22 21:28:33,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1345148874, now seen corresponding path program 1 times [2024-11-22 21:28:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479428337] [2024-11-22 21:28:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:33,987 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-22 21:28:33,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:33,989 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-22 21:28:33,990 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-22 21:28:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:34,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:28:34,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:34,133 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-22 21:28:34,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:34,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479428337] [2024-11-22 21:28:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479428337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:28:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826400460] [2024-11-22 21:28:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:34,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:34,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-22 21:28:34,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:34,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:34,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:34,725 INFO L124 PetriNetUnfolderBase]: 4037/6123 cut-off events. [2024-11-22 21:28:34,725 INFO L125 PetriNetUnfolderBase]: For 4217/4217 co-relation queries the response was YES. [2024-11-22 21:28:34,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15375 conditions, 6123 events. 4037/6123 cut-off events. For 4217/4217 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 35613 event pairs, 221 based on Foata normal form. 208/6199 useless extension candidates. Maximal degree in co-relation 15361. Up to 2101 conditions per place. [2024-11-22 21:28:34,747 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 78 selfloop transitions, 14 changer transitions 1/108 dead transitions. [2024-11-22 21:28:34,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 108 transitions, 536 flow [2024-11-22 21:28:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-11-22 21:28:34,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6572327044025157 [2024-11-22 21:28:34,753 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 190 flow. Second operand 6 states and 209 transitions. [2024-11-22 21:28:34,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 108 transitions, 536 flow [2024-11-22 21:28:34,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 506 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:28:34,767 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 240 flow [2024-11-22 21:28:34,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-11-22 21:28:34,767 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2024-11-22 21:28:34,768 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 240 flow [2024-11-22 21:28:34,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-22 21:28:34,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:34,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:34,772 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-22 21:28:34,968 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-22 21:28:34,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:34,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2023322776, now seen corresponding path program 1 times [2024-11-22 21:28:34,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:34,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533205716] [2024-11-22 21:28:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:34,970 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-22 21:28:34,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:34,971 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-22 21:28:34,972 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-22 21:28:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:35,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:28:35,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:35,131 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-22 21:28:35,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:35,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533205716] [2024-11-22 21:28:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533205716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662151668] [2024-11-22 21:28:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:35,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:28:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:28:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:28:35,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-22 21:28:35,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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-22 21:28:35,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:35,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-22 21:28:35,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:35,576 INFO L124 PetriNetUnfolderBase]: 2489/3663 cut-off events. [2024-11-22 21:28:35,576 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2024-11-22 21:28:35,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10216 conditions, 3663 events. 2489/3663 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18680 event pairs, 173 based on Foata normal form. 88/3619 useless extension candidates. Maximal degree in co-relation 10201. Up to 1088 conditions per place. [2024-11-22 21:28:35,593 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 70 selfloop transitions, 18 changer transitions 1/104 dead transitions. [2024-11-22 21:28:35,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 530 flow [2024-11-22 21:28:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:28:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:28:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-11-22 21:28:35,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-11-22 21:28:35,595 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 240 flow. Second operand 7 states and 224 transitions. [2024-11-22 21:28:35,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 530 flow [2024-11-22 21:28:35,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 484 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-22 21:28:35,613 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 250 flow [2024-11-22 21:28:35,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-11-22 21:28:35,614 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-11-22 21:28:35,614 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 250 flow [2024-11-22 21:28:35,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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-22 21:28:35,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:35,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:35,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 21:28:35,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:28:35,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:35,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash -534059060, now seen corresponding path program 1 times [2024-11-22 21:28:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:35,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260348291] [2024-11-22 21:28:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:35,817 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-22 21:28:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:35,818 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:28:35,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 (7)] Waiting until timeout for monitored process [2024-11-22 21:28:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:35,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:28:35,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:35,958 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-22 21:28:35,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:35,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260348291] [2024-11-22 21:28:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260348291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:35,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:35,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:28:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106993778] [2024-11-22 21:28:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:35,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:28:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:28:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:28:35,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-22 21:28:35,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-22 21:28:35,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:35,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-22 21:28:35,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:36,117 INFO L124 PetriNetUnfolderBase]: 1181/2101 cut-off events. [2024-11-22 21:28:36,118 INFO L125 PetriNetUnfolderBase]: For 688/738 co-relation queries the response was YES. [2024-11-22 21:28:36,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 2101 events. 1181/2101 cut-off events. For 688/738 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12785 event pairs, 1115 based on Foata normal form. 16/1868 useless extension candidates. Maximal degree in co-relation 4566. Up to 1680 conditions per place. [2024-11-22 21:28:36,131 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 22 selfloop transitions, 1 changer transitions 1/55 dead transitions. [2024-11-22 21:28:36,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 296 flow [2024-11-22 21:28:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:28:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:28:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-22 21:28:36,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5911949685534591 [2024-11-22 21:28:36,132 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 250 flow. Second operand 3 states and 94 transitions. [2024-11-22 21:28:36,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 296 flow [2024-11-22 21:28:36,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 200 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-22 21:28:36,136 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 152 flow [2024-11-22 21:28:36,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-22 21:28:36,137 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-11-22 21:28:36,137 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 152 flow [2024-11-22 21:28:36,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-22 21:28:36,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:36,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:36,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 21:28:36,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:28:36,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:36,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1758050391, now seen corresponding path program 1 times [2024-11-22 21:28:36,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:36,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10140283] [2024-11-22 21:28:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:28:36,340 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-22 21:28:36,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:36,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:28:36,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:28:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:28:36,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:28:36,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:36,562 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-22 21:28:36,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:36,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10140283] [2024-11-22 21:28:36,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10140283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:36,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450410334] [2024-11-22 21:28:36,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:36,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:36,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-22 21:28:36,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-22 21:28:36,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:36,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-22 21:28:36,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:37,114 INFO L124 PetriNetUnfolderBase]: 2915/4767 cut-off events. [2024-11-22 21:28:37,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:28:37,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9432 conditions, 4767 events. 2915/4767 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30533 event pairs, 554 based on Foata normal form. 16/4506 useless extension candidates. Maximal degree in co-relation 9425. Up to 2088 conditions per place. [2024-11-22 21:28:37,141 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 48 selfloop transitions, 2 changer transitions 12/91 dead transitions. [2024-11-22 21:28:37,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 356 flow [2024-11-22 21:28:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-11-22 21:28:37,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2024-11-22 21:28:37,143 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 152 flow. Second operand 6 states and 195 transitions. [2024-11-22 21:28:37,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 356 flow [2024-11-22 21:28:37,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:28:37,145 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 168 flow [2024-11-22 21:28:37,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-22 21:28:37,146 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2024-11-22 21:28:37,146 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 168 flow [2024-11-22 21:28:37,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-22 21:28:37,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:37,146 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:37,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 21:28:37,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:28:37,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:37,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2013505003, now seen corresponding path program 2 times [2024-11-22 21:28:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99582965] [2024-11-22 21:28:37,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:28:37,349 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-22 21:28:37,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:37,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:28:37,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:28:37,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:28:37,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:28:37,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 21:28:37,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:38,248 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-22 21:28:38,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:38,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99582965] [2024-11-22 21:28:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99582965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 21:28:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457269574] [2024-11-22 21:28:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:38,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:28:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:28:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:28:38,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-22 21:28:38,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 168 flow. Second operand has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 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-22 21:28:38,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:38,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-22 21:28:38,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:39,185 INFO L124 PetriNetUnfolderBase]: 4098/6567 cut-off events. [2024-11-22 21:28:39,185 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-22 21:28:39,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13189 conditions, 6567 events. 4098/6567 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 44493 event pairs, 784 based on Foata normal form. 16/6071 useless extension candidates. Maximal degree in co-relation 13178. Up to 2143 conditions per place. [2024-11-22 21:28:39,215 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 64 selfloop transitions, 8 changer transitions 22/125 dead transitions. [2024-11-22 21:28:39,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 522 flow [2024-11-22 21:28:39,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:28:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:28:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 325 transitions. [2024-11-22 21:28:39,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2024-11-22 21:28:39,217 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 168 flow. Second operand 10 states and 325 transitions. [2024-11-22 21:28:39,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 522 flow [2024-11-22 21:28:39,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 515 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 21:28:39,220 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 194 flow [2024-11-22 21:28:39,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-11-22 21:28:39,220 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2024-11-22 21:28:39,220 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 194 flow [2024-11-22 21:28:39,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 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-22 21:28:39,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:39,221 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:39,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 21:28:39,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:28:39,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:39,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1288887807, now seen corresponding path program 3 times [2024-11-22 21:28:39,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:39,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185868335] [2024-11-22 21:28:39,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:28:39,427 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-22 21:28:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:39,429 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:28:39,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 21:28:39,514 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:28:39,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:28:39,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:28:39,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:28:39,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:39,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185868335] [2024-11-22 21:28:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185868335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:39,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931600454] [2024-11-22 21:28:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:39,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:39,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:39,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:39,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-22 21:28:39,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-22 21:28:39,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:39,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-22 21:28:39,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:40,672 INFO L124 PetriNetUnfolderBase]: 7833/12836 cut-off events. [2024-11-22 21:28:40,672 INFO L125 PetriNetUnfolderBase]: For 612/614 co-relation queries the response was YES. [2024-11-22 21:28:40,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26405 conditions, 12836 events. 7833/12836 cut-off events. For 612/614 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 98359 event pairs, 1382 based on Foata normal form. 16/11874 useless extension candidates. Maximal degree in co-relation 26392. Up to 4974 conditions per place. [2024-11-22 21:28:40,715 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 49 selfloop transitions, 2 changer transitions 13/96 dead transitions. [2024-11-22 21:28:40,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 418 flow [2024-11-22 21:28:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-11-22 21:28:40,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-11-22 21:28:40,716 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 194 flow. Second operand 6 states and 192 transitions. [2024-11-22 21:28:40,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 418 flow [2024-11-22 21:28:40,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 411 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 21:28:40,719 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 206 flow [2024-11-22 21:28:40,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-11-22 21:28:40,720 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2024-11-22 21:28:40,720 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 206 flow [2024-11-22 21:28:40,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-22 21:28:40,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:40,720 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:40,724 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 (10)] Forceful destruction successful, exit code 0 [2024-11-22 21:28:40,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:28:40,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 930791067, now seen corresponding path program 4 times [2024-11-22 21:28:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:40,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066597530] [2024-11-22 21:28:40,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:28:40,922 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-22 21:28:40,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:40,923 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:28:40,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 21:28:40,999 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:28:40,999 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:28:41,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:28:41,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:28:41,128 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-22 21:28:41,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:28:41,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:28:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066597530] [2024-11-22 21:28:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066597530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:28:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:28:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:28:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197739952] [2024-11-22 21:28:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:28:41,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:28:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:28:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:28:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:28:41,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-22 21:28:41,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-22 21:28:41,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:28:41,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-22 21:28:41,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:28:42,577 INFO L124 PetriNetUnfolderBase]: 13945/22962 cut-off events. [2024-11-22 21:28:42,577 INFO L125 PetriNetUnfolderBase]: For 1935/1937 co-relation queries the response was YES. [2024-11-22 21:28:42,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47999 conditions, 22962 events. 13945/22962 cut-off events. For 1935/1937 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 191352 event pairs, 3100 based on Foata normal form. 16/21350 useless extension candidates. Maximal degree in co-relation 47984. Up to 8629 conditions per place. [2024-11-22 21:28:42,652 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 28 selfloop transitions, 1 changer transitions 36/95 dead transitions. [2024-11-22 21:28:42,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 424 flow [2024-11-22 21:28:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:28:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:28:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-22 21:28:42,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5943396226415094 [2024-11-22 21:28:42,653 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 206 flow. Second operand 6 states and 189 transitions. [2024-11-22 21:28:42,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 424 flow [2024-11-22 21:28:42,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 417 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 21:28:42,678 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 193 flow [2024-11-22 21:28:42,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2024-11-22 21:28:42,679 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 21 predicate places. [2024-11-22 21:28:42,679 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 193 flow [2024-11-22 21:28:42,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-22 21:28:42,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:28:42,680 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:42,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 21:28:42,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:28:42,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:28:42,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:28:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1715950473, now seen corresponding path program 5 times [2024-11-22 21:28:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:28:42,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164073328] [2024-11-22 21:28:42,881 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:28:42,881 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-22 21:28:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:28:42,884 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:28:42,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 21:28:42,984 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:28:42,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:28:42,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:28:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:28:43,099 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:28:43,099 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:28:43,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-22 21:28:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-22 21:28:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-22 21:28:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-22 21:28:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-22 21:28:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-22 21:28:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-22 21:28:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-22 21:28:43,111 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 (12)] Forceful destruction successful, exit code 0 [2024-11-22 21:28:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:28:43,303 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-22 21:28:43,387 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:28:43,387 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:28:43,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:28:43 BasicIcfg [2024-11-22 21:28:43,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:28:43,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:28:43,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:28:43,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:28:43,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:28:29" (3/4) ... [2024-11-22 21:28:43,396 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:28:43,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:28:43,397 INFO L158 Benchmark]: Toolchain (without parser) took 15259.45ms. Allocated memory was 58.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 31.8MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 410.1MB. Max. memory is 16.1GB. [2024-11-22 21:28:43,397 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:28:43,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.94ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 40.9MB in the end (delta: -9.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-22 21:28:43,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.33ms. Allocated memory is still 79.7MB. Free memory was 40.9MB in the beginning and 37.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:28:43,398 INFO L158 Benchmark]: Boogie Preprocessor took 64.88ms. Allocated memory is still 79.7MB. Free memory was 37.9MB in the beginning and 57.5MB in the end (delta: -19.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 21:28:43,398 INFO L158 Benchmark]: RCFGBuilder took 694.89ms. Allocated memory is still 79.7MB. Free memory was 57.0MB in the beginning and 32.9MB in the end (delta: 24.1MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-11-22 21:28:43,398 INFO L158 Benchmark]: TraceAbstraction took 13921.79ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 32.2MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 389.2MB. Max. memory is 16.1GB. [2024-11-22 21:28:43,398 INFO L158 Benchmark]: Witness Printer took 6.00ms. Allocated memory is still 2.5GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:28:43,399 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.12ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.94ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 40.9MB in the end (delta: -9.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.33ms. Allocated memory is still 79.7MB. Free memory was 40.9MB in the beginning and 37.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.88ms. Allocated memory is still 79.7MB. Free memory was 37.9MB in the beginning and 57.5MB in the end (delta: -19.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 694.89ms. Allocated memory is still 79.7MB. Free memory was 57.0MB in the beginning and 32.9MB in the end (delta: 24.1MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13921.79ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 32.2MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 389.2MB. Max. memory is 16.1GB. * Witness Printer took 6.00ms. Allocated memory is still 2.5GB. Free memory is still 2.0GB. 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=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=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=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=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=1, t1379=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=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=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, 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=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=0, y=1, z=0] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, z=1] [L756] 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) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 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 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, z=1] [L826] 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) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, z=1] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, 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=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=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 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 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, 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=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=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 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) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, weak$$choice0=0, 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=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1] [L17] 0 __assert_fail ("0", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 849]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 13 mSDtfsCounter, 1809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 326 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1303 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:28:43,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample