./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:22:49,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:22:49,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:22:49,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:22:49,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:22:49,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:22:49,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:22:49,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:22:49,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:22:49,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:22:49,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:22:49,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:22:49,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:22:49,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:22:49,502 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:22:49,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:22:49,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:22:49,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:22:49,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:22:49,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:22:49,505 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:22:49,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:22:49,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:22:49,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:22:49,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:22:49,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:22:49,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:22:49,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:22:49,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:22:49,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:22:49,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:22:49,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:22:49,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:22:49,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:22:49,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:22:49,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:22:49,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:22:49,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:22:49,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:22:49,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:22:49,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:22:49,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:22:49,513 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-17 03:22:49,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:22:49,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:22:49,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:22:49,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:22:49,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:22:49,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:22:51,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:22:51,341 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:22:51,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:22:51,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc7b8d31/600a85a4b5774769a65feed5c9e7d4a5/FLAGf9497e7fe [2024-11-17 03:22:51,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc7b8d31/600a85a4b5774769a65feed5c9e7d4a5 [2024-11-17 03:22:51,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:22:51,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:22:51,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:22:51,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:22:51,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:22:51,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d73c456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51, skipping insertion in model container [2024-11-17 03:22:51,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:22:51,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:22:51,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:22:51,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:22:51,845 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:22:51,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51 WrapperNode [2024-11-17 03:22:51,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:22:51,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:22:51,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:22:51,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:22:51,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,908 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-17 03:22:51,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:22:51,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:22:51,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:22:51,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:22:51,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,955 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:22:51,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:22:51,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:22:51,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:22:51,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:22:51,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (1/1) ... [2024-11-17 03:22:51,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:22:52,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:22:52,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:22:52,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:22:52,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:22:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:22:52,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:22:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:22:52,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:22:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:22:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:22:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:22:52,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:22:52,065 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:22:52,192 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:22:52,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:22:52,564 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:22:52,565 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:22:52,837 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:22:52,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:22:52,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:22:52 BoogieIcfgContainer [2024-11-17 03:22:52,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:22:52,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:22:52,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:22:52,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:22:52,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:22:51" (1/3) ... [2024-11-17 03:22:52,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1810f1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:22:52, skipping insertion in model container [2024-11-17 03:22:52,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:22:51" (2/3) ... [2024-11-17 03:22:52,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1810f1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:22:52, skipping insertion in model container [2024-11-17 03:22:52,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:22:52" (3/3) ... [2024-11-17 03:22:52,845 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:22:52,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:22:52,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:22:52,865 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:22:52,915 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:22:52,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-17 03:22:52,969 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-17 03:22:52,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:22:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-17 03:22:52,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-17 03:22:52,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-17 03:22:52,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:22:52,986 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;@1be95684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:22:52,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-17 03:22:52,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:22:52,992 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-17 03:22:52,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:22:52,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:22:52,993 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:22:52,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:22:52,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:22:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1111843393, now seen corresponding path program 1 times [2024-11-17 03:22:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:22:53,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305970471] [2024-11-17 03:22:53,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:22:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:22:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:22:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:22:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:22:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305970471] [2024-11-17 03:22:53,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305970471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:22:53,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:22:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:22:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417549317] [2024-11-17 03:22:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:22:53,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:22:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:22:53,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:22:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:22:53,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:22:53,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:22:53,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:22:53,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:22:53,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:22:54,721 INFO L124 PetriNetUnfolderBase]: 7377/10637 cut-off events. [2024-11-17 03:22:54,721 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-17 03:22:54,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21186 conditions, 10637 events. 7377/10637 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 58867 event pairs, 972 based on Foata normal form. 588/11210 useless extension candidates. Maximal degree in co-relation 21175. Up to 8856 conditions per place. [2024-11-17 03:22:54,782 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-17 03:22:54,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2024-11-17 03:22:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:22:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:22:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-17 03:22:54,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2024-11-17 03:22:54,794 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 88 transitions. [2024-11-17 03:22:54,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2024-11-17 03:22:54,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:22:54,802 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-17 03:22:54,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-17 03:22:54,808 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-17 03:22:54,808 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-17 03:22:54,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:22:54,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:22:54,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:22:54,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:22:54,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:22:54,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:22:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1895795460, now seen corresponding path program 1 times [2024-11-17 03:22:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:22:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845450447] [2024-11-17 03:22:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:22:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:22:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:22:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:22:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:22:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845450447] [2024-11-17 03:22:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845450447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:22:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:22:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:22:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376668434] [2024-11-17 03:22:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:22:54,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:22:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:22:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:22:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:22:54,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:22:54,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:22:54,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:22:54,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:22:54,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:22:55,898 INFO L124 PetriNetUnfolderBase]: 6628/10231 cut-off events. [2024-11-17 03:22:55,898 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-11-17 03:22:55,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20177 conditions, 10231 events. 6628/10231 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 62277 event pairs, 6628 based on Foata normal form. 294/10461 useless extension candidates. Maximal degree in co-relation 20167. Up to 9387 conditions per place. [2024-11-17 03:22:55,962 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-17 03:22:55,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2024-11-17 03:22:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:22:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:22:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-17 03:22:55,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2024-11-17 03:22:55,965 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2024-11-17 03:22:55,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2024-11-17 03:22:55,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:22:55,969 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-17 03:22:55,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-17 03:22:55,970 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-17 03:22:55,970 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-17 03:22:55,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:22:55,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:22:55,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:22:55,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:22:55,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:22:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:22:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1895796018, now seen corresponding path program 1 times [2024-11-17 03:22:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:22:55,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690084039] [2024-11-17 03:22:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:22:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:22:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:22:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:22:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:22:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690084039] [2024-11-17 03:22:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690084039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:22:56,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:22:56,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:22:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897835875] [2024-11-17 03:22:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:22:56,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:22:56,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:22:56,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:22:56,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:22:56,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:22:56,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:22:56,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:22:56,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:22:56,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:22:58,075 INFO L124 PetriNetUnfolderBase]: 8171/11991 cut-off events. [2024-11-17 03:22:58,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:22:58,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23753 conditions, 11991 events. 8171/11991 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 69505 event pairs, 1814 based on Foata normal form. 0/11780 useless extension candidates. Maximal degree in co-relation 23747. Up to 4975 conditions per place. [2024-11-17 03:22:58,124 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 55 selfloop transitions, 8 changer transitions 110/178 dead transitions. [2024-11-17 03:22:58,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 178 transitions, 712 flow [2024-11-17 03:22:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:22:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:22:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2024-11-17 03:22:58,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5144927536231884 [2024-11-17 03:22:58,127 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 12 states and 284 transitions. [2024-11-17 03:22:58,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 178 transitions, 712 flow [2024-11-17 03:22:58,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 178 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:22:58,132 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 179 flow [2024-11-17 03:22:58,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2024-11-17 03:22:58,133 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2024-11-17 03:22:58,133 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 179 flow [2024-11-17 03:22:58,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:22:58,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:22:58,134 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:22:58,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:22:58,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:22:58,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:22:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -345841122, now seen corresponding path program 1 times [2024-11-17 03:22:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:22:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330941655] [2024-11-17 03:22:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:22:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:22:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:22:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:22:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:22:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330941655] [2024-11-17 03:22:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330941655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:22:58,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:22:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:22:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782597640] [2024-11-17 03:22:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:22:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:22:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:22:58,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:22:58,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:22:58,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:22:58,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-11-17 03:22:58,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:22:58,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:22:58,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:00,074 INFO L124 PetriNetUnfolderBase]: 6323/9409 cut-off events. [2024-11-17 03:23:00,075 INFO L125 PetriNetUnfolderBase]: For 17478/17478 co-relation queries the response was YES. [2024-11-17 03:23:00,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29674 conditions, 9409 events. 6323/9409 cut-off events. For 17478/17478 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 52741 event pairs, 1414 based on Foata normal form. 195/9601 useless extension candidates. Maximal degree in co-relation 29656. Up to 6901 conditions per place. [2024-11-17 03:23:00,134 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 55 selfloop transitions, 17 changer transitions 64/141 dead transitions. [2024-11-17 03:23:00,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 897 flow [2024-11-17 03:23:00,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:23:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:23:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-11-17 03:23:00,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48478260869565215 [2024-11-17 03:23:00,136 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 179 flow. Second operand 10 states and 223 transitions. [2024-11-17 03:23:00,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 897 flow [2024-11-17 03:23:00,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 141 transitions, 819 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-11-17 03:23:00,208 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 295 flow [2024-11-17 03:23:00,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2024-11-17 03:23:00,210 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2024-11-17 03:23:00,212 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 295 flow [2024-11-17 03:23:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-11-17 03:23:00,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:00,212 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:00,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:23:00,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash -255368559, now seen corresponding path program 1 times [2024-11-17 03:23:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185442487] [2024-11-17 03:23:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:01,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:01,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185442487] [2024-11-17 03:23:01,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185442487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:01,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:01,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:23:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36972461] [2024-11-17 03:23:01,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:01,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:23:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:01,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:23:01,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:23:01,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:01,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 295 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:01,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:01,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:01,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:02,387 INFO L124 PetriNetUnfolderBase]: 6095/9087 cut-off events. [2024-11-17 03:23:02,387 INFO L125 PetriNetUnfolderBase]: For 19164/19164 co-relation queries the response was YES. [2024-11-17 03:23:02,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30876 conditions, 9087 events. 6095/9087 cut-off events. For 19164/19164 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 48565 event pairs, 780 based on Foata normal form. 166/9240 useless extension candidates. Maximal degree in co-relation 30853. Up to 6775 conditions per place. [2024-11-17 03:23:02,459 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 69 selfloop transitions, 6 changer transitions 51/131 dead transitions. [2024-11-17 03:23:02,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 131 transitions, 918 flow [2024-11-17 03:23:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:23:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:23:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-11-17 03:23:02,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48641304347826086 [2024-11-17 03:23:02,461 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 295 flow. Second operand 8 states and 179 transitions. [2024-11-17 03:23:02,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 131 transitions, 918 flow [2024-11-17 03:23:02,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 131 transitions, 886 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-17 03:23:02,526 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 330 flow [2024-11-17 03:23:02,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2024-11-17 03:23:02,529 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-11-17 03:23:02,529 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 330 flow [2024-11-17 03:23:02,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:02,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:02,530 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:02,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:23:02,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:02,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1283940737, now seen corresponding path program 1 times [2024-11-17 03:23:02,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:02,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403159803] [2024-11-17 03:23:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403159803] [2024-11-17 03:23:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403159803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:02,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:02,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:23:02,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254570654] [2024-11-17 03:23:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:02,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:02,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:02,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:02,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:02,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:02,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:02,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:02,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:02,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:03,910 INFO L124 PetriNetUnfolderBase]: 8583/12636 cut-off events. [2024-11-17 03:23:03,910 INFO L125 PetriNetUnfolderBase]: For 25707/25716 co-relation queries the response was YES. [2024-11-17 03:23:03,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43252 conditions, 12636 events. 8583/12636 cut-off events. For 25707/25716 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 70642 event pairs, 3558 based on Foata normal form. 208/12833 useless extension candidates. Maximal degree in co-relation 43229. Up to 5900 conditions per place. [2024-11-17 03:23:03,978 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 61 selfloop transitions, 6 changer transitions 51/123 dead transitions. [2024-11-17 03:23:03,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 887 flow [2024-11-17 03:23:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:23:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:23:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-11-17 03:23:03,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5124223602484472 [2024-11-17 03:23:03,980 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 330 flow. Second operand 7 states and 165 transitions. [2024-11-17 03:23:03,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 887 flow [2024-11-17 03:23:04,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 860 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-17 03:23:04,050 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 329 flow [2024-11-17 03:23:04,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-11-17 03:23:04,051 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2024-11-17 03:23:04,051 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 329 flow [2024-11-17 03:23:04,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:04,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:04,052 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:04,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:23:04,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:04,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1225593935, now seen corresponding path program 1 times [2024-11-17 03:23:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:04,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502586707] [2024-11-17 03:23:04,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:04,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502586707] [2024-11-17 03:23:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502586707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:23:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542816629] [2024-11-17 03:23:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:04,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:23:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:23:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:23:04,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:04,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:04,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:04,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:04,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:05,954 INFO L124 PetriNetUnfolderBase]: 7778/11814 cut-off events. [2024-11-17 03:23:05,954 INFO L125 PetriNetUnfolderBase]: For 28289/28289 co-relation queries the response was YES. [2024-11-17 03:23:06,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40474 conditions, 11814 events. 7778/11814 cut-off events. For 28289/28289 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 67958 event pairs, 1301 based on Foata normal form. 246/12056 useless extension candidates. Maximal degree in co-relation 40450. Up to 8582 conditions per place. [2024-11-17 03:23:06,039 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 101 selfloop transitions, 20 changer transitions 57/183 dead transitions. [2024-11-17 03:23:06,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 183 transitions, 1479 flow [2024-11-17 03:23:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:23:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:23:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 240 transitions. [2024-11-17 03:23:06,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4743083003952569 [2024-11-17 03:23:06,041 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 329 flow. Second operand 11 states and 240 transitions. [2024-11-17 03:23:06,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 183 transitions, 1479 flow [2024-11-17 03:23:06,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 183 transitions, 1446 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-17 03:23:06,101 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 591 flow [2024-11-17 03:23:06,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=591, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-11-17 03:23:06,102 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2024-11-17 03:23:06,102 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 591 flow [2024-11-17 03:23:06,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:06,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:06,103 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:06,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:23:06,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:06,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1067042449, now seen corresponding path program 2 times [2024-11-17 03:23:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296385900] [2024-11-17 03:23:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:06,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:06,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296385900] [2024-11-17 03:23:06,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296385900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:06,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:06,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:23:06,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929234085] [2024-11-17 03:23:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:06,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:23:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:23:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:23:06,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:06,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:06,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:06,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:06,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:07,495 INFO L124 PetriNetUnfolderBase]: 5838/9052 cut-off events. [2024-11-17 03:23:07,495 INFO L125 PetriNetUnfolderBase]: For 34904/34913 co-relation queries the response was YES. [2024-11-17 03:23:07,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34490 conditions, 9052 events. 5838/9052 cut-off events. For 34904/34913 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 52766 event pairs, 877 based on Foata normal form. 441/9484 useless extension candidates. Maximal degree in co-relation 34460. Up to 4507 conditions per place. [2024-11-17 03:23:07,569 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 118 selfloop transitions, 5 changer transitions 11/139 dead transitions. [2024-11-17 03:23:07,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 139 transitions, 1457 flow [2024-11-17 03:23:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:23:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:23:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-17 03:23:07,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2024-11-17 03:23:07,570 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 591 flow. Second operand 4 states and 109 transitions. [2024-11-17 03:23:07,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 139 transitions, 1457 flow [2024-11-17 03:23:07,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 1437 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:07,601 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 598 flow [2024-11-17 03:23:07,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=598, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2024-11-17 03:23:07,602 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2024-11-17 03:23:07,602 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 598 flow [2024-11-17 03:23:07,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:07,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:07,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:07,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:23:07,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:07,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1481677808, now seen corresponding path program 1 times [2024-11-17 03:23:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807484184] [2024-11-17 03:23:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:08,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807484184] [2024-11-17 03:23:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807484184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:23:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036520584] [2024-11-17 03:23:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:23:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:23:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:23:08,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:08,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 598 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 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-11-17 03:23:08,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:08,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:08,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:09,887 INFO L124 PetriNetUnfolderBase]: 6605/10192 cut-off events. [2024-11-17 03:23:09,887 INFO L125 PetriNetUnfolderBase]: For 36530/36533 co-relation queries the response was YES. [2024-11-17 03:23:09,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41650 conditions, 10192 events. 6605/10192 cut-off events. For 36530/36533 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 58654 event pairs, 1592 based on Foata normal form. 160/10344 useless extension candidates. Maximal degree in co-relation 41618. Up to 6620 conditions per place. [2024-11-17 03:23:09,974 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 100 selfloop transitions, 35 changer transitions 74/214 dead transitions. [2024-11-17 03:23:09,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 214 transitions, 2019 flow [2024-11-17 03:23:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:23:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:23:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2024-11-17 03:23:09,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-11-17 03:23:09,975 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 598 flow. Second operand 10 states and 240 transitions. [2024-11-17 03:23:09,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 214 transitions, 2019 flow [2024-11-17 03:23:10,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 214 transitions, 1987 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:10,005 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 914 flow [2024-11-17 03:23:10,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=914, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-11-17 03:23:10,006 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2024-11-17 03:23:10,006 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 914 flow [2024-11-17 03:23:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 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-11-17 03:23:10,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:10,006 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:10,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:23:10,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1160732618, now seen corresponding path program 2 times [2024-11-17 03:23:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020895272] [2024-11-17 03:23:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020895272] [2024-11-17 03:23:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020895272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:10,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:10,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:23:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753777389] [2024-11-17 03:23:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:10,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:10,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:10,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 914 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-11-17 03:23:10,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:10,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:10,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:10,922 INFO L124 PetriNetUnfolderBase]: 4155/6490 cut-off events. [2024-11-17 03:23:10,922 INFO L125 PetriNetUnfolderBase]: For 44443/44452 co-relation queries the response was YES. [2024-11-17 03:23:10,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28954 conditions, 6490 events. 4155/6490 cut-off events. For 44443/44452 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 35744 event pairs, 585 based on Foata normal form. 370/6851 useless extension candidates. Maximal degree in co-relation 28914. Up to 2417 conditions per place. [2024-11-17 03:23:10,957 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 133 selfloop transitions, 8 changer transitions 23/169 dead transitions. [2024-11-17 03:23:10,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 169 transitions, 2107 flow [2024-11-17 03:23:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:23:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:23:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-17 03:23:10,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2024-11-17 03:23:10,958 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 914 flow. Second operand 5 states and 139 transitions. [2024-11-17 03:23:10,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 169 transitions, 2107 flow [2024-11-17 03:23:10,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 169 transitions, 1989 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-11-17 03:23:10,997 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 825 flow [2024-11-17 03:23:10,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=825, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2024-11-17 03:23:10,998 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2024-11-17 03:23:10,998 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 825 flow [2024-11-17 03:23:10,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-11-17 03:23:10,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:10,999 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] [2024-11-17 03:23:10,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:23:10,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:10,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2046693618, now seen corresponding path program 1 times [2024-11-17 03:23:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:10,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121430397] [2024-11-17 03:23:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121430397] [2024-11-17 03:23:11,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121430397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:11,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:11,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:23:11,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299643149] [2024-11-17 03:23:11,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:11,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:23:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:11,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:23:11,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:23:11,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:11,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 825 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:11,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:11,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:11,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:11,724 INFO L124 PetriNetUnfolderBase]: 2728/4229 cut-off events. [2024-11-17 03:23:11,724 INFO L125 PetriNetUnfolderBase]: For 27746/27755 co-relation queries the response was YES. [2024-11-17 03:23:11,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 4229 events. 2728/4229 cut-off events. For 27746/27755 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 21840 event pairs, 458 based on Foata normal form. 124/4344 useless extension candidates. Maximal degree in co-relation 19438. Up to 1668 conditions per place. [2024-11-17 03:23:11,750 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 95 selfloop transitions, 11 changer transitions 40/151 dead transitions. [2024-11-17 03:23:11,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 151 transitions, 1751 flow [2024-11-17 03:23:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:23:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:23:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-11-17 03:23:11,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2024-11-17 03:23:11,752 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 825 flow. Second operand 6 states and 139 transitions. [2024-11-17 03:23:11,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 151 transitions, 1751 flow [2024-11-17 03:23:11,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 151 transitions, 1590 flow, removed 55 selfloop flow, removed 9 redundant places. [2024-11-17 03:23:11,804 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 612 flow [2024-11-17 03:23:11,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=612, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2024-11-17 03:23:11,804 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2024-11-17 03:23:11,804 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 612 flow [2024-11-17 03:23:11,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:11,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:11,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:11,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:23:11,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:11,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2087312072, now seen corresponding path program 1 times [2024-11-17 03:23:11,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:11,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245994056] [2024-11-17 03:23:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:11,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245994056] [2024-11-17 03:23:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245994056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:12,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:23:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564747826] [2024-11-17 03:23:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:12,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:23:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:23:12,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:23:12,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:12,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 612 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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-11-17 03:23:12,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:12,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:12,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:13,055 INFO L124 PetriNetUnfolderBase]: 2227/3456 cut-off events. [2024-11-17 03:23:13,055 INFO L125 PetriNetUnfolderBase]: For 17592/17595 co-relation queries the response was YES. [2024-11-17 03:23:13,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14865 conditions, 3456 events. 2227/3456 cut-off events. For 17592/17595 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16785 event pairs, 202 based on Foata normal form. 8/3462 useless extension candidates. Maximal degree in co-relation 14830. Up to 1189 conditions per place. [2024-11-17 03:23:13,070 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 88 selfloop transitions, 33 changer transitions 58/184 dead transitions. [2024-11-17 03:23:13,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 184 transitions, 1754 flow [2024-11-17 03:23:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:23:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:23:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2024-11-17 03:23:13,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4367588932806324 [2024-11-17 03:23:13,072 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 612 flow. Second operand 11 states and 221 transitions. [2024-11-17 03:23:13,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 184 transitions, 1754 flow [2024-11-17 03:23:13,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 184 transitions, 1332 flow, removed 117 selfloop flow, removed 17 redundant places. [2024-11-17 03:23:13,095 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 706 flow [2024-11-17 03:23:13,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=706, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-11-17 03:23:13,096 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2024-11-17 03:23:13,096 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 706 flow [2024-11-17 03:23:13,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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-11-17 03:23:13,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:13,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:23:13,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1248189216, now seen corresponding path program 2 times [2024-11-17 03:23:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:13,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006807028] [2024-11-17 03:23:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:14,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:14,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006807028] [2024-11-17 03:23:14,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006807028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:14,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:14,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:23:14,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439896366] [2024-11-17 03:23:14,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:14,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:23:14,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:14,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:23:14,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:23:14,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:14,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 706 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:14,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:14,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:14,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:15,112 INFO L124 PetriNetUnfolderBase]: 1668/2623 cut-off events. [2024-11-17 03:23:15,112 INFO L125 PetriNetUnfolderBase]: For 7158/7161 co-relation queries the response was YES. [2024-11-17 03:23:15,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9464 conditions, 2623 events. 1668/2623 cut-off events. For 7158/7161 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 12102 event pairs, 402 based on Foata normal form. 8/2629 useless extension candidates. Maximal degree in co-relation 9434. Up to 1084 conditions per place. [2024-11-17 03:23:15,126 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 80 selfloop transitions, 16 changer transitions 47/148 dead transitions. [2024-11-17 03:23:15,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 148 transitions, 1272 flow [2024-11-17 03:23:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:23:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:23:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-11-17 03:23:15,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3934782608695652 [2024-11-17 03:23:15,128 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 706 flow. Second operand 10 states and 181 transitions. [2024-11-17 03:23:15,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 148 transitions, 1272 flow [2024-11-17 03:23:15,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 1197 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-11-17 03:23:15,138 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 664 flow [2024-11-17 03:23:15,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=664, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-11-17 03:23:15,139 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2024-11-17 03:23:15,139 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 664 flow [2024-11-17 03:23:15,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:15,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:15,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:15,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:23:15,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:15,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1339608422, now seen corresponding path program 3 times [2024-11-17 03:23:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286854469] [2024-11-17 03:23:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286854469] [2024-11-17 03:23:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286854469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:23:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909349553] [2024-11-17 03:23:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:16,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:23:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:16,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:23:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:23:16,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:16,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 664 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:16,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:16,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:16,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:17,048 INFO L124 PetriNetUnfolderBase]: 1568/2441 cut-off events. [2024-11-17 03:23:17,048 INFO L125 PetriNetUnfolderBase]: For 6586/6589 co-relation queries the response was YES. [2024-11-17 03:23:17,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8865 conditions, 2441 events. 1568/2441 cut-off events. For 6586/6589 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11116 event pairs, 273 based on Foata normal form. 10/2449 useless extension candidates. Maximal degree in co-relation 8836. Up to 1159 conditions per place. [2024-11-17 03:23:17,057 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 103 selfloop transitions, 42 changer transitions 25/175 dead transitions. [2024-11-17 03:23:17,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 175 transitions, 1507 flow [2024-11-17 03:23:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:23:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-17 03:23:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 248 transitions. [2024-11-17 03:23:17,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38509316770186336 [2024-11-17 03:23:17,058 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 664 flow. Second operand 14 states and 248 transitions. [2024-11-17 03:23:17,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 175 transitions, 1507 flow [2024-11-17 03:23:17,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 175 transitions, 1434 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-11-17 03:23:17,064 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 939 flow [2024-11-17 03:23:17,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=939, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2024-11-17 03:23:17,065 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2024-11-17 03:23:17,065 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 939 flow [2024-11-17 03:23:17,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:17,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:17,066 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:17,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:23:17,066 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:17,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -616482526, now seen corresponding path program 4 times [2024-11-17 03:23:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604453848] [2024-11-17 03:23:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:17,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-11-17 03:23:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604453848] [2024-11-17 03:23:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604453848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:17,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:17,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:23:17,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685506605] [2024-11-17 03:23:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:23:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:23:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:23:17,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:17,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 939 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:17,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:17,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:17,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:18,572 INFO L124 PetriNetUnfolderBase]: 1944/3017 cut-off events. [2024-11-17 03:23:18,572 INFO L125 PetriNetUnfolderBase]: For 11665/11668 co-relation queries the response was YES. [2024-11-17 03:23:18,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11942 conditions, 3017 events. 1944/3017 cut-off events. For 11665/11668 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14337 event pairs, 400 based on Foata normal form. 8/3023 useless extension candidates. Maximal degree in co-relation 11912. Up to 1255 conditions per place. [2024-11-17 03:23:18,591 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 87 selfloop transitions, 35 changer transitions 44/171 dead transitions. [2024-11-17 03:23:18,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 171 transitions, 1717 flow [2024-11-17 03:23:18,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:23:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:23:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-11-17 03:23:18,593 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39723320158102765 [2024-11-17 03:23:18,593 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 939 flow. Second operand 11 states and 201 transitions. [2024-11-17 03:23:18,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 171 transitions, 1717 flow [2024-11-17 03:23:18,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 171 transitions, 1591 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-11-17 03:23:18,609 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 976 flow [2024-11-17 03:23:18,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=976, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2024-11-17 03:23:18,610 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2024-11-17 03:23:18,610 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 976 flow [2024-11-17 03:23:18,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:18,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:18,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:18,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:23:18,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:18,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -295546882, now seen corresponding path program 5 times [2024-11-17 03:23:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:18,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088079583] [2024-11-17 03:23:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:18,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088079583] [2024-11-17 03:23:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088079583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:23:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314552246] [2024-11-17 03:23:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:23:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:23:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:23:19,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:19,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 976 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:19,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:19,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:19,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:19,654 INFO L124 PetriNetUnfolderBase]: 2506/3860 cut-off events. [2024-11-17 03:23:19,654 INFO L125 PetriNetUnfolderBase]: For 16549/16549 co-relation queries the response was YES. [2024-11-17 03:23:19,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15457 conditions, 3860 events. 2506/3860 cut-off events. For 16549/16549 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19059 event pairs, 910 based on Foata normal form. 8/3867 useless extension candidates. Maximal degree in co-relation 15425. Up to 1827 conditions per place. [2024-11-17 03:23:19,674 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 101 selfloop transitions, 26 changer transitions 39/171 dead transitions. [2024-11-17 03:23:19,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 171 transitions, 1763 flow [2024-11-17 03:23:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:23:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:23:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-17 03:23:19,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4320652173913043 [2024-11-17 03:23:19,675 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 976 flow. Second operand 8 states and 159 transitions. [2024-11-17 03:23:19,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 171 transitions, 1763 flow [2024-11-17 03:23:19,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 171 transitions, 1686 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-17 03:23:19,693 INFO L231 Difference]: Finished difference. Result has 95 places, 96 transitions, 1011 flow [2024-11-17 03:23:19,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1011, PETRI_PLACES=95, PETRI_TRANSITIONS=96} [2024-11-17 03:23:19,693 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2024-11-17 03:23:19,693 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 96 transitions, 1011 flow [2024-11-17 03:23:19,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:19,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:19,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:19,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 03:23:19,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:19,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1698258586, now seen corresponding path program 6 times [2024-11-17 03:23:19,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318201729] [2024-11-17 03:23:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:20,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318201729] [2024-11-17 03:23:20,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318201729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:20,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:20,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:23:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254545202] [2024-11-17 03:23:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:23:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:23:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:23:20,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:20,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 1011 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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-11-17 03:23:20,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:20,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:20,571 INFO L124 PetriNetUnfolderBase]: 2310/3577 cut-off events. [2024-11-17 03:23:20,572 INFO L125 PetriNetUnfolderBase]: For 14045/14048 co-relation queries the response was YES. [2024-11-17 03:23:20,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14056 conditions, 3577 events. 2310/3577 cut-off events. For 14045/14048 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17574 event pairs, 530 based on Foata normal form. 8/3583 useless extension candidates. Maximal degree in co-relation 14024. Up to 1807 conditions per place. [2024-11-17 03:23:20,593 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 82 selfloop transitions, 30 changer transitions 22/139 dead transitions. [2024-11-17 03:23:20,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 139 transitions, 1481 flow [2024-11-17 03:23:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:23:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:23:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-11-17 03:23:20,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2024-11-17 03:23:20,598 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 1011 flow. Second operand 8 states and 148 transitions. [2024-11-17 03:23:20,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 139 transitions, 1481 flow [2024-11-17 03:23:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 139 transitions, 1438 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-11-17 03:23:20,614 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 1039 flow [2024-11-17 03:23:20,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1039, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-11-17 03:23:20,614 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2024-11-17 03:23:20,615 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 1039 flow [2024-11-17 03:23:20,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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-11-17 03:23:20,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:20,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:23:20,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -436801472, now seen corresponding path program 7 times [2024-11-17 03:23:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765377996] [2024-11-17 03:23:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:21,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765377996] [2024-11-17 03:23:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765377996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:21,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:23:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107342123] [2024-11-17 03:23:21,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:21,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:23:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:21,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:23:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:23:21,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:21,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 1039 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:21,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:21,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:21,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:22,591 INFO L124 PetriNetUnfolderBase]: 2491/3867 cut-off events. [2024-11-17 03:23:22,591 INFO L125 PetriNetUnfolderBase]: For 15756/15756 co-relation queries the response was YES. [2024-11-17 03:23:22,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15382 conditions, 3867 events. 2491/3867 cut-off events. For 15756/15756 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19229 event pairs, 376 based on Foata normal form. 8/3874 useless extension candidates. Maximal degree in co-relation 15349. Up to 2051 conditions per place. [2024-11-17 03:23:22,617 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 98 selfloop transitions, 39 changer transitions 38/180 dead transitions. [2024-11-17 03:23:22,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 180 transitions, 1800 flow [2024-11-17 03:23:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:23:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:23:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 217 transitions. [2024-11-17 03:23:22,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39311594202898553 [2024-11-17 03:23:22,619 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 1039 flow. Second operand 12 states and 217 transitions. [2024-11-17 03:23:22,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 180 transitions, 1800 flow [2024-11-17 03:23:22,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 180 transitions, 1687 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-11-17 03:23:22,637 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 1120 flow [2024-11-17 03:23:22,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1120, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-17 03:23:22,637 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2024-11-17 03:23:22,637 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 1120 flow [2024-11-17 03:23:22,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:22,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:22,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:22,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 03:23:22,638 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash -390634378, now seen corresponding path program 8 times [2024-11-17 03:23:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162955405] [2024-11-17 03:23:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162955405] [2024-11-17 03:23:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162955405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:24,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 03:23:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230674090] [2024-11-17 03:23:24,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:23:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:23:24,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:23:24,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:24,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 1120 flow. Second operand has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:24,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:24,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:24,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:25,125 INFO L124 PetriNetUnfolderBase]: 2372/3674 cut-off events. [2024-11-17 03:23:25,125 INFO L125 PetriNetUnfolderBase]: For 18462/18462 co-relation queries the response was YES. [2024-11-17 03:23:25,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15629 conditions, 3674 events. 2372/3674 cut-off events. For 18462/18462 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 18148 event pairs, 344 based on Foata normal form. 8/3681 useless extension candidates. Maximal degree in co-relation 15595. Up to 2133 conditions per place. [2024-11-17 03:23:25,147 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 80 selfloop transitions, 57 changer transitions 29/171 dead transitions. [2024-11-17 03:23:25,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 171 transitions, 1874 flow [2024-11-17 03:23:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:23:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:23:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2024-11-17 03:23:25,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3713768115942029 [2024-11-17 03:23:25,148 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 1120 flow. Second operand 12 states and 205 transitions. [2024-11-17 03:23:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 171 transitions, 1874 flow [2024-11-17 03:23:25,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 171 transitions, 1811 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-11-17 03:23:25,167 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 1313 flow [2024-11-17 03:23:25,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1313, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2024-11-17 03:23:25,168 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2024-11-17 03:23:25,168 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 1313 flow [2024-11-17 03:23:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:25,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:25,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 03:23:25,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1905582634, now seen corresponding path program 9 times [2024-11-17 03:23:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028862073] [2024-11-17 03:23:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:26,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:26,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028862073] [2024-11-17 03:23:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028862073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:26,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:26,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:23:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498161869] [2024-11-17 03:23:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:26,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:23:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:23:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:23:26,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:26,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 1313 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:26,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:26,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:26,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:27,053 INFO L124 PetriNetUnfolderBase]: 2518/3918 cut-off events. [2024-11-17 03:23:27,053 INFO L125 PetriNetUnfolderBase]: For 24124/24124 co-relation queries the response was YES. [2024-11-17 03:23:27,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17007 conditions, 3918 events. 2518/3918 cut-off events. For 24124/24124 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19693 event pairs, 534 based on Foata normal form. 8/3925 useless extension candidates. Maximal degree in co-relation 16971. Up to 2921 conditions per place. [2024-11-17 03:23:27,078 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 95 selfloop transitions, 32 changer transitions 41/173 dead transitions. [2024-11-17 03:23:27,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 173 transitions, 1999 flow [2024-11-17 03:23:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:23:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-17 03:23:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 226 transitions. [2024-11-17 03:23:27,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3779264214046823 [2024-11-17 03:23:27,080 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 1313 flow. Second operand 13 states and 226 transitions. [2024-11-17 03:23:27,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 173 transitions, 1999 flow [2024-11-17 03:23:27,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 173 transitions, 1829 flow, removed 41 selfloop flow, removed 12 redundant places. [2024-11-17 03:23:27,112 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 1228 flow [2024-11-17 03:23:27,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1228, PETRI_PLACES=111, PETRI_TRANSITIONS=99} [2024-11-17 03:23:27,112 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2024-11-17 03:23:27,112 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 1228 flow [2024-11-17 03:23:27,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:27,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:27,112 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:27,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 03:23:27,113 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -66692218, now seen corresponding path program 10 times [2024-11-17 03:23:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:27,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442847030] [2024-11-17 03:23:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442847030] [2024-11-17 03:23:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442847030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:23:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582267128] [2024-11-17 03:23:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:27,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:23:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:27,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:23:27,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:23:27,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:27,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 99 transitions, 1228 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:27,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:27,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:27,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:28,627 INFO L124 PetriNetUnfolderBase]: 2511/3902 cut-off events. [2024-11-17 03:23:28,628 INFO L125 PetriNetUnfolderBase]: For 19828/19828 co-relation queries the response was YES. [2024-11-17 03:23:28,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16318 conditions, 3902 events. 2511/3902 cut-off events. For 19828/19828 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19628 event pairs, 371 based on Foata normal form. 8/3908 useless extension candidates. Maximal degree in co-relation 16282. Up to 2127 conditions per place. [2024-11-17 03:23:28,652 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 83 selfloop transitions, 19 changer transitions 41/148 dead transitions. [2024-11-17 03:23:28,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 148 transitions, 1710 flow [2024-11-17 03:23:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:23:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:23:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-11-17 03:23:28,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2024-11-17 03:23:28,653 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 1228 flow. Second operand 8 states and 148 transitions. [2024-11-17 03:23:28,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 148 transitions, 1710 flow [2024-11-17 03:23:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 1617 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-11-17 03:23:28,682 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 1045 flow [2024-11-17 03:23:28,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1045, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2024-11-17 03:23:28,682 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 56 predicate places. [2024-11-17 03:23:28,682 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 1045 flow [2024-11-17 03:23:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:28,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:28,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 03:23:28,683 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash -5554294, now seen corresponding path program 11 times [2024-11-17 03:23:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:28,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090270675] [2024-11-17 03:23:28,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:28,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:29,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090270675] [2024-11-17 03:23:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090270675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:23:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451674144] [2024-11-17 03:23:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:29,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:23:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:23:29,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:23:29,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:29,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 1045 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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-11-17 03:23:29,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:29,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:29,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:29,698 INFO L124 PetriNetUnfolderBase]: 2213/3468 cut-off events. [2024-11-17 03:23:29,698 INFO L125 PetriNetUnfolderBase]: For 16206/16206 co-relation queries the response was YES. [2024-11-17 03:23:29,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13996 conditions, 3468 events. 2213/3468 cut-off events. For 16206/16206 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17171 event pairs, 423 based on Foata normal form. 8/3474 useless extension candidates. Maximal degree in co-relation 13962. Up to 1676 conditions per place. [2024-11-17 03:23:29,715 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 77 selfloop transitions, 18 changer transitions 45/145 dead transitions. [2024-11-17 03:23:29,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 145 transitions, 1566 flow [2024-11-17 03:23:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:23:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:23:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-11-17 03:23:29,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2024-11-17 03:23:29,716 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 1045 flow. Second operand 9 states and 166 transitions. [2024-11-17 03:23:29,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 145 transitions, 1566 flow [2024-11-17 03:23:29,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 145 transitions, 1459 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-11-17 03:23:29,730 INFO L231 Difference]: Finished difference. Result has 105 places, 65 transitions, 608 flow [2024-11-17 03:23:29,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=105, PETRI_TRANSITIONS=65} [2024-11-17 03:23:29,731 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2024-11-17 03:23:29,731 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 65 transitions, 608 flow [2024-11-17 03:23:29,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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-11-17 03:23:29,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:29,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:29,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 03:23:29,731 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1855623298, now seen corresponding path program 12 times [2024-11-17 03:23:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810531748] [2024-11-17 03:23:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810531748] [2024-11-17 03:23:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810531748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:30,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:30,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:23:30,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483894135] [2024-11-17 03:23:30,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:30,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:23:30,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:23:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:23:30,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:30,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 65 transitions, 608 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:30,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:30,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:30,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:31,719 INFO L124 PetriNetUnfolderBase]: 1529/2429 cut-off events. [2024-11-17 03:23:31,719 INFO L125 PetriNetUnfolderBase]: For 8730/8730 co-relation queries the response was YES. [2024-11-17 03:23:31,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8961 conditions, 2429 events. 1529/2429 cut-off events. For 8730/8730 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11240 event pairs, 286 based on Foata normal form. 8/2436 useless extension candidates. Maximal degree in co-relation 8939. Up to 1289 conditions per place. [2024-11-17 03:23:31,731 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 66 selfloop transitions, 10 changer transitions 77/158 dead transitions. [2024-11-17 03:23:31,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 158 transitions, 1304 flow [2024-11-17 03:23:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 03:23:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-17 03:23:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 253 transitions. [2024-11-17 03:23:31,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-11-17 03:23:31,733 INFO L175 Difference]: Start difference. First operand has 105 places, 65 transitions, 608 flow. Second operand 15 states and 253 transitions. [2024-11-17 03:23:31,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 158 transitions, 1304 flow [2024-11-17 03:23:31,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 158 transitions, 1182 flow, removed 27 selfloop flow, removed 15 redundant places. [2024-11-17 03:23:31,767 INFO L231 Difference]: Finished difference. Result has 101 places, 56 transitions, 418 flow [2024-11-17 03:23:31,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=418, PETRI_PLACES=101, PETRI_TRANSITIONS=56} [2024-11-17 03:23:31,768 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2024-11-17 03:23:31,768 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 56 transitions, 418 flow [2024-11-17 03:23:31,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:31,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:31,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 03:23:31,768 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -471181142, now seen corresponding path program 13 times [2024-11-17 03:23:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274580076] [2024-11-17 03:23:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274580076] [2024-11-17 03:23:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274580076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:32,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:23:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699411021] [2024-11-17 03:23:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:32,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:23:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:23:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:23:32,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:32,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 56 transitions, 418 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:32,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:32,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:32,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:33,111 INFO L124 PetriNetUnfolderBase]: 1123/1799 cut-off events. [2024-11-17 03:23:33,112 INFO L125 PetriNetUnfolderBase]: For 4138/4138 co-relation queries the response was YES. [2024-11-17 03:23:33,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6200 conditions, 1799 events. 1123/1799 cut-off events. For 4138/4138 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7706 event pairs, 140 based on Foata normal form. 8/1806 useless extension candidates. Maximal degree in co-relation 6179. Up to 1210 conditions per place. [2024-11-17 03:23:33,120 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 52 selfloop transitions, 6 changer transitions 36/99 dead transitions. [2024-11-17 03:23:33,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 749 flow [2024-11-17 03:23:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:23:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:23:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-11-17 03:23:33,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3521739130434783 [2024-11-17 03:23:33,122 INFO L175 Difference]: Start difference. First operand has 101 places, 56 transitions, 418 flow. Second operand 10 states and 162 transitions. [2024-11-17 03:23:33,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 749 flow [2024-11-17 03:23:33,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 636 flow, removed 32 selfloop flow, removed 18 redundant places. [2024-11-17 03:23:33,129 INFO L231 Difference]: Finished difference. Result has 87 places, 49 transitions, 268 flow [2024-11-17 03:23:33,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=268, PETRI_PLACES=87, PETRI_TRANSITIONS=49} [2024-11-17 03:23:33,129 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2024-11-17 03:23:33,130 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 49 transitions, 268 flow [2024-11-17 03:23:33,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:33,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:33,130 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 03:23:33,130 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:33,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash -578108068, now seen corresponding path program 14 times [2024-11-17 03:23:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:33,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499426907] [2024-11-17 03:23:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:33,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499426907] [2024-11-17 03:23:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499426907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:23:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283642669] [2024-11-17 03:23:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:33,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:23:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:23:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:23:33,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:33,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 49 transitions, 268 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:33,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:33,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:33,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:34,447 INFO L124 PetriNetUnfolderBase]: 1090/1740 cut-off events. [2024-11-17 03:23:34,447 INFO L125 PetriNetUnfolderBase]: For 2018/2018 co-relation queries the response was YES. [2024-11-17 03:23:34,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 1740 events. 1090/1740 cut-off events. For 2018/2018 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7444 event pairs, 156 based on Foata normal form. 8/1747 useless extension candidates. Maximal degree in co-relation 5108. Up to 1115 conditions per place. [2024-11-17 03:23:34,456 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 53 selfloop transitions, 7 changer transitions 29/94 dead transitions. [2024-11-17 03:23:34,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 94 transitions, 586 flow [2024-11-17 03:23:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:23:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:23:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-11-17 03:23:34,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35434782608695653 [2024-11-17 03:23:34,457 INFO L175 Difference]: Start difference. First operand has 87 places, 49 transitions, 268 flow. Second operand 10 states and 163 transitions. [2024-11-17 03:23:34,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 94 transitions, 586 flow [2024-11-17 03:23:34,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 94 transitions, 519 flow, removed 15 selfloop flow, removed 17 redundant places. [2024-11-17 03:23:34,462 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 216 flow [2024-11-17 03:23:34,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2024-11-17 03:23:34,464 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-11-17 03:23:34,464 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 216 flow [2024-11-17 03:23:34,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:34,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:34,464 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:34,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 03:23:34,465 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:34,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1357914252, now seen corresponding path program 15 times [2024-11-17 03:23:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:34,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959982905] [2024-11-17 03:23:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:23:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959982905] [2024-11-17 03:23:35,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959982905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:35,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:35,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:23:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139764609] [2024-11-17 03:23:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:35,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:23:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:23:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:23:35,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:23:35,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:35,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 216 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:35,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:35,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:35,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:35,740 INFO L124 PetriNetUnfolderBase]: 1130/1844 cut-off events. [2024-11-17 03:23:35,740 INFO L125 PetriNetUnfolderBase]: For 1054/1054 co-relation queries the response was YES. [2024-11-17 03:23:35,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1844 events. 1130/1844 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8164 event pairs, 246 based on Foata normal form. 8/1851 useless extension candidates. Maximal degree in co-relation 4972. Up to 713 conditions per place. [2024-11-17 03:23:35,749 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 84 selfloop transitions, 9 changer transitions 28/126 dead transitions. [2024-11-17 03:23:35,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 720 flow [2024-11-17 03:23:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:23:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:23:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2024-11-17 03:23:35,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-11-17 03:23:35,750 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 216 flow. Second operand 12 states and 207 transitions. [2024-11-17 03:23:35,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 720 flow [2024-11-17 03:23:35,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 664 flow, removed 11 selfloop flow, removed 12 redundant places. [2024-11-17 03:23:35,753 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 223 flow [2024-11-17 03:23:35,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=223, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2024-11-17 03:23:35,754 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2024-11-17 03:23:35,754 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 223 flow [2024-11-17 03:23:35,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:35,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:35,755 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:35,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 03:23:35,755 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1506129858, now seen corresponding path program 16 times [2024-11-17 03:23:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:23:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114287666] [2024-11-17 03:23:35,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:23:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:23:35,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:23:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:23:35,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:23:35,896 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:23:35,899 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-17 03:23:35,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-17 03:23:35,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-17 03:23:35,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-17 03:23:35,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-17 03:23:35,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-17 03:23:35,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-17 03:23:35,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 03:23:35,904 INFO L407 BasicCegarLoop]: Path program histogram: [16, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:35,971 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:23:35,971 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:23:35,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:23:35 BasicIcfg [2024-11-17 03:23:35,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:23:35,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:23:35,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:23:35,976 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:23:35,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:22:52" (3/4) ... [2024-11-17 03:23:35,978 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:23:35,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:23:35,981 INFO L158 Benchmark]: Toolchain (without parser) took 44597.48ms. Allocated memory was 209.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 179.1MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 141.4MB. Max. memory is 16.1GB. [2024-11-17 03:23:35,981 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 134.2MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:23:35,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.98ms. Allocated memory is still 209.7MB. Free memory was 178.8MB in the beginning and 153.8MB in the end (delta: 25.0MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-17 03:23:35,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.02ms. Allocated memory is still 209.7MB. Free memory was 153.8MB in the beginning and 150.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:23:35,982 INFO L158 Benchmark]: Boogie Preprocessor took 71.50ms. Allocated memory is still 209.7MB. Free memory was 150.6MB in the beginning and 145.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:23:35,982 INFO L158 Benchmark]: IcfgBuilder took 852.66ms. Allocated memory is still 209.7MB. Free memory was 145.5MB in the beginning and 136.1MB in the end (delta: 9.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-17 03:23:35,982 INFO L158 Benchmark]: TraceAbstraction took 43135.70ms. Allocated memory was 209.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 136.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-17 03:23:35,982 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 2.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:23:35,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 134.2MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.98ms. Allocated memory is still 209.7MB. Free memory was 178.8MB in the beginning and 153.8MB in the end (delta: 25.0MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.02ms. Allocated memory is still 209.7MB. Free memory was 153.8MB in the beginning and 150.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.50ms. Allocated memory is still 209.7MB. Free memory was 150.6MB in the beginning and 145.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 852.66ms. Allocated memory is still 209.7MB. Free memory was 145.5MB in the beginning and 136.1MB in the end (delta: 9.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 43135.70ms. Allocated memory was 209.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 136.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 2.2GB. Free memory was 2.0GB in the beginning and 2.0GB 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-1, t2538=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 __assert_fail ("0", "safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 852]: 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: 850]: 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, 72 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: 43.0s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2194 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2189 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7723 IncrementalHoareTripleChecker+Invalid, 8058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 9 mSDtfsCounter, 7723 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1313occurred in iteration=19, InterpolantAutomatonStates: 242, 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.8s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 678 ConstructedInterpolants, 0 QuantifiedInterpolants, 7563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:23:36,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:23:38,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:23:38,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:23:38,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:23:38,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:23:38,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:23:38,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:23:38,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:23:38,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:23:38,253 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:23:38,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:23:38,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:23:38,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:23:38,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:23:38,254 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:23:38,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:23:38,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:23:38,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:23:38,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:23:38,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:23:38,258 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:23:38,260 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:23:38,260 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:23:38,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:23:38,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:23:38,261 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:23:38,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:23:38,262 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:23:38,262 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:23:38,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:23:38,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:23:38,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:23:38,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:23:38,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:23:38,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:23:38,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:23:38,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:23:38,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:23:38,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:23:38,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:23:38,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:23:38,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:23:38,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:23:38,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:23:38,267 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-17 03:23:38,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:23:38,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:23:38,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:23:38,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:23:38,573 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:23:38,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:23:39,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:23:40,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:23:40,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:23:40,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93555f8c/892ad80e1f2f49f29ac51afeccf3ab09/FLAG9f3ba5538 [2024-11-17 03:23:40,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93555f8c/892ad80e1f2f49f29ac51afeccf3ab09 [2024-11-17 03:23:40,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:23:40,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:23:40,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:23:40,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:23:40,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:23:40,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b978a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40, skipping insertion in model container [2024-11-17 03:23:40,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:23:40,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:23:40,599 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:23:40,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:23:40,692 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:23:40,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40 WrapperNode [2024-11-17 03:23:40,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:23:40,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:23:40,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:23:40,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:23:40,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,743 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-17 03:23:40,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:23:40,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:23:40,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:23:40,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:23:40,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,779 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:23:40,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:23:40,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:23:40,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:23:40,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:23:40,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (1/1) ... [2024-11-17 03:23:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:23:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:23:40,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:23:40,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:23:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:23:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:23:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:23:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:23:40,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:23:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:23:40,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:23:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:23:40,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:23:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:23:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:23:40,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:23:40,878 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:23:41,022 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:23:41,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:23:41,449 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:23:41,449 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:23:41,693 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:23:41,693 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:23:41,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:23:41 BoogieIcfgContainer [2024-11-17 03:23:41,694 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:23:41,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:23:41,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:23:41,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:23:41,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:23:40" (1/3) ... [2024-11-17 03:23:41,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc7ade0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:23:41, skipping insertion in model container [2024-11-17 03:23:41,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:40" (2/3) ... [2024-11-17 03:23:41,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc7ade0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:23:41, skipping insertion in model container [2024-11-17 03:23:41,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:23:41" (3/3) ... [2024-11-17 03:23:41,704 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:23:41,718 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:23:41,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:23:41,719 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:23:41,769 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:23:41,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-17 03:23:41,820 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-17 03:23:41,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:23:41,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-17 03:23:41,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-17 03:23:41,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-17 03:23:41,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:23:41,841 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;@40a5df2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:23:41,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-17 03:23:41,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:23:41,847 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-17 03:23:41,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:23:41,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:41,847 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:41,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:41,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash -87015745, now seen corresponding path program 1 times [2024-11-17 03:23:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243646307] [2024-11-17 03:23:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:41,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:41,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 03:23:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:41,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:23:41,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:42,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:42,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:42,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243646307] [2024-11-17 03:23:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243646307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:42,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:42,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:23:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207435501] [2024-11-17 03:23:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:42,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:23:42,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:42,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:23:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:23:42,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:42,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:42,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:42,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:42,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:43,270 INFO L124 PetriNetUnfolderBase]: 7377/10637 cut-off events. [2024-11-17 03:23:43,270 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-17 03:23:43,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21186 conditions, 10637 events. 7377/10637 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 58914 event pairs, 972 based on Foata normal form. 588/11210 useless extension candidates. Maximal degree in co-relation 21175. Up to 8856 conditions per place. [2024-11-17 03:23:43,330 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-17 03:23:43,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2024-11-17 03:23:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:23:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:23:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-17 03:23:43,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2024-11-17 03:23:43,345 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 88 transitions. [2024-11-17 03:23:43,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2024-11-17 03:23:43,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:23:43,350 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-17 03:23:43,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-17 03:23:43,354 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-17 03:23:43,355 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-17 03:23:43,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:43,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:43,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:43,363 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-11-17 03:23:43,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:43,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:43,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1289097542, now seen corresponding path program 1 times [2024-11-17 03:23:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:43,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809562135] [2024-11-17 03:23:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:43,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:43,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:43,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:43,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 03:23:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:43,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:23:43,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:43,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:43,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809562135] [2024-11-17 03:23:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809562135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:43,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:43,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:23:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591742542] [2024-11-17 03:23:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:43,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:23:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:23:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:23:43,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:43,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:43,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:43,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:43,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:44,403 INFO L124 PetriNetUnfolderBase]: 5083/8223 cut-off events. [2024-11-17 03:23:44,403 INFO L125 PetriNetUnfolderBase]: For 315/315 co-relation queries the response was YES. [2024-11-17 03:23:44,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16092 conditions, 8223 events. 5083/8223 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 51537 event pairs, 818 based on Foata normal form. 294/8502 useless extension candidates. Maximal degree in co-relation 16082. Up to 4502 conditions per place. [2024-11-17 03:23:44,441 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 62 selfloop transitions, 5 changer transitions 1/75 dead transitions. [2024-11-17 03:23:44,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 304 flow [2024-11-17 03:23:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:23:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:23:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-17 03:23:44,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-11-17 03:23:44,443 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 4 states and 110 transitions. [2024-11-17 03:23:44,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 304 flow [2024-11-17 03:23:44,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:44,447 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 116 flow [2024-11-17 03:23:44,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-11-17 03:23:44,448 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-17 03:23:44,449 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 116 flow [2024-11-17 03:23:44,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:44,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:44,450 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:44,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:23:44,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:44,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:44,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 459427646, now seen corresponding path program 1 times [2024-11-17 03:23:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480280976] [2024-11-17 03:23:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:44,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:44,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:44,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:44,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 (4)] Waiting until timeout for monitored process [2024-11-17 03:23:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:44,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:23:44,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:44,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:44,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480280976] [2024-11-17 03:23:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480280976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:44,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:23:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841761948] [2024-11-17 03:23:44,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:44,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:44,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:44,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:44,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:44,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:44,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:44,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:44,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:44,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:45,298 INFO L124 PetriNetUnfolderBase]: 2638/4248 cut-off events. [2024-11-17 03:23:45,299 INFO L125 PetriNetUnfolderBase]: For 739/739 co-relation queries the response was YES. [2024-11-17 03:23:45,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 4248 events. 2638/4248 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 22572 event pairs, 536 based on Foata normal form. 194/4427 useless extension candidates. Maximal degree in co-relation 9453. Up to 1317 conditions per place. [2024-11-17 03:23:45,317 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 79 selfloop transitions, 8 changer transitions 1/95 dead transitions. [2024-11-17 03:23:45,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 421 flow [2024-11-17 03:23:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:23:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:23:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-11-17 03:23:45,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-11-17 03:23:45,319 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 116 flow. Second operand 5 states and 140 transitions. [2024-11-17 03:23:45,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 421 flow [2024-11-17 03:23:45,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 411 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:45,323 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2024-11-17 03:23:45,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-11-17 03:23:45,323 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2024-11-17 03:23:45,324 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2024-11-17 03:23:45,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:45,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:45,324 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:45,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 03:23:45,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:45,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:45,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1503397949, now seen corresponding path program 1 times [2024-11-17 03:23:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:45,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926564889] [2024-11-17 03:23:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:45,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:45,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:23:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:45,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:23:45,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:45,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:45,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:45,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926564889] [2024-11-17 03:23:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926564889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:45,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:45,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:23:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984217273] [2024-11-17 03:23:45,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:45,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:23:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:23:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:23:45,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:45,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:45,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:45,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:45,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:46,158 INFO L124 PetriNetUnfolderBase]: 1585/2449 cut-off events. [2024-11-17 03:23:46,159 INFO L125 PetriNetUnfolderBase]: For 1362/1362 co-relation queries the response was YES. [2024-11-17 03:23:46,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6017 conditions, 2449 events. 1585/2449 cut-off events. For 1362/1362 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11157 event pairs, 487 based on Foata normal form. 64/2498 useless extension candidates. Maximal degree in co-relation 6003. Up to 918 conditions per place. [2024-11-17 03:23:46,171 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 66 selfloop transitions, 11 changer transitions 1/85 dead transitions. [2024-11-17 03:23:46,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 404 flow [2024-11-17 03:23:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:23:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:23:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-11-17 03:23:46,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-11-17 03:23:46,174 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 6 states and 140 transitions. [2024-11-17 03:23:46,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 404 flow [2024-11-17 03:23:46,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 379 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-17 03:23:46,186 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 170 flow [2024-11-17 03:23:46,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-17 03:23:46,187 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-11-17 03:23:46,187 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 170 flow [2024-11-17 03:23:46,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:46,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:46,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:46,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 03:23:46,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:46,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:46,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1051135670, now seen corresponding path program 1 times [2024-11-17 03:23:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56653830] [2024-11-17 03:23:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:46,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:46,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:46,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:46,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 03:23:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:46,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:23:46,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:46,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:46,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56653830] [2024-11-17 03:23:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56653830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:46,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:23:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104291956] [2024-11-17 03:23:46,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:46,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:23:46,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:23:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:23:46,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-17 03:23:46,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:46,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:46,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-17 03:23:46,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:46,709 INFO L124 PetriNetUnfolderBase]: 1469/2261 cut-off events. [2024-11-17 03:23:46,709 INFO L125 PetriNetUnfolderBase]: For 1292/1292 co-relation queries the response was YES. [2024-11-17 03:23:46,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5570 conditions, 2261 events. 1469/2261 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10066 event pairs, 1393 based on Foata normal form. 8/2254 useless extension candidates. Maximal degree in co-relation 5555. Up to 2226 conditions per place. [2024-11-17 03:23:46,719 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 35 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-17 03:23:46,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 242 flow [2024-11-17 03:23:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:23:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:23:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-17 03:23:46,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2024-11-17 03:23:46,720 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 170 flow. Second operand 3 states and 59 transitions. [2024-11-17 03:23:46,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 242 flow [2024-11-17 03:23:46,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 186 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-17 03:23:46,727 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 112 flow [2024-11-17 03:23:46,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-11-17 03:23:46,728 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-17 03:23:46,728 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 112 flow [2024-11-17 03:23:46,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:46,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:46,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:46,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 03:23:46,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:46,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:46,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1940292760, now seen corresponding path program 1 times [2024-11-17 03:23:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937535687] [2024-11-17 03:23:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:46,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:46,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:46,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:46,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 03:23:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:47,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:23:47,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:47,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:47,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937535687] [2024-11-17 03:23:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937535687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:47,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:23:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223086092] [2024-11-17 03:23:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:23:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:23:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:23:47,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:47,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:47,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:47,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:47,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:47,650 INFO L124 PetriNetUnfolderBase]: 2145/3313 cut-off events. [2024-11-17 03:23:47,650 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-11-17 03:23:47,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7234 conditions, 3313 events. 2145/3313 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15646 event pairs, 283 based on Foata normal form. 8/3310 useless extension candidates. Maximal degree in co-relation 7227. Up to 1696 conditions per place. [2024-11-17 03:23:47,662 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 55 selfloop transitions, 5 changer transitions 52/118 dead transitions. [2024-11-17 03:23:47,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 118 transitions, 533 flow [2024-11-17 03:23:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:23:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:23:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-11-17 03:23:47,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45169082125603865 [2024-11-17 03:23:47,664 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 112 flow. Second operand 9 states and 187 transitions. [2024-11-17 03:23:47,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 118 transitions, 533 flow [2024-11-17 03:23:47,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 118 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:23:47,666 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 148 flow [2024-11-17 03:23:47,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=148, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2024-11-17 03:23:47,667 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2024-11-17 03:23:47,667 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 148 flow [2024-11-17 03:23:47,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:47,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:47,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:47,673 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 (7)] Forceful destruction successful, exit code 0 [2024-11-17 03:23:47,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:47,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:47,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -846692048, now seen corresponding path program 2 times [2024-11-17 03:23:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:47,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174462103] [2024-11-17 03:23:47,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:23:47,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:47,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:47,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 03:23:47,952 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:23:47,952 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:23:47,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:23:47,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:48,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:48,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:48,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174462103] [2024-11-17 03:23:48,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174462103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:48,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:23:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694889067] [2024-11-17 03:23:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:48,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:23:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:48,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:23:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:23:48,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:48,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:48,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:48,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:48,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:48,918 INFO L124 PetriNetUnfolderBase]: 2893/4469 cut-off events. [2024-11-17 03:23:48,919 INFO L125 PetriNetUnfolderBase]: For 1169/1169 co-relation queries the response was YES. [2024-11-17 03:23:48,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10797 conditions, 4469 events. 2893/4469 cut-off events. For 1169/1169 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22889 event pairs, 651 based on Foata normal form. 8/4471 useless extension candidates. Maximal degree in co-relation 10783. Up to 1720 conditions per place. [2024-11-17 03:23:48,938 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 61 selfloop transitions, 5 changer transitions 54/126 dead transitions. [2024-11-17 03:23:48,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 126 transitions, 635 flow [2024-11-17 03:23:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:23:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:23:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-11-17 03:23:48,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47282608695652173 [2024-11-17 03:23:48,941 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 148 flow. Second operand 8 states and 174 transitions. [2024-11-17 03:23:48,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 126 transitions, 635 flow [2024-11-17 03:23:48,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 612 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-17 03:23:48,947 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 171 flow [2024-11-17 03:23:48,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=171, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-17 03:23:48,948 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2024-11-17 03:23:48,949 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 171 flow [2024-11-17 03:23:48,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:48,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:48,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:48,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 03:23:49,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:49,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -418667504, now seen corresponding path program 3 times [2024-11-17 03:23:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:49,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584328073] [2024-11-17 03:23:49,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:23:49,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:49,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:49,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:49,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 03:23:49,253 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 03:23:49,254 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:23:49,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:23:49,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:49,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:49,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584328073] [2024-11-17 03:23:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584328073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:23:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557677485] [2024-11-17 03:23:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:49,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:49,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:49,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:49,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:49,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:49,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:49,874 INFO L124 PetriNetUnfolderBase]: 2965/4633 cut-off events. [2024-11-17 03:23:49,874 INFO L125 PetriNetUnfolderBase]: For 1945/1958 co-relation queries the response was YES. [2024-11-17 03:23:49,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11471 conditions, 4633 events. 2965/4633 cut-off events. For 1945/1958 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 24582 event pairs, 1345 based on Foata normal form. 8/4630 useless extension candidates. Maximal degree in co-relation 11455. Up to 2603 conditions per place. [2024-11-17 03:23:49,890 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 52 selfloop transitions, 2 changer transitions 22/82 dead transitions. [2024-11-17 03:23:49,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 441 flow [2024-11-17 03:23:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:23:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:23:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-17 03:23:49,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2024-11-17 03:23:49,892 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 171 flow. Second operand 5 states and 108 transitions. [2024-11-17 03:23:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 441 flow [2024-11-17 03:23:49,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 414 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-17 03:23:49,895 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 167 flow [2024-11-17 03:23:49,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2024-11-17 03:23:49,896 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2024-11-17 03:23:49,896 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 167 flow [2024-11-17 03:23:49,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:49,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:49,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:49,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-17 03:23:50,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:50,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:50,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1403763812, now seen corresponding path program 4 times [2024-11-17 03:23:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:50,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204962047] [2024-11-17 03:23:50,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:23:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:50,101 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:50,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 03:23:50,186 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:23:50,186 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:23:50,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 03:23:50,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:50,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:50,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204962047] [2024-11-17 03:23:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204962047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:50,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:50,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:23:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235374403] [2024-11-17 03:23:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:50,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:23:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:23:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:23:50,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:50,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 167 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:50,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:50,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:50,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:50,948 INFO L124 PetriNetUnfolderBase]: 2087/3316 cut-off events. [2024-11-17 03:23:50,949 INFO L125 PetriNetUnfolderBase]: For 998/1001 co-relation queries the response was YES. [2024-11-17 03:23:50,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8112 conditions, 3316 events. 2087/3316 cut-off events. For 998/1001 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16441 event pairs, 548 based on Foata normal form. 16/3330 useless extension candidates. Maximal degree in co-relation 8098. Up to 1496 conditions per place. [2024-11-17 03:23:50,960 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 47 selfloop transitions, 5 changer transitions 87/145 dead transitions. [2024-11-17 03:23:50,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 145 transitions, 751 flow [2024-11-17 03:23:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:23:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:23:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2024-11-17 03:23:50,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44466403162055335 [2024-11-17 03:23:50,962 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 167 flow. Second operand 11 states and 225 transitions. [2024-11-17 03:23:50,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 145 transitions, 751 flow [2024-11-17 03:23:50,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 145 transitions, 725 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-17 03:23:50,966 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 182 flow [2024-11-17 03:23:50,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=182, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2024-11-17 03:23:50,966 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-11-17 03:23:50,966 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 182 flow [2024-11-17 03:23:50,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:50,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:50,967 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:50,974 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-11-17 03:23:51,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:51,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1652657192, now seen corresponding path program 5 times [2024-11-17 03:23:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002787485] [2024-11-17 03:23:51,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 03:23:51,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:51,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:51,174 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:51,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 03:23:51,257 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:23:51,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:23:51,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 03:23:51,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:23:51,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:51,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002787485] [2024-11-17 03:23:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002787485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:23:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603396847] [2024-11-17 03:23:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:51,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:23:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:23:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:23:51,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-17 03:23:51,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 45 transitions, 182 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:51,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:51,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-17 03:23:51,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:52,069 INFO L124 PetriNetUnfolderBase]: 806/1312 cut-off events. [2024-11-17 03:23:52,070 INFO L125 PetriNetUnfolderBase]: For 696/696 co-relation queries the response was YES. [2024-11-17 03:23:52,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 1312 events. 806/1312 cut-off events. For 696/696 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5342 event pairs, 108 based on Foata normal form. 8/1319 useless extension candidates. Maximal degree in co-relation 3451. Up to 618 conditions per place. [2024-11-17 03:23:52,074 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 45 selfloop transitions, 3 changer transitions 38/92 dead transitions. [2024-11-17 03:23:52,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 92 transitions, 507 flow [2024-11-17 03:23:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:23:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:23:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-11-17 03:23:52,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3864734299516908 [2024-11-17 03:23:52,076 INFO L175 Difference]: Start difference. First operand has 73 places, 45 transitions, 182 flow. Second operand 9 states and 160 transitions. [2024-11-17 03:23:52,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 92 transitions, 507 flow [2024-11-17 03:23:52,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 457 flow, removed 19 selfloop flow, removed 12 redundant places. [2024-11-17 03:23:52,079 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 145 flow [2024-11-17 03:23:52,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=145, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-11-17 03:23:52,080 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2024-11-17 03:23:52,080 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 145 flow [2024-11-17 03:23:52,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:52,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:52,080 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:52,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 03:23:52,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:52,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:23:52,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1069030666, now seen corresponding path program 6 times [2024-11-17 03:23:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784145281] [2024-11-17 03:23:52,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 03:23:52,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:52,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:52,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:23:52,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 03:23:52,364 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-17 03:23:52,364 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 03:23:52,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:23:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:23:52,500 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:23:52,500 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:23:52,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-17 03:23:52,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-17 03:23:52,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-17 03:23:52,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-17 03:23:52,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-17 03:23:52,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-17 03:23:52,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-17 03:23:52,511 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 (12)] Ended with exit code 0 [2024-11-17 03:23:52,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:23:52,707 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-17 03:23:52,767 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:23:52,767 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:23:52,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:23:52 BasicIcfg [2024-11-17 03:23:52,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:23:52,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:23:52,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:23:52,771 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:23:52,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:23:41" (3/4) ... [2024-11-17 03:23:52,773 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:23:52,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:23:52,774 INFO L158 Benchmark]: Toolchain (without parser) took 12605.09ms. Allocated memory was 73.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 52.9MB in the beginning and 1.0GB in the end (delta: -951.2MB). Peak memory consumption was 166.3MB. Max. memory is 16.1GB. [2024-11-17 03:23:52,775 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 73.4MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:23:52,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.10ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 52.9MB in the beginning and 75.5MB in the end (delta: -22.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-17 03:23:52,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.25ms. Allocated memory is still 104.9MB. Free memory was 75.5MB in the beginning and 73.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:23:52,775 INFO L158 Benchmark]: Boogie Preprocessor took 51.75ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 68.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:23:52,775 INFO L158 Benchmark]: IcfgBuilder took 897.22ms. Allocated memory is still 104.9MB. Free memory was 68.8MB in the beginning and 69.8MB in the end (delta: -1.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-17 03:23:52,775 INFO L158 Benchmark]: TraceAbstraction took 11074.15ms. Allocated memory was 104.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 69.1MB in the beginning and 1.0GB in the end (delta: -935.0MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. [2024-11-17 03:23:52,775 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 1.2GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:23:52,776 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.86ms. Allocated memory is still 73.4MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.10ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 52.9MB in the beginning and 75.5MB in the end (delta: -22.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.25ms. Allocated memory is still 104.9MB. Free memory was 75.5MB in the beginning and 73.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.75ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 68.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 897.22ms. Allocated memory is still 104.9MB. Free memory was 68.8MB in the beginning and 69.8MB in the end (delta: -1.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11074.15ms. Allocated memory was 104.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 69.1MB in the beginning and 1.0GB in the end (delta: -935.0MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 1.2GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=0, t2538=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=0, t2538=1, t2539=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=0, t2538=1, t2539=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=0, t2538=1, t2539=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=0, t2538=1, t2539=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 __assert_fail ("0", "safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 854]: 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: 852]: 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, 72 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: 10.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2166 IncrementalHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1 mSDtfsCounter, 2166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=9, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 293 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1254 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1309 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:23:52,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample