./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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:33:19,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:33:19,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:33:19,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:33:19,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:33:19,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:33:19,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:33:19,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:33:19,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:33:19,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:33:19,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:33:19,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:33:19,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:33:19,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:33:19,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:33:19,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:33:19,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:33:19,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:33:19,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:33:19,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:33:19,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:33:19,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:33:19,326 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:33:19,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:33:19,326 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:33:19,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:33:19,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:33:19,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:33:19,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:33:19,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:33:19,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:33:19,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:33:19,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:33:19,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:33:19,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:33:19,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:33:19,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:33:19,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:33:19,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:33:19,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:33:19,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:33:19,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:33:19,331 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-10-14 19:33:19,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:33:19,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:33:19,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:33:19,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:33:19,583 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:33:19,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:33:20,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:33:21,169 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:33:21,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:33:21,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a76ab42d/178016689dbf48558bc6447aca7c75ae/FLAG8ed1075da [2024-10-14 19:33:21,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a76ab42d/178016689dbf48558bc6447aca7c75ae [2024-10-14 19:33:21,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:33:21,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:33:21,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:33:21,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:33:21,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:33:21,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:21,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d73aff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21, skipping insertion in model container [2024-10-14 19:33:21,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:21,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:33:21,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:33:21,819 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:33:21,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:33:21,905 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:33:21,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21 WrapperNode [2024-10-14 19:33:21,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:33:21,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:33:21,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:33:21,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:33:21,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:21,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:21,966 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-10-14 19:33:21,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:33:21,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:33:21,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:33:21,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:33:21,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:21,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:21,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,009 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-14 19:33:22,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:33:22,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:33:22,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:33:22,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:33:22,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (1/1) ... [2024-10-14 19:33:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:33:22,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:33:22,062 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-14 19:33:22,073 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-14 19:33:22,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:33:22,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:33:22,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:33:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:33:22,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:33:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:33:22,107 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:33:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:33:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:33:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:33:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:33:22,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:33:22,109 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:33:22,209 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:33:22,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:33:22,587 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:33:22,587 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:33:22,887 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:33:22,887 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:33:22,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:33:22 BoogieIcfgContainer [2024-10-14 19:33:22,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:33:22,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:33:22,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:33:22,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:33:22,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:33:21" (1/3) ... [2024-10-14 19:33:22,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7c9b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:33:22, skipping insertion in model container [2024-10-14 19:33:22,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:21" (2/3) ... [2024-10-14 19:33:22,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7c9b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:33:22, skipping insertion in model container [2024-10-14 19:33:22,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:33:22" (3/3) ... [2024-10-14 19:33:22,903 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:33:22,924 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:33:22,929 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:33:22,929 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:33:23,029 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:33:23,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:33:23,126 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-14 19:33:23,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:23,133 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 76 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-14 19:33:23,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:33:23,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-14 19:33:23,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:33:23,166 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;@1c9940c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:33:23,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:33:23,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:33:23,176 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-14 19:33:23,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:23,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:23,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:23,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:23,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -655888620, now seen corresponding path program 1 times [2024-10-14 19:33:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766923848] [2024-10-14 19:33:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:23,588 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-14 19:33:23,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:23,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766923848] [2024-10-14 19:33:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766923848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:33:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723676078] [2024-10-14 19:33:23,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:23,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:33:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:33:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:33:23,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-10-14 19:33:23,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 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-14 19:33:23,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:23,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-10-14 19:33:23,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:23,848 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-10-14 19:33:23,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:23,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-10-14 19:33:23,855 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-10-14 19:33:23,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-10-14 19:33:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:33:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:33:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-14 19:33:23,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-10-14 19:33:23,869 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-10-14 19:33:23,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-10-14 19:33:23,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:33:23,875 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-14 19:33:23,877 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-14 19:33:23,881 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-14 19:33:23,882 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-14 19:33:23,882 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-14 19:33:23,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:23,882 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:23,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:33:23,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 560481029, now seen corresponding path program 1 times [2024-10-14 19:33:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209361668] [2024-10-14 19:33:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:33:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:23,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209361668] [2024-10-14 19:33:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209361668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:33:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690687965] [2024-10-14 19:33:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:33:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:33:23,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:33:24,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-14 19:33:24,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-14 19:33:24,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:24,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-14 19:33:24,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:24,130 INFO L124 PetriNetUnfolderBase]: 361/697 cut-off events. [2024-10-14 19:33:24,130 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-14 19:33:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 697 events. 361/697 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4744 event pairs, 361 based on Foata normal form. 24/696 useless extension candidates. Maximal degree in co-relation 1327. Up to 570 conditions per place. [2024-10-14 19:33:24,135 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-14 19:33:24,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 118 flow [2024-10-14 19:33:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:33:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:33:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-10-14 19:33:24,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-14 19:33:24,137 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 77 transitions. [2024-10-14 19:33:24,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 118 flow [2024-10-14 19:33:24,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:33:24,138 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-10-14 19:33:24,139 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-14 19:33:24,139 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-10-14 19:33:24,139 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-10-14 19:33:24,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-14 19:33:24,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:24,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:24,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:33:24,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 560482423, now seen corresponding path program 1 times [2024-10-14 19:33:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314988454] [2024-10-14 19:33:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:24,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:24,330 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-14 19:33:24,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:24,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314988454] [2024-10-14 19:33:24,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314988454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:24,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:24,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:33:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273125881] [2024-10-14 19:33:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:24,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:33:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:24,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:33:24,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:33:24,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-14 19:33:24,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:24,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:24,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-14 19:33:24,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:24,639 INFO L124 PetriNetUnfolderBase]: 1047/1956 cut-off events. [2024-10-14 19:33:24,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:24,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1956 events. 1047/1956 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12986 event pairs, 255 based on Foata normal form. 0/1885 useless extension candidates. Maximal degree in co-relation 3576. Up to 1012 conditions per place. [2024-10-14 19:33:24,647 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 29 selfloop transitions, 3 changer transitions 40/85 dead transitions. [2024-10-14 19:33:24,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 326 flow [2024-10-14 19:33:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:33:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:33:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-10-14 19:33:24,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5965909090909091 [2024-10-14 19:33:24,650 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 210 transitions. [2024-10-14 19:33:24,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 326 flow [2024-10-14 19:33:24,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:33:24,652 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 108 flow [2024-10-14 19:33:24,652 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-10-14 19:33:24,653 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-10-14 19:33:24,653 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 108 flow [2024-10-14 19:33:24,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:24,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:24,653 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:24,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:33:24,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:24,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1020262390, now seen corresponding path program 1 times [2024-10-14 19:33:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196473259] [2024-10-14 19:33:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:25,491 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-14 19:33:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196473259] [2024-10-14 19:33:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196473259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:25,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:25,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:33:25,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078339268] [2024-10-14 19:33:25,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:25,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:33:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:33:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:33:25,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:33:25,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-14 19:33:25,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:25,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:33:25,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:26,396 INFO L124 PetriNetUnfolderBase]: 2043/3634 cut-off events. [2024-10-14 19:33:26,396 INFO L125 PetriNetUnfolderBase]: For 2302/2302 co-relation queries the response was YES. [2024-10-14 19:33:26,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8614 conditions, 3634 events. 2043/3634 cut-off events. For 2302/2302 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 25604 event pairs, 275 based on Foata normal form. 113/3740 useless extension candidates. Maximal degree in co-relation 8602. Up to 1617 conditions per place. [2024-10-14 19:33:26,413 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 43 selfloop transitions, 12 changer transitions 55/121 dead transitions. [2024-10-14 19:33:26,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 636 flow [2024-10-14 19:33:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:33:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 19:33:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2024-10-14 19:33:26,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5840909090909091 [2024-10-14 19:33:26,416 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 108 flow. Second operand 10 states and 257 transitions. [2024-10-14 19:33:26,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 636 flow [2024-10-14 19:33:26,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 615 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-10-14 19:33:26,435 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 247 flow [2024-10-14 19:33:26,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-10-14 19:33:26,437 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-10-14 19:33:26,437 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 247 flow [2024-10-14 19:33:26,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-14 19:33:26,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:26,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:33:26,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1934505525, now seen corresponding path program 1 times [2024-10-14 19:33:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:26,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460256189] [2024-10-14 19:33:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:26,971 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-14 19:33:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:26,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460256189] [2024-10-14 19:33:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460256189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:26,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:26,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:33:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268962014] [2024-10-14 19:33:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:26,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:33:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:33:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:33:26,976 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-14 19:33:26,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-14 19:33:26,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:26,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-14 19:33:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:27,407 INFO L124 PetriNetUnfolderBase]: 1445/2807 cut-off events. [2024-10-14 19:33:27,408 INFO L125 PetriNetUnfolderBase]: For 6760/6781 co-relation queries the response was YES. [2024-10-14 19:33:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 2807 events. 1445/2807 cut-off events. For 6760/6781 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20580 event pairs, 360 based on Foata normal form. 78/2789 useless extension candidates. Maximal degree in co-relation 9331. Up to 1475 conditions per place. [2024-10-14 19:33:27,425 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 4 changer transitions 29/83 dead transitions. [2024-10-14 19:33:27,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 555 flow [2024-10-14 19:33:27,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:33:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:33:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-10-14 19:33:27,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-14 19:33:27,426 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 247 flow. Second operand 7 states and 175 transitions. [2024-10-14 19:33:27,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 555 flow [2024-10-14 19:33:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 543 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-10-14 19:33:27,441 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 261 flow [2024-10-14 19:33:27,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2024-10-14 19:33:27,441 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-10-14 19:33:27,441 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 261 flow [2024-10-14 19:33:27,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-14 19:33:27,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:27,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:33:27,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:27,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1084705576, now seen corresponding path program 1 times [2024-10-14 19:33:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600769264] [2024-10-14 19:33:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:27,590 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-14 19:33:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:27,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600769264] [2024-10-14 19:33:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600769264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:27,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:33:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017204247] [2024-10-14 19:33:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:27,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:33:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:33:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:33:27,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:33:27,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:27,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:27,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:33:27,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:28,049 INFO L124 PetriNetUnfolderBase]: 2747/4642 cut-off events. [2024-10-14 19:33:28,049 INFO L125 PetriNetUnfolderBase]: For 8356/8657 co-relation queries the response was YES. [2024-10-14 19:33:28,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14169 conditions, 4642 events. 2747/4642 cut-off events. For 8356/8657 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30640 event pairs, 444 based on Foata normal form. 205/4677 useless extension candidates. Maximal degree in co-relation 14144. Up to 2523 conditions per place. [2024-10-14 19:33:28,079 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-10-14 19:33:28,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 513 flow [2024-10-14 19:33:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:33:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:33:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-14 19:33:28,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-10-14 19:33:28,081 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 261 flow. Second operand 4 states and 109 transitions. [2024-10-14 19:33:28,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 513 flow [2024-10-14 19:33:28,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 485 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-10-14 19:33:28,094 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 283 flow [2024-10-14 19:33:28,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-10-14 19:33:28,095 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-10-14 19:33:28,095 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 283 flow [2024-10-14 19:33:28,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:28,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:28,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:33:28,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:28,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1960827456, now seen corresponding path program 1 times [2024-10-14 19:33:28,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961429923] [2024-10-14 19:33:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:28,254 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-14 19:33:28,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:28,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961429923] [2024-10-14 19:33:28,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961429923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:28,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:33:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539389340] [2024-10-14 19:33:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:28,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:33:28,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:33:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:33:28,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-14 19:33:28,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-14 19:33:28,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:28,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-14 19:33:28,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:28,909 INFO L124 PetriNetUnfolderBase]: 2768/5123 cut-off events. [2024-10-14 19:33:28,910 INFO L125 PetriNetUnfolderBase]: For 9376/9573 co-relation queries the response was YES. [2024-10-14 19:33:28,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16879 conditions, 5123 events. 2768/5123 cut-off events. For 9376/9573 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38652 event pairs, 900 based on Foata normal form. 151/4940 useless extension candidates. Maximal degree in co-relation 16856. Up to 1814 conditions per place. [2024-10-14 19:33:28,946 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 10 changer transitions 18/94 dead transitions. [2024-10-14 19:33:28,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 668 flow [2024-10-14 19:33:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:33:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:33:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-10-14 19:33:28,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-10-14 19:33:28,948 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 283 flow. Second operand 7 states and 182 transitions. [2024-10-14 19:33:28,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 668 flow [2024-10-14 19:33:28,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 658 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-10-14 19:33:28,955 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 362 flow [2024-10-14 19:33:28,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-10-14 19:33:28,956 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2024-10-14 19:33:28,957 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 362 flow [2024-10-14 19:33:28,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-14 19:33:28,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:28,957 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:28,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:33:28,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:28,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1523089990, now seen corresponding path program 1 times [2024-10-14 19:33:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054934369] [2024-10-14 19:33:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:29,545 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-14 19:33:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054934369] [2024-10-14 19:33:29,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054934369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:29,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:29,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:33:29,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662779728] [2024-10-14 19:33:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:29,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:33:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:33:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:33:29,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-14 19:33:29,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 362 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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-14 19:33:29,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:29,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-14 19:33:29,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:30,406 INFO L124 PetriNetUnfolderBase]: 3143/5863 cut-off events. [2024-10-14 19:33:30,406 INFO L125 PetriNetUnfolderBase]: For 15744/16010 co-relation queries the response was YES. [2024-10-14 19:33:30,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20534 conditions, 5863 events. 3143/5863 cut-off events. For 15744/16010 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 45925 event pairs, 1024 based on Foata normal form. 146/5677 useless extension candidates. Maximal degree in co-relation 20506. Up to 3253 conditions per place. [2024-10-14 19:33:30,440 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 47 selfloop transitions, 14 changer transitions 17/104 dead transitions. [2024-10-14 19:33:30,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 794 flow [2024-10-14 19:33:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 19:33:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 19:33:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-10-14 19:33:30,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-14 19:33:30,441 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 362 flow. Second operand 9 states and 225 transitions. [2024-10-14 19:33:30,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 794 flow [2024-10-14 19:33:30,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 104 transitions, 765 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-10-14 19:33:30,472 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 493 flow [2024-10-14 19:33:30,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-10-14 19:33:30,473 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-10-14 19:33:30,473 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 493 flow [2024-10-14 19:33:30,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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-14 19:33:30,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:30,474 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:30,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:33:30,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:30,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash 999921068, now seen corresponding path program 2 times [2024-10-14 19:33:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:30,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573948154] [2024-10-14 19:33:30,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:30,610 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-14 19:33:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573948154] [2024-10-14 19:33:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573948154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:30,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:33:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150365313] [2024-10-14 19:33:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:30,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:33:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:33:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:33:30,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:33:30,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 493 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-14 19:33:30,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:30,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:33:30,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:31,139 INFO L124 PetriNetUnfolderBase]: 3176/5214 cut-off events. [2024-10-14 19:33:31,139 INFO L125 PetriNetUnfolderBase]: For 18781/19828 co-relation queries the response was YES. [2024-10-14 19:33:31,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19524 conditions, 5214 events. 3176/5214 cut-off events. For 18781/19828 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33739 event pairs, 247 based on Foata normal form. 362/5343 useless extension candidates. Maximal degree in co-relation 19490. Up to 1893 conditions per place. [2024-10-14 19:33:31,167 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 63 selfloop transitions, 8 changer transitions 22/111 dead transitions. [2024-10-14 19:33:31,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 1012 flow [2024-10-14 19:33:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:33:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:33:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-10-14 19:33:31,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-10-14 19:33:31,170 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 493 flow. Second operand 5 states and 138 transitions. [2024-10-14 19:33:31,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 1012 flow [2024-10-14 19:33:31,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 970 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-10-14 19:33:31,200 INFO L231 Difference]: Finished difference. Result has 87 places, 55 transitions, 386 flow [2024-10-14 19:33:31,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=87, PETRI_TRANSITIONS=55} [2024-10-14 19:33:31,201 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-10-14 19:33:31,201 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 55 transitions, 386 flow [2024-10-14 19:33:31,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-14 19:33:31,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:31,202 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-14 19:33:31,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:33:31,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:31,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1178824607, now seen corresponding path program 1 times [2024-10-14 19:33:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245010275] [2024-10-14 19:33:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:31,416 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-14 19:33:31,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245010275] [2024-10-14 19:33:31,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245010275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:31,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:31,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:33:31,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750483111] [2024-10-14 19:33:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:31,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:33:31,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:31,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:33:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:33:31,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:33:31,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 55 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-14 19:33:31,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:31,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:33:31,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:31,791 INFO L124 PetriNetUnfolderBase]: 2192/3650 cut-off events. [2024-10-14 19:33:31,791 INFO L125 PetriNetUnfolderBase]: For 15253/16678 co-relation queries the response was YES. [2024-10-14 19:33:31,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 3650 events. 2192/3650 cut-off events. For 15253/16678 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 23871 event pairs, 197 based on Foata normal form. 265/3714 useless extension candidates. Maximal degree in co-relation 14682. Up to 1616 conditions per place. [2024-10-14 19:33:31,806 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 57 selfloop transitions, 11 changer transitions 6/90 dead transitions. [2024-10-14 19:33:31,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 740 flow [2024-10-14 19:33:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:33:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:33:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-10-14 19:33:31,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2024-10-14 19:33:31,807 INFO L175 Difference]: Start difference. First operand has 87 places, 55 transitions, 386 flow. Second operand 6 states and 153 transitions. [2024-10-14 19:33:31,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 740 flow [2024-10-14 19:33:31,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 662 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-10-14 19:33:31,818 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 342 flow [2024-10-14 19:33:31,818 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2024-10-14 19:33:31,819 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2024-10-14 19:33:31,819 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 342 flow [2024-10-14 19:33:31,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-14 19:33:31,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:31,819 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-14 19:33:31,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 19:33:31,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:31,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 826938328, now seen corresponding path program 1 times [2024-10-14 19:33:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289216504] [2024-10-14 19:33:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:31,986 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-14 19:33:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:31,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289216504] [2024-10-14 19:33:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289216504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:31,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:33:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367256503] [2024-10-14 19:33:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:31,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:33:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:31,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:33:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:33:31,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-14 19:33:31,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-14 19:33:31,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:31,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-14 19:33:31,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:32,223 INFO L124 PetriNetUnfolderBase]: 916/1930 cut-off events. [2024-10-14 19:33:32,223 INFO L125 PetriNetUnfolderBase]: For 5546/5966 co-relation queries the response was YES. [2024-10-14 19:33:32,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 1930 events. 916/1930 cut-off events. For 5546/5966 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13726 event pairs, 242 based on Foata normal form. 56/1804 useless extension candidates. Maximal degree in co-relation 6625. Up to 689 conditions per place. [2024-10-14 19:33:32,231 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 23 selfloop transitions, 1 changer transitions 41/89 dead transitions. [2024-10-14 19:33:32,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 671 flow [2024-10-14 19:33:32,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:33:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:33:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-10-14 19:33:32,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-14 19:33:32,233 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 342 flow. Second operand 6 states and 150 transitions. [2024-10-14 19:33:32,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 671 flow [2024-10-14 19:33:32,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 557 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-10-14 19:33:32,245 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 234 flow [2024-10-14 19:33:32,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2024-10-14 19:33:32,246 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-10-14 19:33:32,246 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 234 flow [2024-10-14 19:33:32,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-14 19:33:32,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:32,246 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-14 19:33:32,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 19:33:32,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:32,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:32,247 INFO L85 PathProgramCache]: Analyzing trace with hash -967141076, now seen corresponding path program 2 times [2024-10-14 19:33:32,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:32,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139949839] [2024-10-14 19:33:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:33,368 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-14 19:33:33,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:33:33,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139949839] [2024-10-14 19:33:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139949839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:33,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:33,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 19:33:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010550244] [2024-10-14 19:33:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:33,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:33:33,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:33:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:33:33,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:33:33,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:33:33,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 45 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-14 19:33:33,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:33,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:33:33,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:33,888 INFO L124 PetriNetUnfolderBase]: 509/1084 cut-off events. [2024-10-14 19:33:33,889 INFO L125 PetriNetUnfolderBase]: For 1429/1537 co-relation queries the response was YES. [2024-10-14 19:33:33,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1084 events. 509/1084 cut-off events. For 1429/1537 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6582 event pairs, 129 based on Foata normal form. 22/1011 useless extension candidates. Maximal degree in co-relation 3027. Up to 413 conditions per place. [2024-10-14 19:33:33,894 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 22 selfloop transitions, 7 changer transitions 34/83 dead transitions. [2024-10-14 19:33:33,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 500 flow [2024-10-14 19:33:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:33:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:33:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 227 transitions. [2024-10-14 19:33:33,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4690082644628099 [2024-10-14 19:33:33,895 INFO L175 Difference]: Start difference. First operand has 74 places, 45 transitions, 234 flow. Second operand 11 states and 227 transitions. [2024-10-14 19:33:33,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 500 flow [2024-10-14 19:33:33,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 463 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-10-14 19:33:33,900 INFO L231 Difference]: Finished difference. Result has 74 places, 42 transitions, 219 flow [2024-10-14 19:33:33,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=219, PETRI_PLACES=74, PETRI_TRANSITIONS=42} [2024-10-14 19:33:33,901 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-10-14 19:33:33,901 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 42 transitions, 219 flow [2024-10-14 19:33:33,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-14 19:33:33,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:33,902 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-14 19:33:33,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 19:33:33,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1583802696, now seen corresponding path program 3 times [2024-10-14 19:33:33,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:33:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41715237] [2024-10-14 19:33:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:33,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:33:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:33:33,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:33:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:33:34,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:33:34,127 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:33:34,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-14 19:33:34,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-14 19:33:34,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-14 19:33:34,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 19:33:34,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 19:33:34,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 19:33:34,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:33:34,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 19:33:34,134 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:34,212 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:33:34,212 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:33:34,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:33:34 BasicIcfg [2024-10-14 19:33:34,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:33:34,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:33:34,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:33:34,220 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:33:34,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:33:22" (3/4) ... [2024-10-14 19:33:34,222 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:33:34,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:33:34,223 INFO L158 Benchmark]: Toolchain (without parser) took 12746.79ms. Allocated memory was 201.3MB in the beginning and 868.2MB in the end (delta: 666.9MB). Free memory was 164.9MB in the beginning and 564.8MB in the end (delta: -399.9MB). Peak memory consumption was 269.3MB. Max. memory is 16.1GB. [2024-10-14 19:33:34,223 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:33:34,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.22ms. Allocated memory is still 201.3MB. Free memory was 164.9MB in the beginning and 140.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 19:33:34,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.36ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 137.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:33:34,224 INFO L158 Benchmark]: Boogie Preprocessor took 49.42ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:33:34,224 INFO L158 Benchmark]: RCFGBuilder took 866.78ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 84.4MB in the end (delta: 49.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-14 19:33:34,225 INFO L158 Benchmark]: TraceAbstraction took 11325.25ms. Allocated memory was 201.3MB in the beginning and 868.2MB in the end (delta: 666.9MB). Free memory was 83.7MB in the beginning and 565.9MB in the end (delta: -482.2MB). Peak memory consumption was 185.4MB. Max. memory is 16.1GB. [2024-10-14 19:33:34,225 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 868.2MB. Free memory was 565.9MB in the beginning and 564.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:33:34,226 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.15ms. Allocated memory is still 201.3MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.22ms. Allocated memory is still 201.3MB. Free memory was 164.9MB in the beginning and 140.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.36ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 137.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.42ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 866.78ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 84.4MB in the end (delta: 49.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11325.25ms. Allocated memory was 201.3MB in the beginning and 868.2MB in the end (delta: 666.9MB). Free memory was 83.7MB in the beginning and 565.9MB in the end (delta: -482.2MB). Peak memory consumption was 185.4MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 868.2MB. Free memory was 565.9MB in the beginning and 564.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: 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 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: 818]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538 IncrementalHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 45 mSDtfsCounter, 1538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=8, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 19:33:34,269 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:33:36,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:33:36,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:33:36,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:33:36,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:33:36,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:33:36,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:33:36,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:33:36,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:33:36,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:33:36,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:33:36,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:33:36,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:33:36,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:33:36,467 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:33:36,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:33:36,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:33:36,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:33:36,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:33:36,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:33:36,468 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:33:36,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:33:36,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:33:36,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:33:36,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:33:36,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:33:36,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:33:36,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:33:36,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:33:36,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:33:36,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:33:36,474 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:33:36,474 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:33:36,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:33:36,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:33:36,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:33:36,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:33:36,476 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:33:36,476 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-10-14 19:33:36,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:33:36,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:33:36,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:33:36,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:33:36,766 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:33:36,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:33:38,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:33:38,646 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:33:38,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:33:38,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582041d33/3d061e80b9cd4d0c8ec96cd3ef63efa1/FLAGa0c0091cd [2024-10-14 19:33:38,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582041d33/3d061e80b9cd4d0c8ec96cd3ef63efa1 [2024-10-14 19:33:38,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:33:38,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:33:38,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:33:38,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:33:38,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:33:38,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:33:38" (1/1) ... [2024-10-14 19:33:38,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248c353e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:38, skipping insertion in model container [2024-10-14 19:33:38,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:33:38" (1/1) ... [2024-10-14 19:33:39,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:33:39,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:33:39,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:33:39,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:33:39,665 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:33:39,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39 WrapperNode [2024-10-14 19:33:39,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:33:39,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:33:39,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:33:39,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:33:39,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,731 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-10-14 19:33:39,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:33:39,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:33:39,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:33:39,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:33:39,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,773 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-14 19:33:39,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:33:39,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:33:39,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:33:39,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:33:39,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (1/1) ... [2024-10-14 19:33:39,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:33:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:33:39,826 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-14 19:33:39,834 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-14 19:33:39,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:33:39,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:33:39,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:33:39,872 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:33:39,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:33:39,873 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:33:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:33:39,873 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:33:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:33:39,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:33:39,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:33:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:33:39,876 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:33:39,995 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:33:39,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:33:40,299 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:33:40,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:33:40,479 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:33:40,480 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:33:40,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:33:40 BoogieIcfgContainer [2024-10-14 19:33:40,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:33:40,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:33:40,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:33:40,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:33:40,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:33:38" (1/3) ... [2024-10-14 19:33:40,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eace5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:33:40, skipping insertion in model container [2024-10-14 19:33:40,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:33:39" (2/3) ... [2024-10-14 19:33:40,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eace5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:33:40, skipping insertion in model container [2024-10-14 19:33:40,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:33:40" (3/3) ... [2024-10-14 19:33:40,489 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:33:40,501 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:33:40,502 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:33:40,502 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:33:40,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:33:40,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:33:40,604 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-14 19:33:40,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:40,608 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 76 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-14 19:33:40,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:33:40,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-14 19:33:40,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:33:40,629 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;@37f441c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:33:40,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:33:40,638 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:33:40,638 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-14 19:33:40,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:40,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:40,639 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:40,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:40,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 368939028, now seen corresponding path program 1 times [2024-10-14 19:33:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133567630] [2024-10-14 19:33:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:33:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:40,658 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-14 19:33:40,659 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-14 19:33:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:40,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:33:40,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:33:40,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:40,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133567630] [2024-10-14 19:33:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133567630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:40,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:40,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:33:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115826534] [2024-10-14 19:33:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:40,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:33:40,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:33:40,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:33:40,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-10-14 19:33:40,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 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-14 19:33:40,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:40,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-10-14 19:33:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:41,031 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-10-14 19:33:41,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:41,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-10-14 19:33:41,050 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-10-14 19:33:41,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-10-14 19:33:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:33:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:33:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-14 19:33:41,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-10-14 19:33:41,060 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-10-14 19:33:41,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-10-14 19:33:41,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:33:41,064 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-14 19:33:41,065 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-14 19:33:41,068 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-14 19:33:41,068 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-14 19:33:41,068 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-14 19:33:41,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:41,068 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:41,073 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-14 19:33:41,269 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-14 19:33:41,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash -46216889, now seen corresponding path program 1 times [2024-10-14 19:33:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390740541] [2024-10-14 19:33:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:41,271 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-14 19:33:41,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:41,274 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-14 19:33:41,283 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-14 19:33:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:41,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:33:41,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:41,401 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-14 19:33:41,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:41,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390740541] [2024-10-14 19:33:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390740541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:41,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:41,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:33:41,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501356715] [2024-10-14 19:33:41,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:41,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:33:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:33:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:33:41,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:33:41,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:41,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:41,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:33:41,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:41,658 INFO L124 PetriNetUnfolderBase]: 1129/1945 cut-off events. [2024-10-14 19:33:41,658 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-10-14 19:33:41,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 1945 events. 1129/1945 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12298 event pairs, 94 based on Foata normal form. 60/1996 useless extension candidates. Maximal degree in co-relation 3795. Up to 1184 conditions per place. [2024-10-14 19:33:41,668 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 38 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-10-14 19:33:41,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 220 flow [2024-10-14 19:33:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:33:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:33:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-10-14 19:33:41,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-14 19:33:41,670 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 110 transitions. [2024-10-14 19:33:41,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 220 flow [2024-10-14 19:33:41,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:33:41,672 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-10-14 19:33:41,672 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-14 19:33:41,672 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-14 19:33:41,673 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-10-14 19:33:41,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:41,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:41,673 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-14 19:33:41,679 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-14 19:33:41,876 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-14 19:33:41,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:41,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1930264810, now seen corresponding path program 1 times [2024-10-14 19:33:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959184982] [2024-10-14 19:33:41,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:41,877 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-14 19:33:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:41,880 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-14 19:33:41,888 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-14 19:33:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:41,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:33:41,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:41,985 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-14 19:33:41,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:41,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959184982] [2024-10-14 19:33:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959184982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:41,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:33:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317265841] [2024-10-14 19:33:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:41,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:33:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:33:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:33:41,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:33:41,997 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.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:41,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:41,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:33:41,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:42,201 INFO L124 PetriNetUnfolderBase]: 748/1316 cut-off events. [2024-10-14 19:33:42,201 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-10-14 19:33:42,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 1316 events. 748/1316 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7332 event pairs, 34 based on Foata normal form. 54/1361 useless extension candidates. Maximal degree in co-relation 2951. Up to 645 conditions per place. [2024-10-14 19:33:42,208 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-10-14 19:33:42,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 305 flow [2024-10-14 19:33:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:33:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:33:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-10-14 19:33:42,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-10-14 19:33:42,209 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 138 transitions. [2024-10-14 19:33:42,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 305 flow [2024-10-14 19:33:42,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 295 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 19:33:42,212 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-10-14 19:33:42,212 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-14 19:33:42,229 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-10-14 19:33:42,229 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-10-14 19:33:42,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:42,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:42,230 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-14 19:33:42,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 19:33:42,430 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-14 19:33:42,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:42,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1127643693, now seen corresponding path program 1 times [2024-10-14 19:33:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40490477] [2024-10-14 19:33:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:42,432 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-14 19:33:42,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:42,434 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-14 19:33:42,436 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-14 19:33:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:42,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:33:42,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:33:42,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:42,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40490477] [2024-10-14 19:33:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40490477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:42,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:42,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:33:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461539982] [2024-10-14 19:33:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:33:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:42,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:33:42,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:33:42,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:33:42,566 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.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:42,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:42,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:33:42,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:42,734 INFO L124 PetriNetUnfolderBase]: 381/663 cut-off events. [2024-10-14 19:33:42,734 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-10-14 19:33:42,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 663 events. 381/663 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2869 event pairs, 23 based on Foata normal form. 32/686 useless extension candidates. Maximal degree in co-relation 1727. Up to 228 conditions per place. [2024-10-14 19:33:42,740 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 42 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-10-14 19:33:42,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 320 flow [2024-10-14 19:33:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:33:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:33:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-10-14 19:33:42,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-10-14 19:33:42,742 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 152 transitions. [2024-10-14 19:33:42,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 320 flow [2024-10-14 19:33:42,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-14 19:33:42,745 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-10-14 19:33:42,745 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-14 19:33:42,746 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-10-14 19:33:42,746 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-10-14 19:33:42,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:42,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:42,746 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-14 19:33:42,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 19:33:42,949 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-14 19:33:42,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 307696606, now seen corresponding path program 1 times [2024-10-14 19:33:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171201417] [2024-10-14 19:33:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:42,951 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-14 19:33:42,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:42,954 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-14 19:33:42,955 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-14 19:33:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:43,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:33:43,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:43,163 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-14 19:33:43,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:43,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171201417] [2024-10-14 19:33:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171201417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:43,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:43,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:33:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684395566] [2024-10-14 19:33:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:43,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:33:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:33:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:33:43,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-14 19:33:43,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-14 19:33:43,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:43,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-14 19:33:43,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:43,244 INFO L124 PetriNetUnfolderBase]: 186/390 cut-off events. [2024-10-14 19:33:43,244 INFO L125 PetriNetUnfolderBase]: For 131/136 co-relation queries the response was YES. [2024-10-14 19:33:43,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 390 events. 186/390 cut-off events. For 131/136 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1769 event pairs, 178 based on Foata normal form. 8/359 useless extension candidates. Maximal degree in co-relation 839. Up to 311 conditions per place. [2024-10-14 19:33:43,247 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-14 19:33:43,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 202 flow [2024-10-14 19:33:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:33:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:33:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-10-14 19:33:43,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-14 19:33:43,248 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 77 transitions. [2024-10-14 19:33:43,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 202 flow [2024-10-14 19:33:43,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 146 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-14 19:33:43,250 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-10-14 19:33:43,250 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-14 19:33:43,251 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-14 19:33:43,251 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-10-14 19:33:43,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-14 19:33:43,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:43,251 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-14 19:33:43,259 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-14 19:33:43,452 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-14 19:33:43,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:43,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 307698000, now seen corresponding path program 1 times [2024-10-14 19:33:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252542703] [2024-10-14 19:33:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:33:43,454 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-14 19:33:43,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:43,457 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-14 19:33:43,467 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-14 19:33:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:33:43,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:33:43,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:43,616 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-14 19:33:43,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:43,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:43,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252542703] [2024-10-14 19:33:43,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252542703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:43,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:43,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:33:43,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241988869] [2024-10-14 19:33:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:43,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:33:43,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:43,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:33:43,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:33:43,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-14 19:33:43,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:43,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:43,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-14 19:33:43,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:43,776 INFO L124 PetriNetUnfolderBase]: 488/977 cut-off events. [2024-10-14 19:33:43,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:33:43,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 977 events. 488/977 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5329 event pairs, 215 based on Foata normal form. 8/914 useless extension candidates. Maximal degree in co-relation 1884. Up to 391 conditions per place. [2024-10-14 19:33:43,780 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 13/62 dead transitions. [2024-10-14 19:33:43,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 240 flow [2024-10-14 19:33:43,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:33:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:33:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-10-14 19:33:43,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6045454545454545 [2024-10-14 19:33:43,781 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 5 states and 133 transitions. [2024-10-14 19:33:43,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 240 flow [2024-10-14 19:33:43,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:33:43,782 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 119 flow [2024-10-14 19:33:43,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-10-14 19:33:43,783 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2024-10-14 19:33:43,783 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 119 flow [2024-10-14 19:33:43,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:33:43,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:43,783 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-14 19:33:43,790 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-14 19:33:43,986 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-14 19:33:43,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1939789950, now seen corresponding path program 2 times [2024-10-14 19:33:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586206471] [2024-10-14 19:33:43,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:33:43,988 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-14 19:33:43,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:43,990 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-14 19:33:43,991 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-14 19:33:44,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 19:33:44,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:33:44,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:33:44,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:44,165 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-14 19:33:44,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:44,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586206471] [2024-10-14 19:33:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586206471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:33:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550666020] [2024-10-14 19:33:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:44,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:33:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:33:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:33:44,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-14 19:33:44,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-14 19:33:44,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:44,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-14 19:33:44,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:44,356 INFO L124 PetriNetUnfolderBase]: 360/766 cut-off events. [2024-10-14 19:33:44,356 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-14 19:33:44,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 766 events. 360/766 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3867 event pairs, 110 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 1539. Up to 326 conditions per place. [2024-10-14 19:33:44,360 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 22 selfloop transitions, 1 changer transitions 22/65 dead transitions. [2024-10-14 19:33:44,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 267 flow [2024-10-14 19:33:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:33:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:33:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-10-14 19:33:44,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-14 19:33:44,362 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 119 flow. Second operand 6 states and 154 transitions. [2024-10-14 19:33:44,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 267 flow [2024-10-14 19:33:44,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 253 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 19:33:44,363 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 120 flow [2024-10-14 19:33:44,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-10-14 19:33:44,364 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-10-14 19:33:44,364 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 120 flow [2024-10-14 19:33:44,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-14 19:33:44,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:44,367 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-14 19:33:44,374 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-14 19:33:44,570 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-14 19:33:44,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:44,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash 273720844, now seen corresponding path program 3 times [2024-10-14 19:33:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:44,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111943085] [2024-10-14 19:33:44,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:33:44,572 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-14 19:33:44,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:44,574 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-14 19:33:44,576 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-14 19:33:44,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-14 19:33:44,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:33:44,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 19:33:44,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:33:45,013 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-14 19:33:45,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:33:45,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:33:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111943085] [2024-10-14 19:33:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111943085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:33:45,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:33:45,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 19:33:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675091090] [2024-10-14 19:33:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:33:45,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:33:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:33:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:33:45,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:33:45,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-14 19:33:45,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 120 flow. Second operand has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 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-14 19:33:45,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:33:45,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-14 19:33:45,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:33:45,214 INFO L124 PetriNetUnfolderBase]: 337/678 cut-off events. [2024-10-14 19:33:45,214 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 19:33:45,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 678 events. 337/678 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3302 event pairs, 101 based on Foata normal form. 8/638 useless extension candidates. Maximal degree in co-relation 1368. Up to 230 conditions per place. [2024-10-14 19:33:45,217 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 21 selfloop transitions, 4 changer transitions 20/66 dead transitions. [2024-10-14 19:33:45,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 268 flow [2024-10-14 19:33:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:33:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:33:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-10-14 19:33:45,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-10-14 19:33:45,218 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 120 flow. Second operand 8 states and 198 transitions. [2024-10-14 19:33:45,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 268 flow [2024-10-14 19:33:45,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 257 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 19:33:45,219 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 127 flow [2024-10-14 19:33:45,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-10-14 19:33:45,220 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-10-14 19:33:45,220 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 127 flow [2024-10-14 19:33:45,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 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-14 19:33:45,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:33:45,221 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:33:45,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-14 19:33:45,423 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-14 19:33:45,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:33:45,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:33:45,425 INFO L85 PathProgramCache]: Analyzing trace with hash 596103760, now seen corresponding path program 4 times [2024-10-14 19:33:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:33:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943952416] [2024-10-14 19:33:45,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:33:45,438 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-14 19:33:45,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:33:45,441 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-14 19:33:45,448 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-14 19:33:45,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:33:45,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 19:33:45,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:33:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:33:45,658 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 19:33:45,658 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:33:45,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-14 19:33:45,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-14 19:33:45,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-14 19:33:45,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 19:33:45,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 19:33:45,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 19:33:45,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:33:45,668 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-14 19:33:45,864 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-14 19:33:45,865 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-14 19:33:45,913 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:33:45,913 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:33:45,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:33:45 BasicIcfg [2024-10-14 19:33:45,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:33:45,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:33:45,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:33:45,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:33:45,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:33:40" (3/4) ... [2024-10-14 19:33:45,922 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:33:45,923 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:33:45,923 INFO L158 Benchmark]: Toolchain (without parser) took 6957.06ms. Allocated memory was 65.0MB in the beginning and 161.5MB in the end (delta: 96.5MB). Free memory was 39.9MB in the beginning and 102.7MB in the end (delta: -62.8MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-10-14 19:33:45,924 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:33:45,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.08ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 39.7MB in the beginning and 51.0MB in the end (delta: -11.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 19:33:45,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.32ms. Allocated memory is still 83.9MB. Free memory was 51.0MB in the beginning and 48.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:33:45,924 INFO L158 Benchmark]: Boogie Preprocessor took 59.35ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 44.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:33:45,924 INFO L158 Benchmark]: RCFGBuilder took 685.26ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 40.3MB in the end (delta: 4.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-10-14 19:33:45,925 INFO L158 Benchmark]: TraceAbstraction took 5437.49ms. Allocated memory was 83.9MB in the beginning and 161.5MB in the end (delta: 77.6MB). Free memory was 39.8MB in the beginning and 102.7MB in the end (delta: -63.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-10-14 19:33:45,925 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 161.5MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:33:45,926 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.19ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.08ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 39.7MB in the beginning and 51.0MB in the end (delta: -11.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.32ms. Allocated memory is still 83.9MB. Free memory was 51.0MB in the beginning and 48.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.35ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 44.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 685.26ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 40.3MB in the end (delta: 4.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5437.49ms. Allocated memory was 83.9MB in the beginning and 161.5MB in the end (delta: 77.6MB). Free memory was 39.8MB in the beginning and 102.7MB in the end (delta: -63.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 161.5MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, t1493=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 10 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 12 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 50 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-14 19:33:45,962 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