./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:01:42,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:01:42,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:01:42,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:01:42,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:01:42,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:01:42,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:01:42,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:01:42,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:01:42,888 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:01:42,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:01:42,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:01:42,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:01:42,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:01:42,891 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:01:42,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:01:42,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:01:42,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:01:42,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:01:42,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:01:42,892 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:01:42,897 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:01:42,897 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:01:42,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:01:42,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:01:42,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:01:42,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:01:42,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:01:42,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:01:42,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:01:42,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:01:42,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:01:42,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:01:42,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:01:42,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:01:42,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:01:42,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:01:42,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:01:42,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:01:42,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:01:42,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:01:42,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:01:42,901 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2024-10-24 19:01:43,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:01:43,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:01:43,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:01:43,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:01:43,151 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:01:43,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-24 19:01:44,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:01:44,691 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:01:44,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-24 19:01:44,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e360260/9bb1983ed8f9470a92ea9c5817307046/FLAG975214b91 [2024-10-24 19:01:44,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e360260/9bb1983ed8f9470a92ea9c5817307046 [2024-10-24 19:01:44,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:01:44,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:01:44,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:01:44,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:01:44,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:01:44,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:01:44" (1/1) ... [2024-10-24 19:01:44,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e21c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:44, skipping insertion in model container [2024-10-24 19:01:44,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:01:44" (1/1) ... [2024-10-24 19:01:44,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:01:44,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:01:45,002 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:01:45,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:01:45,071 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:01:45,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45 WrapperNode [2024-10-24 19:01:45,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:01:45,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:01:45,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:01:45,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:01:45,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,162 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-10-24 19:01:45,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:01:45,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:01:45,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:01:45,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:01:45,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,221 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-10-24 19:01:45,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:01:45,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:01:45,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:01:45,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:01:45,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (1/1) ... [2024-10-24 19:01:45,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:01:45,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:01:45,276 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-10-24 19:01:45,284 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-10-24 19:01:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:01:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:01:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 19:01:45,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 19:01:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 19:01:45,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 19:01:45,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 19:01:45,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 19:01:45,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:01:45,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:01:45,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:01:45,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:01:45,327 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:01:45,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:01:45,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:01:45,697 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:01:45,697 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:01:45,917 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:01:45,917 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:01:45,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:01:45 BoogieIcfgContainer [2024-10-24 19:01:45,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:01:45,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:01:45,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:01:45,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:01:45,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:01:44" (1/3) ... [2024-10-24 19:01:45,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608441ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:01:45, skipping insertion in model container [2024-10-24 19:01:45,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:45" (2/3) ... [2024-10-24 19:01:45,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608441ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:01:45, skipping insertion in model container [2024-10-24 19:01:45,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:01:45" (3/3) ... [2024-10-24 19:01:45,925 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-24 19:01:45,938 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:01:45,939 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-24 19:01:45,939 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:01:45,987 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:01:46,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-24 19:01:46,058 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-24 19:01:46,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:01:46,063 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-10-24 19:01:46,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-24 19:01:46,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-24 19:01:46,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:01:46,081 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;@2c5ea058, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:01:46,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 19:01:46,086 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:01:46,086 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-24 19:01:46,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:01:46,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:46,091 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:01:46,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 19:01:46,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1414063623, now seen corresponding path program 1 times [2024-10-24 19:01:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357274641] [2024-10-24 19:01:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:46,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:46,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:46,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357274641] [2024-10-24 19:01:46,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357274641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:46,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:46,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:01:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168118237] [2024-10-24 19:01:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:46,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:01:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:01:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:01:46,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-24 19:01:46,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-10-24 19:01:46,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:46,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-24 19:01:46,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:46,971 INFO L124 PetriNetUnfolderBase]: 678/1271 cut-off events. [2024-10-24 19:01:46,971 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-24 19:01:46,975 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-10-24 19:01:46,984 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-10-24 19:01:46,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 184 flow [2024-10-24 19:01:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:01:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:01:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-10-24 19:01:46,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-10-24 19:01:46,998 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-10-24 19:01:46,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 184 flow [2024-10-24 19:01:47,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:01:47,003 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-24 19:01:47,005 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-10-24 19:01:47,009 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-24 19:01:47,010 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-24 19:01:47,010 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-10-24 19:01:47,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:47,011 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:01:47,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:01:47,011 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-10-24 19:01:47,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:47,012 INFO L85 PathProgramCache]: Analyzing trace with hash -533648435, now seen corresponding path program 1 times [2024-10-24 19:01:47,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:47,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813392078] [2024-10-24 19:01:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:47,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:47,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813392078] [2024-10-24 19:01:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813392078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:01:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468281132] [2024-10-24 19:01:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:47,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:01:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:01:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:01:47,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-24 19:01:47,099 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-10-24 19:01:47,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:47,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-24 19:01:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:47,228 INFO L124 PetriNetUnfolderBase]: 603/1127 cut-off events. [2024-10-24 19:01:47,228 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-24 19:01:47,231 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-10-24 19:01:47,236 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-24 19:01:47,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-10-24 19:01:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:01:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:01:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-10-24 19:01:47,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-24 19:01:47,237 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-10-24 19:01:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-10-24 19:01:47,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:01:47,238 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-10-24 19:01:47,238 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-10-24 19:01:47,239 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-10-24 19:01:47,239 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-10-24 19:01:47,239 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-10-24 19:01:47,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:47,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:01:47,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:01:47,240 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-10-24 19:01:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash -533646914, now seen corresponding path program 1 times [2024-10-24 19:01:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034411903] [2024-10-24 19:01:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:47,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:47,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034411903] [2024-10-24 19:01:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034411903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:47,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:47,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:01:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910589560] [2024-10-24 19:01:47,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:47,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:01:47,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:01:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:01:47,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-24 19:01:47,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 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-10-24 19:01:47,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:47,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-24 19:01:47,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:47,820 INFO L124 PetriNetUnfolderBase]: 1361/2287 cut-off events. [2024-10-24 19:01:47,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:01:47,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4399 conditions, 2287 events. 1361/2287 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13680 event pairs, 147 based on Foata normal form. 80/2338 useless extension candidates. Maximal degree in co-relation 4393. Up to 1297 conditions per place. [2024-10-24 19:01:47,832 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-10-24 19:01:47,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 218 flow [2024-10-24 19:01:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:01:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:01:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-24 19:01:47,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-10-24 19:01:47,835 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 108 transitions. [2024-10-24 19:01:47,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 218 flow [2024-10-24 19:01:47,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:01:47,838 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2024-10-24 19:01:47,838 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=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-10-24 19:01:47,839 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-10-24 19:01:47,839 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2024-10-24 19:01:47,839 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-10-24 19:01:47,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:47,840 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-10-24 19:01:47,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:01:47,840 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-10-24 19:01:47,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash 709922759, now seen corresponding path program 1 times [2024-10-24 19:01:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197034928] [2024-10-24 19:01:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197034928] [2024-10-24 19:01:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197034928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:48,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:01:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135997272] [2024-10-24 19:01:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:48,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:01:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:48,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:01:48,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:01:48,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-24 19:01:48,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 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-10-24 19:01:48,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:48,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-24 19:01:48,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:48,307 INFO L124 PetriNetUnfolderBase]: 877/1503 cut-off events. [2024-10-24 19:01:48,307 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2024-10-24 19:01:48,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 1503 events. 877/1503 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8047 event pairs, 73 based on Foata normal form. 68/1549 useless extension candidates. Maximal degree in co-relation 3417. Up to 625 conditions per place. [2024-10-24 19:01:48,314 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-10-24 19:01:48,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 314 flow [2024-10-24 19:01:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:01:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:01:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-10-24 19:01:48,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-10-24 19:01:48,316 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 136 transitions. [2024-10-24 19:01:48,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 314 flow [2024-10-24 19:01:48,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 19:01:48,318 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2024-10-24 19:01:48,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-10-24 19:01:48,320 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-10-24 19:01:48,321 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2024-10-24 19:01:48,322 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-10-24 19:01:48,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:48,322 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-10-24 19:01:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:01:48,323 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-10-24 19:01:48,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2044561632, now seen corresponding path program 1 times [2024-10-24 19:01:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754039416] [2024-10-24 19:01:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754039416] [2024-10-24 19:01:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754039416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:01:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175556735] [2024-10-24 19:01:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:48,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:01:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:01:48,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:01:48,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-24 19:01:48,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 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-10-24 19:01:48,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:48,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-24 19:01:48,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:48,777 INFO L124 PetriNetUnfolderBase]: 489/831 cut-off events. [2024-10-24 19:01:48,778 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-10-24 19:01:48,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 831 events. 489/831 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3689 event pairs, 59 based on Foata normal form. 36/845 useless extension candidates. Maximal degree in co-relation 2153. Up to 268 conditions per place. [2024-10-24 19:01:48,782 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-10-24 19:01:48,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 325 flow [2024-10-24 19:01:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:01:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:01:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-10-24 19:01:48,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-10-24 19:01:48,785 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 148 transitions. [2024-10-24 19:01:48,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 325 flow [2024-10-24 19:01:48,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-24 19:01:48,792 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2024-10-24 19:01:48,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-10-24 19:01:48,793 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-10-24 19:01:48,794 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2024-10-24 19:01:48,794 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-10-24 19:01:48,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:48,794 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-10-24 19:01:48,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:01:48,795 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-10-24 19:01:48,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1622929970, now seen corresponding path program 1 times [2024-10-24 19:01:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:48,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332634878] [2024-10-24 19:01:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332634878] [2024-10-24 19:01:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332634878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:01:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753355564] [2024-10-24 19:01:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:50,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:01:50,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:50,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:01:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:01:50,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-10-24 19:01:50,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:01:50,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:50,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-10-24 19:01:50,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:50,625 INFO L124 PetriNetUnfolderBase]: 1640/2847 cut-off events. [2024-10-24 19:01:50,626 INFO L125 PetriNetUnfolderBase]: For 1254/1262 co-relation queries the response was YES. [2024-10-24 19:01:50,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6728 conditions, 2847 events. 1640/2847 cut-off events. For 1254/1262 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17132 event pairs, 323 based on Foata normal form. 8/2790 useless extension candidates. Maximal degree in co-relation 6716. Up to 847 conditions per place. [2024-10-24 19:01:50,637 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 52 selfloop transitions, 14 changer transitions 37/119 dead transitions. [2024-10-24 19:01:50,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 553 flow [2024-10-24 19:01:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 19:01:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 19:01:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-10-24 19:01:50,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5545454545454546 [2024-10-24 19:01:50,639 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 10 states and 244 transitions. [2024-10-24 19:01:50,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 553 flow [2024-10-24 19:01:50,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 119 transitions, 481 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-10-24 19:01:50,654 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 214 flow [2024-10-24 19:01:50,654 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-10-24 19:01:50,656 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-10-24 19:01:50,657 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 214 flow [2024-10-24 19:01:50,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:01:50,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:50,657 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-10-24 19:01:50,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:01:50,657 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-10-24 19:01:50,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash 31341628, now seen corresponding path program 2 times [2024-10-24 19:01:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541015294] [2024-10-24 19:01:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541015294] [2024-10-24 19:01:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541015294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:01:50,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886793617] [2024-10-24 19:01:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:01:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:01:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:01:50,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-24 19:01:50,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:01:50,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:50,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-24 19:01:50,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:51,144 INFO L124 PetriNetUnfolderBase]: 857/1558 cut-off events. [2024-10-24 19:01:51,144 INFO L125 PetriNetUnfolderBase]: For 1007/1132 co-relation queries the response was YES. [2024-10-24 19:01:51,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4212 conditions, 1558 events. 857/1558 cut-off events. For 1007/1132 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8743 event pairs, 212 based on Foata normal form. 9/1504 useless extension candidates. Maximal degree in co-relation 4196. Up to 713 conditions per place. [2024-10-24 19:01:51,152 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 36 selfloop transitions, 5 changer transitions 26/86 dead transitions. [2024-10-24 19:01:51,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 482 flow [2024-10-24 19:01:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:01:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:01:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-10-24 19:01:51,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2024-10-24 19:01:51,153 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 214 flow. Second operand 6 states and 146 transitions. [2024-10-24 19:01:51,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 482 flow [2024-10-24 19:01:51,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 446 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-10-24 19:01:51,155 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 197 flow [2024-10-24 19:01:51,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-10-24 19:01:51,156 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-10-24 19:01:51,157 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 197 flow [2024-10-24 19:01:51,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:01:51,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:51,158 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-10-24 19:01:51,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:01:51,159 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-10-24 19:01:51,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1150557946, now seen corresponding path program 3 times [2024-10-24 19:01:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548157085] [2024-10-24 19:01:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:51,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:01:51,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548157085] [2024-10-24 19:01:51,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548157085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:51,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:51,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 19:01:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227469563] [2024-10-24 19:01:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:51,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:01:51,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:01:51,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:01:51,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:01:51,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-24 19:01:51,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-10-24 19:01:51,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:51,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-24 19:01:51,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:51,807 INFO L124 PetriNetUnfolderBase]: 746/1384 cut-off events. [2024-10-24 19:01:51,807 INFO L125 PetriNetUnfolderBase]: For 744/752 co-relation queries the response was YES. [2024-10-24 19:01:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3654 conditions, 1384 events. 746/1384 cut-off events. For 744/752 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7469 event pairs, 180 based on Foata normal form. 16/1365 useless extension candidates. Maximal degree in co-relation 3637. Up to 408 conditions per place. [2024-10-24 19:01:51,813 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 35 selfloop transitions, 6 changer transitions 31/89 dead transitions. [2024-10-24 19:01:51,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 484 flow [2024-10-24 19:01:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:01:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:01:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-10-24 19:01:51,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142045454545454 [2024-10-24 19:01:51,814 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 197 flow. Second operand 8 states and 181 transitions. [2024-10-24 19:01:51,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 484 flow [2024-10-24 19:01:51,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 443 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-10-24 19:01:51,820 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 194 flow [2024-10-24 19:01:51,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-10-24 19:01:51,823 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-10-24 19:01:51,823 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 194 flow [2024-10-24 19:01:51,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-10-24 19:01:51,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:51,826 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-10-24 19:01:51,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:01:51,826 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-10-24 19:01:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash 104646518, now seen corresponding path program 4 times [2024-10-24 19:01:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:01:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037107736] [2024-10-24 19:01:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:51,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:01:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:01:51,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:01:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:01:52,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:01:52,015 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:01:52,018 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-24 19:01:52,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-24 19:01:52,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-24 19:01:52,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-24 19:01:52,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-24 19:01:52,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-24 19:01:52,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-24 19:01:52,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:01:52,023 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-24 19:01:52,104 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:01:52,104 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:01:52,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:01:52 BasicIcfg [2024-10-24 19:01:52,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:01:52,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:01:52,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:01:52,110 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:01:52,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:01:45" (3/4) ... [2024-10-24 19:01:52,112 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:01:52,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:01:52,116 INFO L158 Benchmark]: Toolchain (without parser) took 7395.66ms. Allocated memory was 230.7MB in the beginning and 427.8MB in the end (delta: 197.1MB). Free memory was 160.6MB in the beginning and 146.3MB in the end (delta: 14.4MB). Peak memory consumption was 213.2MB. Max. memory is 16.1GB. [2024-10-24 19:01:52,116 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:01:52,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.98ms. Allocated memory is still 230.7MB. Free memory was 160.3MB in the beginning and 134.9MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 19:01:52,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.33ms. Allocated memory is still 230.7MB. Free memory was 134.9MB in the beginning and 132.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:01:52,117 INFO L158 Benchmark]: Boogie Preprocessor took 76.71ms. Allocated memory is still 230.7MB. Free memory was 132.0MB in the beginning and 200.4MB in the end (delta: -68.4MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-24 19:01:52,117 INFO L158 Benchmark]: RCFGBuilder took 672.81ms. Allocated memory is still 230.7MB. Free memory was 200.4MB in the beginning and 146.0MB in the end (delta: 54.4MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-24 19:01:52,117 INFO L158 Benchmark]: TraceAbstraction took 6190.47ms. Allocated memory was 230.7MB in the beginning and 427.8MB in the end (delta: 197.1MB). Free memory was 146.0MB in the beginning and 146.3MB in the end (delta: -254.4kB). Peak memory consumption was 197.8MB. Max. memory is 16.1GB. [2024-10-24 19:01:52,117 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 427.8MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:01:52,123 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.17ms. Allocated memory is still 123.7MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.98ms. Allocated memory is still 230.7MB. Free memory was 160.3MB in the beginning and 134.9MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.33ms. Allocated memory is still 230.7MB. Free memory was 134.9MB in the beginning and 132.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.71ms. Allocated memory is still 230.7MB. Free memory was 132.0MB in the beginning and 200.4MB in the end (delta: -68.4MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * RCFGBuilder took 672.81ms. Allocated memory is still 230.7MB. Free memory was 200.4MB in the beginning and 146.0MB in the end (delta: 54.4MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6190.47ms. Allocated memory was 230.7MB in the beginning and 427.8MB in the end (delta: 197.1MB). Free memory was 146.0MB in the beginning and 146.3MB in the end (delta: -254.4kB). Peak memory consumption was 197.8MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 427.8MB. Free memory is still 146.3MB. 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_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-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] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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] [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_p0_EAX=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] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L793] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=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_p0_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=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_p0_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=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_p0_EAX=2, __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=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_p0_EAX=2, __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=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=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 && y == 2 && __unbuffered_p0_EAX == 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=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_p0_EAX=2, __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=2] [L17] 0 __assert_fail ("0", "safe001_power.opt_pso.oepc_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=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: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 916 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 12 mSDtfsCounter, 916 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-10-24 19:01:52,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:01:54,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:01:54,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:01:54,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:01:54,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:01:54,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:01:54,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:01:54,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:01:54,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:01:54,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:01:54,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:01:54,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:01:54,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:01:54,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:01:54,339 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:01:54,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:01:54,340 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:01:54,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:01:54,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:01:54,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:01:54,340 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:01:54,341 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:01:54,341 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:01:54,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:01:54,342 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:01:54,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:01:54,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:01:54,342 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:01:54,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:01:54,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:01:54,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:01:54,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:01:54,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:01:54,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:01:54,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:01:54,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:01:54,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:01:54,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:01:54,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:01:54,344 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:01:54,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:01:54,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:01:54,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:01:54,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:01:54,346 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:01:54,346 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2024-10-24 19:01:54,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:01:54,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:01:54,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:01:54,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:01:54,661 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:01:54,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-24 19:01:56,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:01:56,682 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:01:56,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-24 19:01:56,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a9efaf2/b26d319828cb49f6b9e6f11d9992d06b/FLAG5e55bb6c8 [2024-10-24 19:01:56,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a9efaf2/b26d319828cb49f6b9e6f11d9992d06b [2024-10-24 19:01:56,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:01:56,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:01:56,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:01:56,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:01:56,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:01:56,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:01:56" (1/1) ... [2024-10-24 19:01:56,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78584aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:56, skipping insertion in model container [2024-10-24 19:01:56,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:01:56" (1/1) ... [2024-10-24 19:01:56,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:01:57,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:01:57,103 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:01:57,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:01:57,195 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:01:57,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57 WrapperNode [2024-10-24 19:01:57,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:01:57,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:01:57,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:01:57,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:01:57,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,257 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-10-24 19:01:57,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:01:57,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:01:57,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:01:57,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:01:57,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,304 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-10-24 19:01:57,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:01:57,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:01:57,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:01:57,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:01:57,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (1/1) ... [2024-10-24 19:01:57,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:01:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:01:57,369 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-10-24 19:01:57,375 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-10-24 19:01:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:01:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:01:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:01:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 19:01:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 19:01:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 19:01:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 19:01:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 19:01:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 19:01:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:01:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:01:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:01:57,426 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:01:57,553 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:01:57,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:01:57,883 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:01:57,884 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:01:58,124 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:01:58,124 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:01:58,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:01:58 BoogieIcfgContainer [2024-10-24 19:01:58,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:01:58,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:01:58,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:01:58,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:01:58,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:01:56" (1/3) ... [2024-10-24 19:01:58,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335c829c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:01:58, skipping insertion in model container [2024-10-24 19:01:58,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:01:57" (2/3) ... [2024-10-24 19:01:58,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335c829c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:01:58, skipping insertion in model container [2024-10-24 19:01:58,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:01:58" (3/3) ... [2024-10-24 19:01:58,132 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-24 19:01:58,146 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:01:58,146 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-24 19:01:58,146 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:01:58,196 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:01:58,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-24 19:01:58,262 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-24 19:01:58,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:01:58,265 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-10-24 19:01:58,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-24 19:01:58,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-24 19:01:58,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:01:58,281 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;@501f1bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:01:58,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 19:01:58,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:01:58,286 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-24 19:01:58,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:01:58,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:58,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:01:58,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 19:01:58,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1353053513, now seen corresponding path program 1 times [2024-10-24 19:01:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:01:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636089431] [2024-10-24 19:01:58,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:58,302 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-10-24 19:01:58,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:01:58,307 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-10-24 19:01:58,314 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-10-24 19:01:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:58,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:01:58,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:01:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:58,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:01:58,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:01:58,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636089431] [2024-10-24 19:01:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636089431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:01:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743445502] [2024-10-24 19:01:58,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:58,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:01:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:01:58,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:01:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:01:58,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-24 19:01:58,474 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-10-24 19:01:58,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:58,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-24 19:01:58,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:58,761 INFO L124 PetriNetUnfolderBase]: 678/1271 cut-off events. [2024-10-24 19:01:58,762 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-24 19:01:58,765 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-10-24 19:01:58,771 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-10-24 19:01:58,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 184 flow [2024-10-24 19:01:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:01:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:01:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-10-24 19:01:58,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-10-24 19:01:58,797 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-10-24 19:01:58,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 184 flow [2024-10-24 19:01:58,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:01:58,801 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-24 19:01:58,803 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-10-24 19:01:58,806 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-24 19:01:58,806 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-24 19:01:58,807 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-10-24 19:01:58,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:58,807 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:01:58,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 19:01:59,009 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-10-24 19:01:59,010 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-10-24 19:01:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1234145807, now seen corresponding path program 1 times [2024-10-24 19:01:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:01:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031396893] [2024-10-24 19:01:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:59,012 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-10-24 19:01:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:01:59,015 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-10-24 19:01:59,016 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-10-24 19:01:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:59,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:01:59,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:01:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:59,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:01:59,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:01:59,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031396893] [2024-10-24 19:01:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031396893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:59,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:01:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400160957] [2024-10-24 19:01:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:59,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:01:59,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:01:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:01:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:01:59,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-24 19:01:59,136 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-10-24 19:01:59,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:59,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-24 19:01:59,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:01:59,477 INFO L124 PetriNetUnfolderBase]: 1509/2571 cut-off events. [2024-10-24 19:01:59,477 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-10-24 19:01:59,480 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-10-24 19:01:59,488 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-10-24 19:01:59,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 230 flow [2024-10-24 19:01:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:01:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:01:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-24 19:01:59,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-10-24 19:01:59,490 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 109 transitions. [2024-10-24 19:01:59,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 230 flow [2024-10-24 19:01:59,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:01:59,492 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-10-24 19:01:59,493 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-10-24 19:01:59,493 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-24 19:01:59,494 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-10-24 19:01:59,494 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-10-24 19:01:59,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:01:59,494 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-10-24 19:01:59,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 19:01:59,694 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-10-24 19:01:59,696 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-10-24 19:01:59,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:01:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1768737622, now seen corresponding path program 1 times [2024-10-24 19:01:59,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:01:59,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187092003] [2024-10-24 19:01:59,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:01:59,697 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-10-24 19:01:59,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:01:59,702 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-10-24 19:01:59,705 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-10-24 19:01:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:01:59,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:01:59,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:01:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:01:59,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:01:59,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:01:59,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187092003] [2024-10-24 19:01:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187092003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:01:59,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:01:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:01:59,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760521156] [2024-10-24 19:01:59,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:01:59,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:01:59,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:01:59,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:01:59,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:01:59,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-24 19:01:59,852 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-10-24 19:01:59,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:01:59,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-24 19:01:59,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:00,115 INFO L124 PetriNetUnfolderBase]: 945/1643 cut-off events. [2024-10-24 19:02:00,116 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2024-10-24 19:02:00,119 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-10-24 19:02:00,124 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-10-24 19:02:00,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2024-10-24 19:02:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:02:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:02:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-10-24 19:02:00,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-24 19:02:00,128 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 137 transitions. [2024-10-24 19:02:00,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2024-10-24 19:02:00,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 19:02:00,132 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-10-24 19:02:00,132 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-10-24 19:02:00,133 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-10-24 19:02:00,133 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-10-24 19:02:00,133 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-10-24 19:02:00,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:00,133 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-10-24 19:02:00,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 19:02:00,339 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-10-24 19:02:00,340 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-10-24 19:02:00,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1577770993, now seen corresponding path program 1 times [2024-10-24 19:02:00,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075983052] [2024-10-24 19:02:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:00,344 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-10-24 19:02:00,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:00,346 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-10-24 19:02:00,348 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-10-24 19:02:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:00,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:02:00,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:00,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:00,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:00,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075983052] [2024-10-24 19:02:00,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075983052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:00,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:00,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139847710] [2024-10-24 19:02:00,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:00,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:00,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:00,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-24 19:02:00,484 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-10-24 19:02:00,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:00,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-24 19:02:00,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:00,691 INFO L124 PetriNetUnfolderBase]: 501/859 cut-off events. [2024-10-24 19:02:00,691 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-10-24 19:02:00,692 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-10-24 19:02:00,694 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-10-24 19:02:00,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 330 flow [2024-10-24 19:02:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-24 19:02:00,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-10-24 19:02:00,696 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 149 transitions. [2024-10-24 19:02:00,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 330 flow [2024-10-24 19:02:00,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-24 19:02:00,699 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-10-24 19:02:00,699 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-10-24 19:02:00,700 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-10-24 19:02:00,700 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-10-24 19:02:00,700 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-10-24 19:02:00,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:00,700 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-10-24 19:02:00,706 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 19:02:00,903 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-10-24 19:02:00,904 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-10-24 19:02:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash -957906943, now seen corresponding path program 1 times [2024-10-24 19:02:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:00,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958177056] [2024-10-24 19:02:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:00,905 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-10-24 19:02:00,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:00,908 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-10-24 19:02:00,909 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-10-24 19:02:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:00,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:02:00,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:01,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:01,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958177056] [2024-10-24 19:02:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958177056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445608659] [2024-10-24 19:02:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:01,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-24 19:02:01,017 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-10-24 19:02:01,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:01,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-24 19:02:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:01,072 INFO L124 PetriNetUnfolderBase]: 259/537 cut-off events. [2024-10-24 19:02:01,073 INFO L125 PetriNetUnfolderBase]: For 161/167 co-relation queries the response was YES. [2024-10-24 19:02:01,074 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-10-24 19:02:01,075 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-24 19:02:01,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 204 flow [2024-10-24 19:02:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-10-24 19:02:01,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-24 19:02:01,076 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 75 transitions. [2024-10-24 19:02:01,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 204 flow [2024-10-24 19:02:01,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-24 19:02:01,078 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-10-24 19:02:01,078 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-10-24 19:02:01,078 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-24 19:02:01,079 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-10-24 19:02:01,079 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-10-24 19:02:01,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:01,079 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-10-24 19:02:01,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 19:02:01,279 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-10-24 19:02:01,280 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-10-24 19:02:01,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1411664126, now seen corresponding path program 1 times [2024-10-24 19:02:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:01,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993440873] [2024-10-24 19:02:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:01,282 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-10-24 19:02:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:01,285 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-10-24 19:02:01,286 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-10-24 19:02:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:01,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:02:01,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:01,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:01,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993440873] [2024-10-24 19:02:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993440873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:01,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:01,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461500429] [2024-10-24 19:02:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:01,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:01,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:01,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:01,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:01,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-24 19:02:01,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:02:01,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:01,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-24 19:02:01,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:01,861 INFO L124 PetriNetUnfolderBase]: 804/1501 cut-off events. [2024-10-24 19:02:01,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:01,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2975 conditions, 1501 events. 804/1501 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8381 event pairs, 195 based on Foata normal form. 8/1460 useless extension candidates. Maximal degree in co-relation 2968. Up to 543 conditions per place. [2024-10-24 19:02:01,867 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 34 selfloop transitions, 4 changer transitions 15/71 dead transitions. [2024-10-24 19:02:01,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 280 flow [2024-10-24 19:02:01,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-10-24 19:02:01,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-24 19:02:01,870 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 6 states and 150 transitions. [2024-10-24 19:02:01,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 280 flow [2024-10-24 19:02:01,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:02:01,872 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 135 flow [2024-10-24 19:02:01,872 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-10-24 19:02:01,873 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-10-24 19:02:01,874 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 135 flow [2024-10-24 19:02:01,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:02:01,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:01,874 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-10-24 19:02:01,878 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-10-24 19:02:02,074 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-10-24 19:02:02,075 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-10-24 19:02:02,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1954507912, now seen corresponding path program 2 times [2024-10-24 19:02:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786991744] [2024-10-24 19:02:02,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:02:02,078 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-10-24 19:02:02,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:02,080 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-10-24 19:02:02,081 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-10-24 19:02:02,146 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:02:02,146 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:02:02,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:02:02,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:02,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:02,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786991744] [2024-10-24 19:02:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786991744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:02,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125441665] [2024-10-24 19:02:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:02,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:02,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-24 19:02:02,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:02:02,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:02,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-24 19:02:02,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:02,552 INFO L124 PetriNetUnfolderBase]: 587/1098 cut-off events. [2024-10-24 19:02:02,552 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-24 19:02:02,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 1098 events. 587/1098 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5833 event pairs, 179 based on Foata normal form. 8/1043 useless extension candidates. Maximal degree in co-relation 2298. Up to 472 conditions per place. [2024-10-24 19:02:02,557 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 27 selfloop transitions, 3 changer transitions 17/65 dead transitions. [2024-10-24 19:02:02,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 283 flow [2024-10-24 19:02:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-10-24 19:02:02,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-10-24 19:02:02,559 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 135 flow. Second operand 6 states and 144 transitions. [2024-10-24 19:02:02,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 283 flow [2024-10-24 19:02:02,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 268 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-24 19:02:02,560 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 129 flow [2024-10-24 19:02:02,561 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=129, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2024-10-24 19:02:02,561 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2024-10-24 19:02:02,561 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 129 flow [2024-10-24 19:02:02,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:02:02,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:02,562 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-10-24 19:02:02,569 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-10-24 19:02:02,762 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-10-24 19:02:02,763 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-10-24 19:02:02,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash 898324282, now seen corresponding path program 3 times [2024-10-24 19:02:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533888782] [2024-10-24 19:02:02,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:02:02,764 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-10-24 19:02:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:02,767 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-10-24 19:02:02,768 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-10-24 19:02:02,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-24 19:02:02,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:02:02,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:02:02,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:02,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:02,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:02,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533888782] [2024-10-24 19:02:02,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533888782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:02,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:02,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:02:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421753695] [2024-10-24 19:02:02,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:02,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:02,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-24 19:02:02,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:02:02,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:02,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-24 19:02:02,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:03,085 INFO L124 PetriNetUnfolderBase]: 480/939 cut-off events. [2024-10-24 19:02:03,085 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-10-24 19:02:03,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 939 events. 480/939 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4639 event pairs, 141 based on Foata normal form. 8/920 useless extension candidates. Maximal degree in co-relation 1916. Up to 349 conditions per place. [2024-10-24 19:02:03,089 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 25 selfloop transitions, 2 changer transitions 26/71 dead transitions. [2024-10-24 19:02:03,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 308 flow [2024-10-24 19:02:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:02:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:02:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-10-24 19:02:03,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-10-24 19:02:03,090 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 129 flow. Second operand 7 states and 166 transitions. [2024-10-24 19:02:03,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 308 flow [2024-10-24 19:02:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 284 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-10-24 19:02:03,092 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 125 flow [2024-10-24 19:02:03,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=7, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-10-24 19:02:03,092 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-10-24 19:02:03,092 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 125 flow [2024-10-24 19:02:03,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-24 19:02:03,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:03,093 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-10-24 19:02:03,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 19:02:03,296 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-10-24 19:02:03,297 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-10-24 19:02:03,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash 853654282, now seen corresponding path program 4 times [2024-10-24 19:02:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909320960] [2024-10-24 19:02:03,298 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 19:02:03,298 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-10-24 19:02:03,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:03,300 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-10-24 19:02:03,304 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-10-24 19:02:03,361 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 19:02:03,362 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:02:03,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 19:02:03,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:03,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:03,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909320960] [2024-10-24 19:02:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909320960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:02:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721961874] [2024-10-24 19:02:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:03,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 19:02:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 19:02:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:02:03,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-24 19:02:03,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:03,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:03,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-24 19:02:03,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:03,732 INFO L124 PetriNetUnfolderBase]: 504/1021 cut-off events. [2024-10-24 19:02:03,732 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-24 19:02:03,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1021 events. 504/1021 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5427 event pairs, 257 based on Foata normal form. 8/987 useless extension candidates. Maximal degree in co-relation 2051. Up to 297 conditions per place. [2024-10-24 19:02:03,738 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 33 selfloop transitions, 5 changer transitions 17/75 dead transitions. [2024-10-24 19:02:03,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 317 flow [2024-10-24 19:02:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:02:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:02:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-10-24 19:02:03,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-10-24 19:02:03,739 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 125 flow. Second operand 7 states and 182 transitions. [2024-10-24 19:02:03,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 317 flow [2024-10-24 19:02:03,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 297 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-10-24 19:02:03,742 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 152 flow [2024-10-24 19:02:03,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2024-10-24 19:02:03,742 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-10-24 19:02:03,743 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 152 flow [2024-10-24 19:02:03,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:03,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:03,743 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-10-24 19:02:03,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 19:02:03,944 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-10-24 19:02:03,944 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-10-24 19:02:03,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -427241188, now seen corresponding path program 5 times [2024-10-24 19:02:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396194735] [2024-10-24 19:02:03,945 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 19:02:03,945 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-10-24 19:02:03,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:03,948 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:03,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 19:02:04,012 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:02:04,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-24 19:02:04,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:02:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:02:04,092 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 19:02:04,092 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:02:04,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-24 19:02:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-24 19:02:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-24 19:02:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-24 19:02:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-24 19:02:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-24 19:02:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-24 19:02:04,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 19:02:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:04,299 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-10-24 19:02:04,375 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:02:04,375 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:02:04,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:02:04 BasicIcfg [2024-10-24 19:02:04,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:02:04,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:02:04,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:02:04,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:02:04,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:01:58" (3/4) ... [2024-10-24 19:02:04,389 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:02:04,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:02:04,390 INFO L158 Benchmark]: Toolchain (without parser) took 7668.38ms. Allocated memory was 58.7MB in the beginning and 285.2MB in the end (delta: 226.5MB). Free memory was 34.5MB in the beginning and 112.2MB in the end (delta: -77.7MB). Peak memory consumption was 151.9MB. Max. memory is 16.1GB. [2024-10-24 19:02:04,390 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 58.7MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:02:04,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.07ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 34.3MB in the beginning and 46.8MB in the end (delta: -12.5MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-24 19:02:04,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.22ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 44.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:02:04,390 INFO L158 Benchmark]: Boogie Preprocessor took 70.68ms. Allocated memory is still 81.8MB. Free memory was 43.8MB in the beginning and 40.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:02:04,391 INFO L158 Benchmark]: RCFGBuilder took 788.75ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 45.2MB in the end (delta: -4.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-24 19:02:04,391 INFO L158 Benchmark]: TraceAbstraction took 6256.36ms. Allocated memory was 81.8MB in the beginning and 285.2MB in the end (delta: 203.4MB). Free memory was 44.7MB in the beginning and 112.2MB in the end (delta: -67.6MB). Peak memory consumption was 135.3MB. Max. memory is 16.1GB. [2024-10-24 19:02:04,391 INFO L158 Benchmark]: Witness Printer took 6.37ms. Allocated memory is still 285.2MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:02:04,396 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.24ms. Allocated memory is still 58.7MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.07ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 34.3MB in the beginning and 46.8MB in the end (delta: -12.5MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.22ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 44.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.68ms. Allocated memory is still 81.8MB. Free memory was 43.8MB in the beginning and 40.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 788.75ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 45.2MB in the end (delta: -4.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6256.36ms. Allocated memory was 81.8MB in the beginning and 285.2MB in the end (delta: 203.4MB). Free memory was 44.7MB in the beginning and 112.2MB in the end (delta: -67.6MB). Peak memory consumption was 135.3MB. Max. memory is 16.1GB. * Witness Printer took 6.37ms. Allocated memory is still 285.2MB. Free memory is still 112.2MB. 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_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=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] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=0, t1805=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] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=0, t1805=1, t1806=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [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_p0_EAX=0, __unbuffered_p2_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L793] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=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_p0_EAX=2, __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=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_p0_EAX=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=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_p0_EAX=2, __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=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=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=2, __unbuffered_p0_EAX=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=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=0, t1805=1, t1806=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=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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=0, t1805=1, t1806=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=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 && y == 2 && __unbuffered_p0_EAX == 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=0, t1805=1, t1806=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=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_p0_EAX=2, __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=2] [L17] 0 __assert_fail ("0", "safe001_power.opt_pso.oepc_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=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: 6.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 302 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 22 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 47, 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.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 246 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 663 SizeOfPredicates, 17 NumberOfNonLiveVariables, 981 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-10-24 19:02:04,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample