./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.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 bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:32:19,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:32:19,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:32:19,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:32:19,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:32:19,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:32:19,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:32:19,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:32:19,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:32:19,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:32:19,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:32:19,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:32:19,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:32:19,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:32:19,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:32:19,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:32:19,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:32:19,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:32:19,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:32:19,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:32:19,767 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:32:19,768 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:32:19,768 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:32:19,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:32:19,768 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:32:19,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:32:19,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:32:19,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:32:19,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:32:19,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:32:19,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:32:19,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:32:19,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:32:19,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:32:19,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:32:19,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:32:19,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:32:19,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:32:19,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:32:19,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:32:19,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:32:19,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:32:19,774 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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2024-11-19 09:32:19,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:32:19,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:32:19,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:32:19,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:32:19,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:32:19,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-19 09:32:21,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:32:21,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:32:21,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-19 09:32:21,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab5defb7/d4df5ceae1494f8c868e1442d93ddb6a/FLAG2f662a425 [2024-11-19 09:32:21,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab5defb7/d4df5ceae1494f8c868e1442d93ddb6a [2024-11-19 09:32:21,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:32:21,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:32:21,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:32:21,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:32:21,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:32:21,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:32:21" (1/1) ... [2024-11-19 09:32:21,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0d9eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:21, skipping insertion in model container [2024-11-19 09:32:21,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:32:21" (1/1) ... [2024-11-19 09:32:21,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:32:22,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:32:22,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:32:22,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:32:22,295 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:32:22,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22 WrapperNode [2024-11-19 09:32:22,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:32:22,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:32:22,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:32:22,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:32:22,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,346 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-19 09:32:22,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:32:22,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:32:22,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:32:22,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:32:22,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,390 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-19 09:32:22,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:32:22,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:32:22,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:32:22,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:32:22,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (1/1) ... [2024-11-19 09:32:22,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:32:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:32:22,445 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-19 09:32:22,453 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-19 09:32:22,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:32:22,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:32:22,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:32:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:32:22,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:32:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:32:22,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:32:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:32:22,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:32:22,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:32:22,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:32:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:32:22,502 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:32:22,606 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:32:22,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:32:22,843 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:32:22,843 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:32:23,070 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:32:23,071 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:32:23,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:23 BoogieIcfgContainer [2024-11-19 09:32:23,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:32:23,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:32:23,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:32:23,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:32:23,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:32:21" (1/3) ... [2024-11-19 09:32:23,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1914cea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:32:23, skipping insertion in model container [2024-11-19 09:32:23,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:22" (2/3) ... [2024-11-19 09:32:23,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1914cea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:32:23, skipping insertion in model container [2024-11-19 09:32:23,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:23" (3/3) ... [2024-11-19 09:32:23,080 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2024-11-19 09:32:23,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:32:23,093 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:32:23,094 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:32:23,140 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:32:23,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-19 09:32:23,197 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-19 09:32:23,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:32:23,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-19 09:32:23,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-19 09:32:23,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-19 09:32:23,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:32:23,223 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;@387e1b6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:32:23,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:32:23,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:32:23,228 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-19 09:32:23,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:32:23,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:23,229 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:32:23,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:23,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1414063623, now seen corresponding path program 1 times [2024-11-19 09:32:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728825544] [2024-11-19 09:32:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:23,571 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-19 09:32:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:23,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728825544] [2024-11-19 09:32:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728825544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:32:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711347254] [2024-11-19 09:32:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:23,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:32:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:23,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:32:23,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:32:23,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-19 09:32:23,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:32:23,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:23,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-19 09:32:23,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:23,955 INFO L124 PetriNetUnfolderBase]: 678/1271 cut-off events. [2024-11-19 09:32:23,955 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 09:32:23,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 1271 events. 678/1271 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8174 event pairs, 108 based on Foata normal form. 72/1330 useless extension candidates. Maximal degree in co-relation 2330. Up to 832 conditions per place. [2024-11-19 09:32:23,967 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-19 09:32:23,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 184 flow [2024-11-19 09:32:23,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:32:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:32:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-19 09:32:23,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-11-19 09:32:23,979 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-11-19 09:32:23,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 184 flow [2024-11-19 09:32:23,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:32:23,985 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-19 09:32:23,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-19 09:32:23,993 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-19 09:32:23,993 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-19 09:32:23,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:32:23,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:23,993 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:23,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:32:23,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:23,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash -533648435, now seen corresponding path program 1 times [2024-11-19 09:32:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586076629] [2024-11-19 09:32:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:24,072 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-19 09:32:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586076629] [2024-11-19 09:32:24,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586076629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:24,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:32:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811461192] [2024-11-19 09:32:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:24,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:32:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:32:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:32:24,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-19 09:32:24,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-19 09:32:24,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:24,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-19 09:32:24,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:24,221 INFO L124 PetriNetUnfolderBase]: 603/1127 cut-off events. [2024-11-19 09:32:24,221 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-19 09:32:24,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 1127 events. 603/1127 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7146 event pairs, 603 based on Foata normal form. 36/1129 useless extension candidates. Maximal degree in co-relation 2153. Up to 922 conditions per place. [2024-11-19 09:32:24,227 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-19 09:32:24,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-19 09:32:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:32:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:32:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-19 09:32:24,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-19 09:32:24,230 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-19 09:32:24,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-19 09:32:24,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:32:24,231 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-19 09:32:24,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-19 09:32:24,233 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-19 09:32:24,233 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-19 09:32:24,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-19 09:32:24,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:24,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:24,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:32:24,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:24,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -533646914, now seen corresponding path program 1 times [2024-11-19 09:32:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:24,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876927492] [2024-11-19 09:32:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:24,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:24,488 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-19 09:32:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:24,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876927492] [2024-11-19 09:32:24,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876927492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:24,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:24,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:32:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675191005] [2024-11-19 09:32:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:24,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:32:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:32:24,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:32:24,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-19 09:32:24,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-19 09:32:24,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:24,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-19 09:32:24,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:24,852 INFO L124 PetriNetUnfolderBase]: 983/1723 cut-off events. [2024-11-19 09:32:24,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:32:24,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 1723 events. 983/1723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11036 event pairs, 167 based on Foata normal form. 0/1677 useless extension candidates. Maximal degree in co-relation 3247. Up to 790 conditions per place. [2024-11-19 09:32:24,858 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 26 selfloop transitions, 2 changer transitions 39/80 dead transitions. [2024-11-19 09:32:24,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 302 flow [2024-11-19 09:32:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:32:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:32:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-19 09:32:24,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-11-19 09:32:24,861 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 205 transitions. [2024-11-19 09:32:24,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 302 flow [2024-11-19 09:32:24,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:32:24,863 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 89 flow [2024-11-19 09:32:24,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2024-11-19 09:32:24,865 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-19 09:32:24,866 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 89 flow [2024-11-19 09:32:24,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-19 09:32:24,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:24,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:24,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:32:24,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:24,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1805066013, now seen corresponding path program 1 times [2024-11-19 09:32:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:24,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593173727] [2024-11-19 09:32:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:25,085 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-19 09:32:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593173727] [2024-11-19 09:32:25,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593173727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:25,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:25,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:32:25,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540415901] [2024-11-19 09:32:25,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:25,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:32:25,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:32:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:32:25,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-19 09:32:25,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-19 09:32:25,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:25,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-19 09:32:25,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:25,472 INFO L124 PetriNetUnfolderBase]: 1064/1849 cut-off events. [2024-11-19 09:32:25,472 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2024-11-19 09:32:25,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3907 conditions, 1849 events. 1064/1849 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11952 event pairs, 233 based on Foata normal form. 45/1878 useless extension candidates. Maximal degree in co-relation 3895. Up to 577 conditions per place. [2024-11-19 09:32:25,482 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 32 selfloop transitions, 3 changer transitions 33/80 dead transitions. [2024-11-19 09:32:25,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 336 flow [2024-11-19 09:32:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:32:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:32:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-19 09:32:25,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-19 09:32:25,486 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 89 flow. Second operand 8 states and 198 transitions. [2024-11-19 09:32:25,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 336 flow [2024-11-19 09:32:25,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 314 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-19 09:32:25,497 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 99 flow [2024-11-19 09:32:25,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2024-11-19 09:32:25,498 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-19 09:32:25,498 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 99 flow [2024-11-19 09:32:25,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-19 09:32:25,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:25,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:25,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:32:25,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:25,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash 887162933, now seen corresponding path program 1 times [2024-11-19 09:32:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97120066] [2024-11-19 09:32:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:25,717 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-19 09:32:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97120066] [2024-11-19 09:32:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97120066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:25,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:32:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741139637] [2024-11-19 09:32:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:25,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:32:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:32:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:32:25,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-19 09:32:25,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-19 09:32:25,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:25,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-19 09:32:25,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:25,965 INFO L124 PetriNetUnfolderBase]: 898/1601 cut-off events. [2024-11-19 09:32:25,965 INFO L125 PetriNetUnfolderBase]: For 556/560 co-relation queries the response was YES. [2024-11-19 09:32:25,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 1601 events. 898/1601 cut-off events. For 556/560 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9258 event pairs, 276 based on Foata normal form. 48/1642 useless extension candidates. Maximal degree in co-relation 3450. Up to 1078 conditions per place. [2024-11-19 09:32:25,974 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 30 selfloop transitions, 3 changer transitions 27/72 dead transitions. [2024-11-19 09:32:25,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 315 flow [2024-11-19 09:32:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:32:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:32:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-19 09:32:25,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-19 09:32:25,976 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 99 flow. Second operand 7 states and 174 transitions. [2024-11-19 09:32:25,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 315 flow [2024-11-19 09:32:25,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 283 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-19 09:32:25,984 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 114 flow [2024-11-19 09:32:25,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-11-19 09:32:25,987 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-19 09:32:25,987 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 114 flow [2024-11-19 09:32:25,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-19 09:32:25,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:25,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:25,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:32:25,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1422718047, now seen corresponding path program 1 times [2024-11-19 09:32:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083077376] [2024-11-19 09:32:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:26,371 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-19 09:32:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083077376] [2024-11-19 09:32:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083077376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:26,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:26,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:32:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081943219] [2024-11-19 09:32:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:26,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:32:26,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:32:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:32:26,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:26,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-19 09:32:26,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:26,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:26,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:26,815 INFO L124 PetriNetUnfolderBase]: 1155/1999 cut-off events. [2024-11-19 09:32:26,815 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-19 09:32:26,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4868 conditions, 1999 events. 1155/1999 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11605 event pairs, 513 based on Foata normal form. 47/2045 useless extension candidates. Maximal degree in co-relation 4855. Up to 1322 conditions per place. [2024-11-19 09:32:26,826 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 31 selfloop transitions, 10 changer transitions 29/81 dead transitions. [2024-11-19 09:32:26,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 403 flow [2024-11-19 09:32:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:32:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:32:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-19 09:32:26,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-19 09:32:26,827 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 114 flow. Second operand 7 states and 174 transitions. [2024-11-19 09:32:26,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 403 flow [2024-11-19 09:32:26,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 387 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-19 09:32:26,833 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 199 flow [2024-11-19 09:32:26,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-19 09:32:26,835 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-19 09:32:26,836 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 199 flow [2024-11-19 09:32:26,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-19 09:32:26,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:26,836 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:26,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:32:26,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1569755799, now seen corresponding path program 2 times [2024-11-19 09:32:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559846297] [2024-11-19 09:32:26,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:32:26,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:26,860 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:32:26,860 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:32:27,023 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-19 09:32:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559846297] [2024-11-19 09:32:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559846297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:27,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:27,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:32:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415061786] [2024-11-19 09:32:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:27,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:32:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:32:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:32:27,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-19 09:32:27,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-19 09:32:27,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:27,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-19 09:32:27,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:27,360 INFO L124 PetriNetUnfolderBase]: 1359/2426 cut-off events. [2024-11-19 09:32:27,361 INFO L125 PetriNetUnfolderBase]: For 5116/5116 co-relation queries the response was YES. [2024-11-19 09:32:27,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8199 conditions, 2426 events. 1359/2426 cut-off events. For 5116/5116 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15662 event pairs, 514 based on Foata normal form. 63/2463 useless extension candidates. Maximal degree in co-relation 8182. Up to 962 conditions per place. [2024-11-19 09:32:27,372 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 38 selfloop transitions, 4 changer transitions 29/83 dead transitions. [2024-11-19 09:32:27,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 572 flow [2024-11-19 09:32:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:32:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:32:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-11-19 09:32:27,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-19 09:32:27,373 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 199 flow. Second operand 7 states and 176 transitions. [2024-11-19 09:32:27,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 572 flow [2024-11-19 09:32:27,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 541 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-19 09:32:27,380 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 203 flow [2024-11-19 09:32:27,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-19 09:32:27,381 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2024-11-19 09:32:27,381 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 203 flow [2024-11-19 09:32:27,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-19 09:32:27,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:27,381 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-19 09:32:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:32:27,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1066464830, now seen corresponding path program 1 times [2024-11-19 09:32:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065289760] [2024-11-19 09:32:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:27,759 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-19 09:32:27,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:27,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065289760] [2024-11-19 09:32:27,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065289760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:27,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:27,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:32:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213413215] [2024-11-19 09:32:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:27,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:32:27,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:27,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:32:27,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:32:27,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-19 09:32:27,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 203 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-19 09:32:27,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:27,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-19 09:32:27,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:28,188 INFO L124 PetriNetUnfolderBase]: 1632/3032 cut-off events. [2024-11-19 09:32:28,188 INFO L125 PetriNetUnfolderBase]: For 7154/7173 co-relation queries the response was YES. [2024-11-19 09:32:28,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9687 conditions, 3032 events. 1632/3032 cut-off events. For 7154/7173 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20294 event pairs, 746 based on Foata normal form. 105/3061 useless extension candidates. Maximal degree in co-relation 9667. Up to 1929 conditions per place. [2024-11-19 09:32:28,205 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 37 selfloop transitions, 9 changer transitions 33/96 dead transitions. [2024-11-19 09:32:28,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 605 flow [2024-11-19 09:32:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:32:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:32:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-19 09:32:28,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-19 09:32:28,207 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 203 flow. Second operand 8 states and 198 transitions. [2024-11-19 09:32:28,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 605 flow [2024-11-19 09:32:28,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 577 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-19 09:32:28,224 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 282 flow [2024-11-19 09:32:28,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2024-11-19 09:32:28,225 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-11-19 09:32:28,225 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 282 flow [2024-11-19 09:32:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-19 09:32:28,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:28,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:28,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:32:28,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 227913241, now seen corresponding path program 1 times [2024-11-19 09:32:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638827306] [2024-11-19 09:32:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:28,629 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-19 09:32:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638827306] [2024-11-19 09:32:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638827306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:32:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811899509] [2024-11-19 09:32:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:28,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:32:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:28,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:32:28,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:32:28,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-19 09:32:28,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 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-19 09:32:28,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:28,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-19 09:32:28,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:29,173 INFO L124 PetriNetUnfolderBase]: 1863/3316 cut-off events. [2024-11-19 09:32:29,174 INFO L125 PetriNetUnfolderBase]: For 13836/13910 co-relation queries the response was YES. [2024-11-19 09:32:29,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13197 conditions, 3316 events. 1863/3316 cut-off events. For 13836/13910 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22128 event pairs, 756 based on Foata normal form. 69/3305 useless extension candidates. Maximal degree in co-relation 13174. Up to 2106 conditions per place. [2024-11-19 09:32:29,194 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 43 selfloop transitions, 22 changer transitions 36/118 dead transitions. [2024-11-19 09:32:29,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 987 flow [2024-11-19 09:32:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:32:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:32:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-11-19 09:32:29,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-19 09:32:29,196 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 282 flow. Second operand 9 states and 222 transitions. [2024-11-19 09:32:29,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 987 flow [2024-11-19 09:32:29,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 975 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-19 09:32:29,206 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 558 flow [2024-11-19 09:32:29,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=558, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2024-11-19 09:32:29,207 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-11-19 09:32:29,207 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 558 flow [2024-11-19 09:32:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 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-19 09:32:29,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:29,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:32:29,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1281821857, now seen corresponding path program 2 times [2024-11-19 09:32:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12664401] [2024-11-19 09:32:29,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:32:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:29,224 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:32:29,225 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:32:29,711 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-19 09:32:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12664401] [2024-11-19 09:32:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12664401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:29,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:29,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:32:29,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475409354] [2024-11-19 09:32:29,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:29,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:32:29,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:29,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:32:29,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:32:29,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:29,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 558 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:32:29,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:29,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:29,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:30,435 INFO L124 PetriNetUnfolderBase]: 2217/3857 cut-off events. [2024-11-19 09:32:30,435 INFO L125 PetriNetUnfolderBase]: For 27046/27153 co-relation queries the response was YES. [2024-11-19 09:32:30,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18536 conditions, 3857 events. 2217/3857 cut-off events. For 27046/27153 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25580 event pairs, 897 based on Foata normal form. 175/3980 useless extension candidates. Maximal degree in co-relation 18506. Up to 2358 conditions per place. [2024-11-19 09:32:30,457 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 60 selfloop transitions, 19 changer transitions 70/161 dead transitions. [2024-11-19 09:32:30,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 161 transitions, 1912 flow [2024-11-19 09:32:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:32:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:32:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2024-11-19 09:32:30,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.512396694214876 [2024-11-19 09:32:30,458 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 558 flow. Second operand 11 states and 248 transitions. [2024-11-19 09:32:30,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 161 transitions, 1912 flow [2024-11-19 09:32:30,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 161 transitions, 1881 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-11-19 09:32:30,482 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 791 flow [2024-11-19 09:32:30,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=791, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2024-11-19 09:32:30,483 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 37 predicate places. [2024-11-19 09:32:30,483 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 791 flow [2024-11-19 09:32:30,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:32:30,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:30,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:30,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:32:30,484 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1590080409, now seen corresponding path program 1 times [2024-11-19 09:32:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934218414] [2024-11-19 09:32:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:32:30,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:30,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934218414] [2024-11-19 09:32:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934218414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:30,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:30,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:32:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869579848] [2024-11-19 09:32:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:30,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:32:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:30,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:32:30,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:32:30,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:30,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 791 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-19 09:32:30,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:30,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:30,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:31,245 INFO L124 PetriNetUnfolderBase]: 3373/5429 cut-off events. [2024-11-19 09:32:31,245 INFO L125 PetriNetUnfolderBase]: For 75019/75848 co-relation queries the response was YES. [2024-11-19 09:32:31,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28805 conditions, 5429 events. 3373/5429 cut-off events. For 75019/75848 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 33083 event pairs, 433 based on Foata normal form. 767/6040 useless extension candidates. Maximal degree in co-relation 28768. Up to 3067 conditions per place. [2024-11-19 09:32:31,282 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 76 selfloop transitions, 5 changer transitions 13/110 dead transitions. [2024-11-19 09:32:31,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 1501 flow [2024-11-19 09:32:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:32:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:32:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-19 09:32:31,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-19 09:32:31,284 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 791 flow. Second operand 4 states and 108 transitions. [2024-11-19 09:32:31,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 1501 flow [2024-11-19 09:32:31,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 110 transitions, 1391 flow, removed 53 selfloop flow, removed 8 redundant places. [2024-11-19 09:32:31,323 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 657 flow [2024-11-19 09:32:31,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=657, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2024-11-19 09:32:31,323 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2024-11-19 09:32:31,323 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 657 flow [2024-11-19 09:32:31,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-19 09:32:31,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:31,324 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] [2024-11-19 09:32:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:32:31,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -810798353, now seen corresponding path program 1 times [2024-11-19 09:32:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105110192] [2024-11-19 09:32:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:31,473 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-19 09:32:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105110192] [2024-11-19 09:32:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105110192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:32:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120975179] [2024-11-19 09:32:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:31,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:32:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:32:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:32:31,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:31,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 657 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-19 09:32:31,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:31,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:31,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:31,887 INFO L124 PetriNetUnfolderBase]: 2280/3704 cut-off events. [2024-11-19 09:32:31,887 INFO L125 PetriNetUnfolderBase]: For 45543/46094 co-relation queries the response was YES. [2024-11-19 09:32:31,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19055 conditions, 3704 events. 2280/3704 cut-off events. For 45543/46094 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20938 event pairs, 222 based on Foata normal form. 571/4127 useless extension candidates. Maximal degree in co-relation 19021. Up to 1228 conditions per place. [2024-11-19 09:32:31,905 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 74 selfloop transitions, 8 changer transitions 14/112 dead transitions. [2024-11-19 09:32:31,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 112 transitions, 1343 flow [2024-11-19 09:32:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:32:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:32:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-11-19 09:32:31,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-19 09:32:31,907 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 657 flow. Second operand 5 states and 135 transitions. [2024-11-19 09:32:31,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 112 transitions, 1343 flow [2024-11-19 09:32:31,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 112 transitions, 1295 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-19 09:32:31,922 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 543 flow [2024-11-19 09:32:31,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=543, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-11-19 09:32:31,923 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2024-11-19 09:32:31,923 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 543 flow [2024-11-19 09:32:31,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-19 09:32:31,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:31,923 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-19 09:32:31,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:32:31,924 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:31,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1099028239, now seen corresponding path program 1 times [2024-11-19 09:32:31,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:31,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419420654] [2024-11-19 09:32:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:32,097 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-19 09:32:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419420654] [2024-11-19 09:32:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419420654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:32:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238777109] [2024-11-19 09:32:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:32,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:32:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:32:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:32:32,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:32,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-19 09:32:32,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:32,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:32,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:32,438 INFO L124 PetriNetUnfolderBase]: 1644/2674 cut-off events. [2024-11-19 09:32:32,438 INFO L125 PetriNetUnfolderBase]: For 35312/35750 co-relation queries the response was YES. [2024-11-19 09:32:32,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14610 conditions, 2674 events. 1644/2674 cut-off events. For 35312/35750 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14666 event pairs, 211 based on Foata normal form. 389/2952 useless extension candidates. Maximal degree in co-relation 14575. Up to 947 conditions per place. [2024-11-19 09:32:32,453 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 54 selfloop transitions, 11 changer transitions 16/94 dead transitions. [2024-11-19 09:32:32,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 986 flow [2024-11-19 09:32:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:32:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:32:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-19 09:32:32,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-11-19 09:32:32,454 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 543 flow. Second operand 6 states and 149 transitions. [2024-11-19 09:32:32,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 986 flow [2024-11-19 09:32:32,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 94 transitions, 851 flow, removed 63 selfloop flow, removed 5 redundant places. [2024-11-19 09:32:32,476 INFO L231 Difference]: Finished difference. Result has 82 places, 53 transitions, 397 flow [2024-11-19 09:32:32,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=82, PETRI_TRANSITIONS=53} [2024-11-19 09:32:32,478 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-19 09:32:32,478 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 53 transitions, 397 flow [2024-11-19 09:32:32,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-19 09:32:32,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:32,479 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:32,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:32:32,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash -624855054, now seen corresponding path program 1 times [2024-11-19 09:32:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:32,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32079280] [2024-11-19 09:32:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:34,006 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-19 09:32:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:32:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32079280] [2024-11-19 09:32:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32079280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:32:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878183718] [2024-11-19 09:32:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:32:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:32:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:32:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:32:34,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-19 09:32:34,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 53 transitions, 397 flow. Second operand has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 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-19 09:32:34,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:34,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-19 09:32:34,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:34,573 INFO L124 PetriNetUnfolderBase]: 798/1689 cut-off events. [2024-11-19 09:32:34,574 INFO L125 PetriNetUnfolderBase]: For 8906/9104 co-relation queries the response was YES. [2024-11-19 09:32:34,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6625 conditions, 1689 events. 798/1689 cut-off events. For 8906/9104 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11001 event pairs, 215 based on Foata normal form. 36/1602 useless extension candidates. Maximal degree in co-relation 6591. Up to 505 conditions per place. [2024-11-19 09:32:34,583 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 30 selfloop transitions, 4 changer transitions 40/98 dead transitions. [2024-11-19 09:32:34,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 765 flow [2024-11-19 09:32:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:32:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:32:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 253 transitions. [2024-11-19 09:32:34,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-11-19 09:32:34,584 INFO L175 Difference]: Start difference. First operand has 82 places, 53 transitions, 397 flow. Second operand 11 states and 253 transitions. [2024-11-19 09:32:34,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 765 flow [2024-11-19 09:32:34,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 98 transitions, 608 flow, removed 57 selfloop flow, removed 16 redundant places. [2024-11-19 09:32:34,600 INFO L231 Difference]: Finished difference. Result has 82 places, 50 transitions, 300 flow [2024-11-19 09:32:34,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=300, PETRI_PLACES=82, PETRI_TRANSITIONS=50} [2024-11-19 09:32:34,602 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-19 09:32:34,602 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 50 transitions, 300 flow [2024-11-19 09:32:34,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 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-19 09:32:34,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:34,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:34,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:32:34,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:34,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1454394920, now seen corresponding path program 2 times [2024-11-19 09:32:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:32:34,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080011209] [2024-11-19 09:32:34,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:32:34,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:32:34,643 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:32:34,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:32:34,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:32:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:32:34,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:32:34,719 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:32:34,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:32:34,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:32:34,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-19 09:32:34,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:32:34,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 09:32:34,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-19 09:32:34,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:32:34,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:32:34,722 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:34,791 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:32:34,791 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:32:34,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:32:34 BasicIcfg [2024-11-19 09:32:34,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:32:34,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:32:34,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:32:34,796 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:32:34,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:23" (3/4) ... [2024-11-19 09:32:34,798 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:32:34,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:32:34,800 INFO L158 Benchmark]: Toolchain (without parser) took 13008.17ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 65.3MB in the beginning and 424.5MB in the end (delta: -359.2MB). Peak memory consumption was 573.9MB. Max. memory is 16.1GB. [2024-11-19 09:32:34,800 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 134.2MB. Free memory was 98.5MB in the beginning and 98.4MB in the end (delta: 12.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:32:34,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.58ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 65.2MB in the beginning and 135.1MB in the end (delta: -70.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-19 09:32:34,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.37ms. Allocated memory is still 188.7MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:32:34,800 INFO L158 Benchmark]: Boogie Preprocessor took 63.45ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 128.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:32:34,801 INFO L158 Benchmark]: RCFGBuilder took 658.70ms. Allocated memory is still 188.7MB. Free memory was 128.8MB in the beginning and 140.0MB in the end (delta: -11.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-19 09:32:34,801 INFO L158 Benchmark]: TraceAbstraction took 11722.32ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 876.6MB). Free memory was 140.0MB in the beginning and 425.5MB in the end (delta: -285.6MB). Peak memory consumption was 593.1MB. Max. memory is 16.1GB. [2024-11-19 09:32:34,802 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 1.1GB. Free memory was 425.5MB in the beginning and 424.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:32:34,803 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.09ms. Allocated memory is still 134.2MB. Free memory was 98.5MB in the beginning and 98.4MB in the end (delta: 12.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.58ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 65.2MB in the beginning and 135.1MB in the end (delta: -70.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.37ms. Allocated memory is still 188.7MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.45ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 128.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 658.70ms. Allocated memory is still 188.7MB. Free memory was 128.8MB in the beginning and 140.0MB in the end (delta: -11.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11722.32ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 876.6MB). Free memory was 140.0MB in the beginning and 425.5MB in the end (delta: -285.6MB). Peak memory consumption was 593.1MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 1.1GB. Free memory was 425.5MB in the beginning and 424.5MB 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L747] 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) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 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 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L17] 0 __assert_fail ("0", "safe011_power.opt_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 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: 11.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 675 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1758 IncrementalHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 46 mSDtfsCounter, 1758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=791occurred in iteration=10, InterpolantAutomatonStates: 97, 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.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 1707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:32:34,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.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 bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:32:36,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:32:36,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:32:36,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:32:36,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:32:36,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:32:36,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:32:36,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:32:36,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:32:36,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:32:36,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:32:36,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:32:36,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:32:36,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:32:36,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:32:36,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:32:36,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:32:36,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:32:36,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:32:36,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:32:36,855 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:32:36,858 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:32:36,858 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:32:36,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:32:36,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:32:36,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:32:36,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:32:36,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:32:36,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:32:36,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:32:36,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:32:36,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:32:36,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:32:36,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:32:36,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:32:36,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:32:36,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:32:36,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:32:36,861 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:32:36,861 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:32:36,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:32:36,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:32:36,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:32:36,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:32:36,862 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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2024-11-19 09:32:37,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:32:37,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:32:37,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:32:37,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:32:37,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:32:37,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-19 09:32:38,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:32:38,603 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:32:38,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-19 09:32:38,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1c1883a/a2e86976b51f450384b5e3171905d603/FLAGf0696184c [2024-11-19 09:32:38,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1c1883a/a2e86976b51f450384b5e3171905d603 [2024-11-19 09:32:38,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:32:38,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:32:38,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:32:38,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:32:38,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:32:38,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:32:38" (1/1) ... [2024-11-19 09:32:38,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d215507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:38, skipping insertion in model container [2024-11-19 09:32:38,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:32:38" (1/1) ... [2024-11-19 09:32:38,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:32:39,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:32:39,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:32:39,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:32:39,130 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:32:39,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39 WrapperNode [2024-11-19 09:32:39,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:32:39,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:32:39,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:32:39,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:32:39,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,178 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-19 09:32:39,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:32:39,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:32:39,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:32:39,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:32:39,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,213 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-19 09:32:39,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:32:39,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:32:39,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:32:39,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:32:39,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (1/1) ... [2024-11-19 09:32:39,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:32:39,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:32:39,268 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-19 09:32:39,270 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-19 09:32:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:32:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:32:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:32:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:32:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:32:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:32:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:32:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:32:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:32:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:32:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:32:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:32:39,303 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:32:39,426 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:32:39,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:32:39,729 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:32:39,729 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:32:39,907 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:32:39,908 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:32:39,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:39 BoogieIcfgContainer [2024-11-19 09:32:39,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:32:39,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:32:39,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:32:39,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:32:39,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:32:38" (1/3) ... [2024-11-19 09:32:39,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338a32de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:32:39, skipping insertion in model container [2024-11-19 09:32:39,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:32:39" (2/3) ... [2024-11-19 09:32:39,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338a32de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:32:39, skipping insertion in model container [2024-11-19 09:32:39,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:39" (3/3) ... [2024-11-19 09:32:39,917 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2024-11-19 09:32:39,930 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:32:39,931 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:32:39,931 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:32:39,971 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:32:39,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-19 09:32:40,022 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-19 09:32:40,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:32:40,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-19 09:32:40,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-19 09:32:40,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-19 09:32:40,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:32:40,048 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;@5666a863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:32:40,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:32:40,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:32:40,055 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-19 09:32:40,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:32:40,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:40,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:32:40,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:40,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1353053513, now seen corresponding path program 1 times [2024-11-19 09:32:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928321898] [2024-11-19 09:32:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:40,072 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-19 09:32:40,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:40,075 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-19 09:32:40,076 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-19 09:32:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:40,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:32:40,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:40,197 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-19 09:32:40,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:40,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928321898] [2024-11-19 09:32:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928321898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:40,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:40,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:32:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284579849] [2024-11-19 09:32:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:32:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:32:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:32:40,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-19 09:32:40,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:32:40,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:40,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-19 09:32:40,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:40,549 INFO L124 PetriNetUnfolderBase]: 678/1271 cut-off events. [2024-11-19 09:32:40,549 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 09:32:40,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 1271 events. 678/1271 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8121 event pairs, 108 based on Foata normal form. 72/1325 useless extension candidates. Maximal degree in co-relation 2330. Up to 832 conditions per place. [2024-11-19 09:32:40,562 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-19 09:32:40,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 184 flow [2024-11-19 09:32:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:32:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:32:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-19 09:32:40,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-11-19 09:32:40,579 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-11-19 09:32:40,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 184 flow [2024-11-19 09:32:40,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:32:40,584 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-19 09:32:40,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-19 09:32:40,590 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-19 09:32:40,590 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-19 09:32:40,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:32:40,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:40,590 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:40,594 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-19 09:32:40,793 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-19 09:32:40,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:40,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1234145807, now seen corresponding path program 1 times [2024-11-19 09:32:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067758734] [2024-11-19 09:32:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:40,796 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-19 09:32:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:40,815 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-19 09:32:40,816 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-19 09:32:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:40,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:32:40,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:40,937 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-19 09:32:40,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:40,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067758734] [2024-11-19 09:32:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067758734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:40,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:40,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:32:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969902160] [2024-11-19 09:32:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:40,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:32:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:40,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:32:40,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:32:40,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:40,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-19 09:32:40,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:40,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:40,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:41,222 INFO L124 PetriNetUnfolderBase]: 1509/2571 cut-off events. [2024-11-19 09:32:41,223 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-11-19 09:32:41,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 2571 events. 1509/2571 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16218 event pairs, 147 based on Foata normal form. 80/2607 useless extension candidates. Maximal degree in co-relation 5029. Up to 1513 conditions per place. [2024-11-19 09:32:41,235 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-19 09:32:41,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 230 flow [2024-11-19 09:32:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:32:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:32:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-19 09:32:41,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-11-19 09:32:41,237 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 109 transitions. [2024-11-19 09:32:41,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 230 flow [2024-11-19 09:32:41,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:32:41,243 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-19 09:32:41,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-11-19 09:32:41,244 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-19 09:32:41,244 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-19 09:32:41,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-19 09:32:41,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:41,244 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:41,248 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-19 09:32:41,445 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-19 09:32:41,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:41,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:41,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1768737622, now seen corresponding path program 1 times [2024-11-19 09:32:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:41,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130782553] [2024-11-19 09:32:41,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:41,447 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-19 09:32:41,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:41,448 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-19 09:32:41,449 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-19 09:32:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:41,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:32:41,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:41,555 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-19 09:32:41,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:41,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:41,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130782553] [2024-11-19 09:32:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130782553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:41,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:32:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666938125] [2024-11-19 09:32:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:41,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:32:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:32:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:32:41,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:41,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-19 09:32:41,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:41,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:41,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:41,786 INFO L124 PetriNetUnfolderBase]: 945/1643 cut-off events. [2024-11-19 09:32:41,786 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2024-11-19 09:32:41,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 1643 events. 945/1643 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9159 event pairs, 73 based on Foata normal form. 68/1675 useless extension candidates. Maximal degree in co-relation 3669. Up to 729 conditions per place. [2024-11-19 09:32:41,793 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-11-19 09:32:41,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2024-11-19 09:32:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:32:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:32:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-19 09:32:41,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-19 09:32:41,795 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 137 transitions. [2024-11-19 09:32:41,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2024-11-19 09:32:41,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:32:41,797 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-19 09:32:41,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-19 09:32:41,800 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-19 09:32:41,800 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-19 09:32:41,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-19 09:32:41,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:41,800 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:41,805 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:32:42,000 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-19 09:32:42,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1577770993, now seen corresponding path program 1 times [2024-11-19 09:32:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:42,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188770066] [2024-11-19 09:32:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:42,002 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-19 09:32:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:42,005 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-19 09:32:42,006 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-19 09:32:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:42,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:32:42,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:42,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-19 09:32:42,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:42,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:42,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188770066] [2024-11-19 09:32:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188770066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:42,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:32:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019135899] [2024-11-19 09:32:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:42,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:32:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:32:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:32:42,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-19 09:32:42,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-19 09:32:42,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:42,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-19 09:32:42,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:42,399 INFO L124 PetriNetUnfolderBase]: 501/859 cut-off events. [2024-11-19 09:32:42,399 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-11-19 09:32:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 859 events. 501/859 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3887 event pairs, 59 based on Foata normal form. 36/864 useless extension candidates. Maximal degree in co-relation 2197. Up to 268 conditions per place. [2024-11-19 09:32:42,404 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-19 09:32:42,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 330 flow [2024-11-19 09:32:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:32:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:32:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-19 09:32:42,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-11-19 09:32:42,405 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 149 transitions. [2024-11-19 09:32:42,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 330 flow [2024-11-19 09:32:42,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:32:42,410 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-19 09:32:42,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-19 09:32:42,411 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-19 09:32:42,412 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-19 09:32:42,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-19 09:32:42,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:42,412 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:42,417 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-19 09:32:42,615 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-19 09:32:42,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:42,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -957906943, now seen corresponding path program 1 times [2024-11-19 09:32:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:42,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196353841] [2024-11-19 09:32:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:42,617 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-19 09:32:42,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:42,618 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-19 09:32:42,619 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-19 09:32:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:42,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:32:42,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:42,723 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-19 09:32:42,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:42,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196353841] [2024-11-19 09:32:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196353841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:42,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:42,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:32:42,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712947199] [2024-11-19 09:32:42,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:42,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:32:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:32:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:32:42,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-19 09:32:42,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-19 09:32:42,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:42,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-19 09:32:42,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:42,810 INFO L124 PetriNetUnfolderBase]: 259/537 cut-off events. [2024-11-19 09:32:42,812 INFO L125 PetriNetUnfolderBase]: For 161/167 co-relation queries the response was YES. [2024-11-19 09:32:42,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 537 events. 259/537 cut-off events. For 161/167 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2633 event pairs, 249 based on Foata normal form. 8/494 useless extension candidates. Maximal degree in co-relation 1148. Up to 422 conditions per place. [2024-11-19 09:32:42,815 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-19 09:32:42,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 204 flow [2024-11-19 09:32:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:32:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:32:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-19 09:32:42,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-19 09:32:42,818 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 75 transitions. [2024-11-19 09:32:42,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 204 flow [2024-11-19 09:32:42,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-19 09:32:42,821 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-19 09:32:42,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-19 09:32:42,822 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-19 09:32:42,823 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-19 09:32:42,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-19 09:32:42,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:42,824 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:42,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:32:43,024 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-19 09:32:43,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:43,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1411664126, now seen corresponding path program 1 times [2024-11-19 09:32:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327478572] [2024-11-19 09:32:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:32:43,026 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-19 09:32:43,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:43,028 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-19 09:32:43,029 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-19 09:32:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:32:43,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:32:43,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:43,269 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-19 09:32:43,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:43,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:43,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327478572] [2024-11-19 09:32:43,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327478572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:43,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:32:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901923770] [2024-11-19 09:32:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:43,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:32:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:32:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:32:43,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-19 09:32:43,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-19 09:32:43,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:43,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-19 09:32:43,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:43,430 INFO L124 PetriNetUnfolderBase]: 593/1121 cut-off events. [2024-11-19 09:32:43,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:32:43,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 1121 events. 593/1121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6058 event pairs, 275 based on Foata normal form. 8/1062 useless extension candidates. Maximal degree in co-relation 2185. Up to 528 conditions per place. [2024-11-19 09:32:43,434 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 25 selfloop transitions, 2 changer transitions 13/59 dead transitions. [2024-11-19 09:32:43,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 226 flow [2024-11-19 09:32:43,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:32:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:32:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-11-19 09:32:43,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2024-11-19 09:32:43,435 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 5 states and 126 transitions. [2024-11-19 09:32:43,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 226 flow [2024-11-19 09:32:43,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:32:43,437 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 119 flow [2024-11-19 09:32:43,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-11-19 09:32:43,437 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2024-11-19 09:32:43,437 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 119 flow [2024-11-19 09:32:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-19 09:32:43,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:43,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:43,442 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-19 09:32:43,641 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-19 09:32:43,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1001386498, now seen corresponding path program 2 times [2024-11-19 09:32:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:43,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890827008] [2024-11-19 09:32:43,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:32:43,643 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-19 09:32:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:43,646 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-19 09:32:43,646 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-19 09:32:43,712 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:32:43,712 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:32:43,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 09:32:43,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:44,100 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-19 09:32:44,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:44,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:44,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890827008] [2024-11-19 09:32:44,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890827008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:44,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:44,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:32:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809911152] [2024-11-19 09:32:44,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:44,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:32:44,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:44,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:32:44,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:32:44,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-19 09:32:44,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 119 flow. Second operand has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 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-19 09:32:44,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:44,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-19 09:32:44,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:44,408 INFO L124 PetriNetUnfolderBase]: 400/769 cut-off events. [2024-11-19 09:32:44,408 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:32:44,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 769 events. 400/769 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3662 event pairs, 152 based on Foata normal form. 8/723 useless extension candidates. Maximal degree in co-relation 1533. Up to 292 conditions per place. [2024-11-19 09:32:44,411 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 6 changer transitions 12/69 dead transitions. [2024-11-19 09:32:44,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 281 flow [2024-11-19 09:32:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:32:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:32:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-11-19 09:32:44,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2024-11-19 09:32:44,412 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 119 flow. Second operand 8 states and 194 transitions. [2024-11-19 09:32:44,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 281 flow [2024-11-19 09:32:44,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 267 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:32:44,413 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 133 flow [2024-11-19 09:32:44,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-11-19 09:32:44,414 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2024-11-19 09:32:44,416 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 133 flow [2024-11-19 09:32:44,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 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-19 09:32:44,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:44,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:44,421 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-19 09:32:44,617 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-19 09:32:44,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:44,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash 293502032, now seen corresponding path program 3 times [2024-11-19 09:32:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623292266] [2024-11-19 09:32:44,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:32:44,619 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-19 09:32:44,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:44,622 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-19 09:32:44,623 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-19 09:32:44,693 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:32:44,693 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:32:44,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:32:44,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:32:44,817 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-19 09:32:44,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:32:44,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:32:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623292266] [2024-11-19 09:32:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623292266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:32:44,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:32:44,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:32:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057303449] [2024-11-19 09:32:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:32:44,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:32:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:32:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:32:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:32:44,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-19 09:32:44,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-19 09:32:44,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:32:44,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-19 09:32:44,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:32:44,980 INFO L124 PetriNetUnfolderBase]: 464/883 cut-off events. [2024-11-19 09:32:44,980 INFO L125 PetriNetUnfolderBase]: For 54/72 co-relation queries the response was YES. [2024-11-19 09:32:44,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 883 events. 464/883 cut-off events. For 54/72 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4357 event pairs, 184 based on Foata normal form. 9/836 useless extension candidates. Maximal degree in co-relation 1861. Up to 275 conditions per place. [2024-11-19 09:32:44,983 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 22 selfloop transitions, 3 changer transitions 23/67 dead transitions. [2024-11-19 09:32:44,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 285 flow [2024-11-19 09:32:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:32:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:32:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-19 09:32:44,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-11-19 09:32:44,984 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 133 flow. Second operand 6 states and 149 transitions. [2024-11-19 09:32:44,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 285 flow [2024-11-19 09:32:44,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 272 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:32:44,986 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 130 flow [2024-11-19 09:32:44,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-11-19 09:32:44,986 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-19 09:32:44,986 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 130 flow [2024-11-19 09:32:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-19 09:32:44,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:32:44,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:32:44,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:32:45,191 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-19 09:32:45,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:32:45,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:32:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1688189882, now seen corresponding path program 4 times [2024-11-19 09:32:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:32:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715720136] [2024-11-19 09:32:45,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:32:45,194 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-19 09:32:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:32:45,196 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-19 09:32:45,197 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-19 09:32:45,260 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:32:45,260 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:32:45,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:32:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:32:45,359 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:32:45,359 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:32:45,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:32:45,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:32:45,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-19 09:32:45,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:32:45,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 09:32:45,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-19 09:32:45,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:32:45,368 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-19 09:32:45,563 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-19 09:32:45,564 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-19 09:32:45,633 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:32:45,633 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:32:45,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:32:45 BasicIcfg [2024-11-19 09:32:45,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:32:45,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:32:45,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:32:45,637 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:32:45,637 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:32:39" (3/4) ... [2024-11-19 09:32:45,640 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:32:45,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:32:45,642 INFO L158 Benchmark]: Toolchain (without parser) took 7002.17ms. Allocated memory was 98.6MB in the beginning and 205.5MB in the end (delta: 107.0MB). Free memory was 58.8MB in the beginning and 76.9MB in the end (delta: -18.1MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2024-11-19 09:32:45,642 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 52.4MB. Free memory is still 25.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:32:45,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.46ms. Allocated memory is still 98.6MB. Free memory was 58.6MB in the beginning and 59.6MB in the end (delta: -992.4kB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-19 09:32:45,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.42ms. Allocated memory is still 98.6MB. Free memory was 59.6MB in the beginning and 56.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:32:45,646 INFO L158 Benchmark]: Boogie Preprocessor took 54.61ms. Allocated memory is still 98.6MB. Free memory was 56.8MB in the beginning and 53.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:32:45,646 INFO L158 Benchmark]: RCFGBuilder took 670.53ms. Allocated memory was 98.6MB in the beginning and 140.5MB in the end (delta: 41.9MB). Free memory was 53.4MB in the beginning and 100.6MB in the end (delta: -47.1MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-19 09:32:45,647 INFO L158 Benchmark]: TraceAbstraction took 5725.99ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 99.3MB in the beginning and 76.9MB in the end (delta: 22.4MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2024-11-19 09:32:45,647 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 205.5MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:32:45,648 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.91ms. Allocated memory is still 52.4MB. Free memory is still 25.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.46ms. Allocated memory is still 98.6MB. Free memory was 58.6MB in the beginning and 59.6MB in the end (delta: -992.4kB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.42ms. Allocated memory is still 98.6MB. Free memory was 59.6MB in the beginning and 56.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.61ms. Allocated memory is still 98.6MB. Free memory was 56.8MB in the beginning and 53.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 670.53ms. Allocated memory was 98.6MB in the beginning and 140.5MB in the end (delta: 41.9MB). Free memory was 53.4MB in the beginning and 100.6MB in the end (delta: -47.1MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5725.99ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 99.3MB in the beginning and 76.9MB in the end (delta: 22.4MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 205.5MB. Free memory is still 76.9MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=0, t2029=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=0, t2029=1, t2030=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L747] 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) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 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 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=0, t2029=1, t2030=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=0, t2029=1, t2030=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=0, t2029=1, t2030=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L17] 0 __assert_fail ("0", "safe011_power.opt_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 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: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 878 IncrementalHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 13 mSDtfsCounter, 878 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 796 SizeOfPredicates, 13 NumberOfNonLiveVariables, 890 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-19 09:32:45,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample