./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix021.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/mix021.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 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:11:57,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:11:57,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:11:57,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:11:57,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:11:57,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:11:57,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:11:57,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:11:57,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:11:57,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:11:57,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:11:57,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:11:57,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:11:57,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:11:57,877 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:11:57,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:11:57,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:11:57,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:11:57,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:11:57,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:11:57,879 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:11:57,880 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:11:57,880 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:11:57,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:11:57,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:11:57,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:11:57,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:11:57,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:11:57,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:11:57,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:11:57,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:11:57,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:11:57,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:11:57,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:11:57,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:11:57,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:11:57,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:11:57,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:11:57,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:11:57,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:11:57,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:11:57,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:11:57,888 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 -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db [2024-11-17 03:11:58,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:11:58,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:11:58,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:11:58,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:11:58,192 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:11:58,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021.opt.i [2024-11-17 03:11:59,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:12:00,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:12:00,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021.opt.i [2024-11-17 03:12:00,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db51720c3/86baa82e6e97497b92a939b91d7a134c/FLAG03e4c6ef8 [2024-11-17 03:12:00,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db51720c3/86baa82e6e97497b92a939b91d7a134c [2024-11-17 03:12:00,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:12:00,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:12:00,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:00,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:12:00,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:12:00,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:00" (1/1) ... [2024-11-17 03:12:00,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181e98b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:00, skipping insertion in model container [2024-11-17 03:12:00,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:00" (1/1) ... [2024-11-17 03:12:00,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:12:00,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:00,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:12:01,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:01,053 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:12:01,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01 WrapperNode [2024-11-17 03:12:01,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:01,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:01,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:12:01,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:12:01,064 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:12:01" (1/1) ... [2024-11-17 03:12:01,083 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:12:01" (1/1) ... [2024-11-17 03:12:01,128 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2024-11-17 03:12:01,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:01,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:12:01,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:12:01,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:12:01,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,188 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:12:01,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:12:01,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:12:01,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:12:01,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:12:01,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (1/1) ... [2024-11-17 03:12:01,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:12:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:12:01,261 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:12:01,264 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:12:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:12:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:12:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:12:01,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:12:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:12:01,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:12:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:12:01,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:12:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-17 03:12:01,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-17 03:12:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:12:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:12:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:12:01,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:12:01,307 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:12:01,444 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:12:01,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:12:01,863 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:12:01,863 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:12:02,139 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:12:02,139 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:12:02,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:02 BoogieIcfgContainer [2024-11-17 03:12:02,141 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:12:02,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:12:02,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:12:02,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:12:02,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:00" (1/3) ... [2024-11-17 03:12:02,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b7ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:02, skipping insertion in model container [2024-11-17 03:12:02,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:01" (2/3) ... [2024-11-17 03:12:02,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b7ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:02, skipping insertion in model container [2024-11-17 03:12:02,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:02" (3/3) ... [2024-11-17 03:12:02,150 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2024-11-17 03:12:02,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:12:02,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:12:02,166 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:12:02,234 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:12:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:12:02,317 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-17 03:12:02,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:02,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-11-17 03:12:02,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:12:02,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-17 03:12:02,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:12:02,351 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;@6bc08101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:12:02,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-17 03:12:02,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:12:02,365 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-17 03:12:02,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:02,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:02,366 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:02,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:02,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash 462503178, now seen corresponding path program 1 times [2024-11-17 03:12:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121434098] [2024-11-17 03:12:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:03,041 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:12:03,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121434098] [2024-11-17 03:12:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121434098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:03,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459576610] [2024-11-17 03:12:03,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:03,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:03,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:03,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:03,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:12:03,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:03,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:03,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:10,439 INFO L124 PetriNetUnfolderBase]: 50459/66999 cut-off events. [2024-11-17 03:12:10,440 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2024-11-17 03:12:10,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133619 conditions, 66999 events. 50459/66999 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 1891. Compared 395824 event pairs, 6395 based on Foata normal form. 3024/69996 useless extension candidates. Maximal degree in co-relation 133607. Up to 57025 conditions per place. [2024-11-17 03:12:10,934 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 58 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2024-11-17 03:12:10,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 276 flow [2024-11-17 03:12:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-17 03:12:10,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-11-17 03:12:10,950 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 103 transitions. [2024-11-17 03:12:10,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 276 flow [2024-11-17 03:12:10,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:10,965 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-17 03:12:10,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-17 03:12:10,975 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-17 03:12:10,976 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-17 03:12:10,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:12:10,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:10,976 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:10,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:12:10,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:10,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash 727746306, now seen corresponding path program 1 times [2024-11-17 03:12:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879745789] [2024-11-17 03:12:10,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:11,067 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:12:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879745789] [2024-11-17 03:12:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879745789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:11,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308078428] [2024-11-17 03:12:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:11,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:11,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-11-17 03:12:11,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:12:11,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:11,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-11-17 03:12:11,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:16,248 INFO L124 PetriNetUnfolderBase]: 45383/63867 cut-off events. [2024-11-17 03:12:16,249 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2024-11-17 03:12:16,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125841 conditions, 63867 events. 45383/63867 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 1912. Compared 420606 event pairs, 45383 based on Foata normal form. 1512/65136 useless extension candidates. Maximal degree in co-relation 125831. Up to 59508 conditions per place. [2024-11-17 03:12:16,623 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 35 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-17 03:12:16,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 174 flow [2024-11-17 03:12:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-17 03:12:16,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-11-17 03:12:16,625 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 71 transitions. [2024-11-17 03:12:16,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 174 flow [2024-11-17 03:12:16,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:16,641 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2024-11-17 03:12:16,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-17 03:12:16,642 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2024-11-17 03:12:16,642 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2024-11-17 03:12:16,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:12:16,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:16,643 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:12:16,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:16,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 727747039, now seen corresponding path program 1 times [2024-11-17 03:12:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:16,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447625995] [2024-11-17 03:12:16,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:16,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:16,839 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:12:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447625995] [2024-11-17 03:12:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447625995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:12:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375749615] [2024-11-17 03:12:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:12:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:12:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:12:16,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:16,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:12:16,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:16,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:16,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:20,566 INFO L124 PetriNetUnfolderBase]: 36511/52325 cut-off events. [2024-11-17 03:12:20,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:20,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101563 conditions, 52325 events. 36511/52325 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 353207 event pairs, 4407 based on Foata normal form. 1512/53818 useless extension candidates. Maximal degree in co-relation 101557. Up to 29929 conditions per place. [2024-11-17 03:12:20,903 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 75 selfloop transitions, 6 changer transitions 1/89 dead transitions. [2024-11-17 03:12:20,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 358 flow [2024-11-17 03:12:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:12:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:12:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-17 03:12:20,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-17 03:12:20,907 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 132 transitions. [2024-11-17 03:12:20,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 358 flow [2024-11-17 03:12:20,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:12:20,912 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow [2024-11-17 03:12:20,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-11-17 03:12:20,914 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-11-17 03:12:20,914 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow [2024-11-17 03:12:20,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:12:20,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:20,915 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:12:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:12:20,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:20,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash -252942245, now seen corresponding path program 1 times [2024-11-17 03:12:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:20,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671533572] [2024-11-17 03:12:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:21,143 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:12:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671533572] [2024-11-17 03:12:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671533572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:21,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:21,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:12:21,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693163015] [2024-11-17 03:12:21,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:21,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:12:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:12:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:12:21,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:21,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:12:21,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:21,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:21,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:23,604 INFO L124 PetriNetUnfolderBase]: 23071/33093 cut-off events. [2024-11-17 03:12:23,604 INFO L125 PetriNetUnfolderBase]: For 6328/6328 co-relation queries the response was YES. [2024-11-17 03:12:23,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73470 conditions, 33093 events. 23071/33093 cut-off events. For 6328/6328 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 206426 event pairs, 2563 based on Foata normal form. 1192/34266 useless extension candidates. Maximal degree in co-relation 73461. Up to 13513 conditions per place. [2024-11-17 03:12:23,815 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 97 selfloop transitions, 10 changer transitions 1/115 dead transitions. [2024-11-17 03:12:23,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 518 flow [2024-11-17 03:12:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:12:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:12:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-11-17 03:12:23,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-11-17 03:12:23,819 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 170 transitions. [2024-11-17 03:12:23,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 518 flow [2024-11-17 03:12:23,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 507 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:23,839 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow [2024-11-17 03:12:23,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-11-17 03:12:23,841 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-11-17 03:12:23,842 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow [2024-11-17 03:12:23,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:12:23,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:23,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:23,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:12:23,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:23,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1915303561, now seen corresponding path program 1 times [2024-11-17 03:12:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310036581] [2024-11-17 03:12:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:24,049 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:12:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310036581] [2024-11-17 03:12:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310036581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:24,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:24,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:12:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944571849] [2024-11-17 03:12:24,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:24,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:12:24,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:24,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:12:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:12:24,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:24,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:12:24,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:24,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:24,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:25,972 INFO L124 PetriNetUnfolderBase]: 13599/19125 cut-off events. [2024-11-17 03:12:25,973 INFO L125 PetriNetUnfolderBase]: For 11698/11698 co-relation queries the response was YES. [2024-11-17 03:12:26,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46830 conditions, 19125 events. 13599/19125 cut-off events. For 11698/11698 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 104471 event pairs, 2215 based on Foata normal form. 584/19690 useless extension candidates. Maximal degree in co-relation 46819. Up to 5388 conditions per place. [2024-11-17 03:12:26,081 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 117 selfloop transitions, 14 changer transitions 1/139 dead transitions. [2024-11-17 03:12:26,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 139 transitions, 677 flow [2024-11-17 03:12:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:12:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:12:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-11-17 03:12:26,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-11-17 03:12:26,083 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 206 transitions. [2024-11-17 03:12:26,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 139 transitions, 677 flow [2024-11-17 03:12:26,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 139 transitions, 647 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:26,184 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow [2024-11-17 03:12:26,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-11-17 03:12:26,185 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2024-11-17 03:12:26,185 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow [2024-11-17 03:12:26,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:12:26,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:26,186 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:12:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:12:26,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:26,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1294864783, now seen corresponding path program 1 times [2024-11-17 03:12:26,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:26,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997449250] [2024-11-17 03:12:26,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:26,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:26,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:12:26,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997449250] [2024-11-17 03:12:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997449250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:26,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:26,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:12:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162964525] [2024-11-17 03:12:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:12:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:12:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:12:26,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:26,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:12:26,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:26,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:26,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:27,740 INFO L124 PetriNetUnfolderBase]: 10399/14269 cut-off events. [2024-11-17 03:12:27,740 INFO L125 PetriNetUnfolderBase]: For 11290/11290 co-relation queries the response was YES. [2024-11-17 03:12:27,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36439 conditions, 14269 events. 10399/14269 cut-off events. For 11290/11290 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 73518 event pairs, 2043 based on Foata normal form. 152/14402 useless extension candidates. Maximal degree in co-relation 36427. Up to 5376 conditions per place. [2024-11-17 03:12:27,811 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 101 selfloop transitions, 18 changer transitions 1/127 dead transitions. [2024-11-17 03:12:27,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 639 flow [2024-11-17 03:12:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:12:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:12:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2024-11-17 03:12:27,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.544973544973545 [2024-11-17 03:12:27,813 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 206 transitions. [2024-11-17 03:12:27,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 639 flow [2024-11-17 03:12:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 127 transitions, 593 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-17 03:12:27,948 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow [2024-11-17 03:12:27,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-11-17 03:12:27,949 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-11-17 03:12:27,949 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow [2024-11-17 03:12:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:12:27,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:27,950 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:12:27,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 88731111, now seen corresponding path program 1 times [2024-11-17 03:12:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430716277] [2024-11-17 03:12:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:27,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:28,464 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:12:28,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430716277] [2024-11-17 03:12:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430716277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:12:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49300530] [2024-11-17 03:12:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:28,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:12:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:28,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:12:28,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:12:28,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:28,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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:12:28,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:28,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:28,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:30,675 INFO L124 PetriNetUnfolderBase]: 18083/24723 cut-off events. [2024-11-17 03:12:30,676 INFO L125 PetriNetUnfolderBase]: For 19022/19022 co-relation queries the response was YES. [2024-11-17 03:12:30,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63010 conditions, 24723 events. 18083/24723 cut-off events. For 19022/19022 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 135987 event pairs, 2305 based on Foata normal form. 16/24729 useless extension candidates. Maximal degree in co-relation 62997. Up to 10900 conditions per place. [2024-11-17 03:12:30,838 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 101 selfloop transitions, 15 changer transitions 38/161 dead transitions. [2024-11-17 03:12:30,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 161 transitions, 1017 flow [2024-11-17 03:12:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:12:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:12:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2024-11-17 03:12:30,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-11-17 03:12:30,840 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 7 states and 203 transitions. [2024-11-17 03:12:30,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 161 transitions, 1017 flow [2024-11-17 03:12:31,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 161 transitions, 756 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-11-17 03:12:31,105 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 262 flow [2024-11-17 03:12:31,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-11-17 03:12:31,106 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-11-17 03:12:31,106 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 262 flow [2024-11-17 03:12:31,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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:12:31,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:31,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:31,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:12:31,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:31,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash -345422711, now seen corresponding path program 2 times [2024-11-17 03:12:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888104097] [2024-11-17 03:12:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:31,453 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:12:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888104097] [2024-11-17 03:12:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888104097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:12:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152873019] [2024-11-17 03:12:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:31,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:12:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:12:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:12:31,461 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:31,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:31,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:31,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:31,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:34,551 INFO L124 PetriNetUnfolderBase]: 27249/37405 cut-off events. [2024-11-17 03:12:34,551 INFO L125 PetriNetUnfolderBase]: For 22810/22813 co-relation queries the response was YES. [2024-11-17 03:12:34,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100344 conditions, 37405 events. 27249/37405 cut-off events. For 22810/22813 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 219010 event pairs, 11041 based on Foata normal form. 16/37398 useless extension candidates. Maximal degree in co-relation 100331. Up to 20579 conditions per place. [2024-11-17 03:12:34,728 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 76 selfloop transitions, 4 changer transitions 38/125 dead transitions. [2024-11-17 03:12:34,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 701 flow [2024-11-17 03:12:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:12:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:12:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-17 03:12:34,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2024-11-17 03:12:34,729 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 262 flow. Second operand 5 states and 136 transitions. [2024-11-17 03:12:34,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 701 flow [2024-11-17 03:12:34,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 125 transitions, 695 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:34,738 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 261 flow [2024-11-17 03:12:34,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-11-17 03:12:34,739 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-11-17 03:12:34,739 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 261 flow [2024-11-17 03:12:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:34,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:34,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:34,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:12:34,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:34,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2133063453, now seen corresponding path program 3 times [2024-11-17 03:12:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413327114] [2024-11-17 03:12:34,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:35,091 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:12:35,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:35,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413327114] [2024-11-17 03:12:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413327114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:35,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:35,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:12:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658946652] [2024-11-17 03:12:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:35,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:12:35,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:35,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:12:35,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:12:35,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:35,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 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:12:35,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:35,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:35,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:36,997 INFO L124 PetriNetUnfolderBase]: 17595/24368 cut-off events. [2024-11-17 03:12:36,998 INFO L125 PetriNetUnfolderBase]: For 15225/15225 co-relation queries the response was YES. [2024-11-17 03:12:37,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66225 conditions, 24368 events. 17595/24368 cut-off events. For 15225/15225 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 133818 event pairs, 2459 based on Foata normal form. 16/24382 useless extension candidates. Maximal degree in co-relation 66210. Up to 8938 conditions per place. [2024-11-17 03:12:37,125 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 69 selfloop transitions, 9 changer transitions 84/169 dead transitions. [2024-11-17 03:12:37,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 169 transitions, 947 flow [2024-11-17 03:12:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:12:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:12:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-11-17 03:12:37,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-17 03:12:37,127 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 261 flow. Second operand 8 states and 216 transitions. [2024-11-17 03:12:37,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 169 transitions, 947 flow [2024-11-17 03:12:37,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 169 transitions, 921 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:37,134 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 251 flow [2024-11-17 03:12:37,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-11-17 03:12:37,135 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-11-17 03:12:37,136 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 251 flow [2024-11-17 03:12:37,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 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:12:37,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:37,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:37,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:12:37,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:37,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1968729807, now seen corresponding path program 4 times [2024-11-17 03:12:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960822617] [2024-11-17 03:12:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:37,458 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:12:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960822617] [2024-11-17 03:12:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960822617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:37,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:12:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828146637] [2024-11-17 03:12:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:12:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:12:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:12:37,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:37,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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:12:37,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:37,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:37,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:39,080 INFO L124 PetriNetUnfolderBase]: 11427/16195 cut-off events. [2024-11-17 03:12:39,081 INFO L125 PetriNetUnfolderBase]: For 12878/12878 co-relation queries the response was YES. [2024-11-17 03:12:39,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43238 conditions, 16195 events. 11427/16195 cut-off events. For 12878/12878 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 87956 event pairs, 2355 based on Foata normal form. 16/16210 useless extension candidates. Maximal degree in co-relation 43221. Up to 8888 conditions per place. [2024-11-17 03:12:39,236 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 67 selfloop transitions, 6 changer transitions 43/123 dead transitions. [2024-11-17 03:12:39,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 688 flow [2024-11-17 03:12:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:12:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:12:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-11-17 03:12:39,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-11-17 03:12:39,238 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 251 flow. Second operand 6 states and 158 transitions. [2024-11-17 03:12:39,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 688 flow [2024-11-17 03:12:39,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 648 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-11-17 03:12:39,259 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 211 flow [2024-11-17 03:12:39,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2024-11-17 03:12:39,260 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2024-11-17 03:12:39,260 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 211 flow [2024-11-17 03:12:39,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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:12:39,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:39,261 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:39,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:12:39,263 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:39,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -765796015, now seen corresponding path program 5 times [2024-11-17 03:12:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626504603] [2024-11-17 03:12:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:41,208 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:12:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626504603] [2024-11-17 03:12:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626504603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:41,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:41,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:12:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809392934] [2024-11-17 03:12:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:41,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:12:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:41,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:12:41,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:12:41,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:41,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 211 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 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:12:41,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:41,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:41,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:41,972 INFO L124 PetriNetUnfolderBase]: 3791/5490 cut-off events. [2024-11-17 03:12:41,972 INFO L125 PetriNetUnfolderBase]: For 2726/2726 co-relation queries the response was YES. [2024-11-17 03:12:41,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13587 conditions, 5490 events. 3791/5490 cut-off events. For 2726/2726 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 25467 event pairs, 788 based on Foata normal form. 16/5506 useless extension candidates. Maximal degree in co-relation 13570. Up to 2394 conditions per place. [2024-11-17 03:12:41,991 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 65 selfloop transitions, 5 changer transitions 47/124 dead transitions. [2024-11-17 03:12:41,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 124 transitions, 674 flow [2024-11-17 03:12:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:12:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:12:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-11-17 03:12:41,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2024-11-17 03:12:41,993 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 211 flow. Second operand 10 states and 208 transitions. [2024-11-17 03:12:41,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 124 transitions, 674 flow [2024-11-17 03:12:41,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 124 transitions, 614 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-11-17 03:12:41,999 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 197 flow [2024-11-17 03:12:41,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=197, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2024-11-17 03:12:42,000 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-11-17 03:12:42,000 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 197 flow [2024-11-17 03:12:42,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 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:12:42,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:42,000 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:12:42,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:42,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 828421389, now seen corresponding path program 6 times [2024-11-17 03:12:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891008580] [2024-11-17 03:12:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:12:42,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:12:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:12:42,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:12:42,196 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:12:42,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-17 03:12:42,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-17 03:12:42,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-17 03:12:42,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-17 03:12:42,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-17 03:12:42,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-17 03:12:42,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-17 03:12:42,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-17 03:12:42,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:12:42,201 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:42,308 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:12:42,308 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:12:42,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:12:42 BasicIcfg [2024-11-17 03:12:42,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:12:42,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:12:42,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:12:42,314 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:12:42,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:02" (3/4) ... [2024-11-17 03:12:42,316 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:12:42,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:12:42,318 INFO L158 Benchmark]: Toolchain (without parser) took 41945.58ms. Allocated memory was 161.5MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 104.0MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-17 03:12:42,318 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 161.5MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:42,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 680.92ms. Allocated memory is still 161.5MB. Free memory was 103.7MB in the beginning and 77.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-17 03:12:42,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.73ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 73.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:12:42,319 INFO L158 Benchmark]: Boogie Preprocessor took 87.53ms. Allocated memory is still 161.5MB. Free memory was 73.9MB in the beginning and 70.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:12:42,319 INFO L158 Benchmark]: IcfgBuilder took 920.21ms. Allocated memory is still 161.5MB. Free memory was 70.1MB in the beginning and 91.8MB in the end (delta: -21.7MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-11-17 03:12:42,320 INFO L158 Benchmark]: TraceAbstraction took 40170.29ms. Allocated memory was 161.5MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 90.9MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-17 03:12:42,320 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 14.1GB. Free memory is still 11.6GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:42,321 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.22ms. Allocated memory is still 161.5MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 680.92ms. Allocated memory is still 161.5MB. Free memory was 103.7MB in the beginning and 77.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.73ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 73.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.53ms. Allocated memory is still 161.5MB. Free memory was 73.9MB in the beginning and 70.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 920.21ms. Allocated memory is still 161.5MB. Free memory was 70.1MB in the beginning and 91.8MB in the end (delta: -21.7MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * TraceAbstraction took 40170.29ms. Allocated memory was 161.5MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 90.9MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 14.1GB. Free memory is still 11.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L862] 0 pthread_t t557; [L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t558; [L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t559; [L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t560; [L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 z$flush_delayed = weak$$choice2 [L824] 4 z$mem_tmp = z [L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = z [L833] 4 z = z$flush_delayed ? z$mem_tmp : z [L834] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix021.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 867]: 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: 869]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 914 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2221 IncrementalHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 3 mSDtfsCounter, 2221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=7, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 1933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:12:42,359 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/mix021.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 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:12:45,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:12:45,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:12:45,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:12:45,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:12:45,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:12:45,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:12:45,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:12:45,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:12:45,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:12:45,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:12:45,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:12:45,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:12:45,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:12:45,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:12:45,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:12:45,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:12:45,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:12:45,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:12:45,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:12:45,492 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:12:45,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:12:45,493 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:12:45,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:12:45,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:12:45,494 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:12:45,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:12:45,494 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:12:45,494 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:12:45,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:12:45,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:12:45,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:12:45,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:12:45,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:12:45,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:12:45,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:12:45,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:12:45,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:12:45,499 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:12:45,499 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:12:45,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:12:45,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:12:45,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:12:45,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:12:45,500 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 -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db [2024-11-17 03:12:45,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:12:45,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:12:45,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:12:45,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:12:45,871 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:12:45,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021.opt.i [2024-11-17 03:12:47,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:12:47,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:12:47,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021.opt.i [2024-11-17 03:12:47,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db66bfd50/b53d9f5dce1b40139d2ac516e001fec8/FLAGcf3120415 [2024-11-17 03:12:47,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db66bfd50/b53d9f5dce1b40139d2ac516e001fec8 [2024-11-17 03:12:47,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:12:47,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:12:47,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:47,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:12:47,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:12:47,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:47" (1/1) ... [2024-11-17 03:12:47,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f40729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:47, skipping insertion in model container [2024-11-17 03:12:47,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:47" (1/1) ... [2024-11-17 03:12:48,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:12:48,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:48,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:12:48,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:48,636 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:12:48,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48 WrapperNode [2024-11-17 03:12:48,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:48,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:48,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:12:48,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:12:48,646 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:12:48" (1/1) ... [2024-11-17 03:12:48,671 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:12:48" (1/1) ... [2024-11-17 03:12:48,705 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2024-11-17 03:12:48,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:48,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:12:48,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:12:48,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:12:48,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,753 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:12:48,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:12:48,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:12:48,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:12:48,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:12:48,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (1/1) ... [2024-11-17 03:12:48,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:12:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:12:48,846 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:12:48,849 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:12:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:12:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:12:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:12:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:12:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:12:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:12:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:12:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:12:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:12:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-17 03:12:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-17 03:12:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:12:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:12:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:12:48,897 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:12:49,100 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:12:49,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:12:49,496 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:12:49,497 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:12:49,801 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:12:49,803 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:12:49,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:49 BoogieIcfgContainer [2024-11-17 03:12:49,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:12:49,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:12:49,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:12:49,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:12:49,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:47" (1/3) ... [2024-11-17 03:12:49,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7a6de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:49, skipping insertion in model container [2024-11-17 03:12:49,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:48" (2/3) ... [2024-11-17 03:12:49,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7a6de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:49, skipping insertion in model container [2024-11-17 03:12:49,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:49" (3/3) ... [2024-11-17 03:12:49,815 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2024-11-17 03:12:49,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:12:49,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:12:49,834 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:12:49,920 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:12:49,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:12:50,010 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-17 03:12:50,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:50,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-11-17 03:12:50,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:12:50,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-17 03:12:50,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:12:50,044 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;@92a9e74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:12:50,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-17 03:12:50,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:12:50,053 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-17 03:12:50,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:50,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:50,054 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:50,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:50,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1774362186, now seen corresponding path program 1 times [2024-11-17 03:12:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744180644] [2024-11-17 03:12:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:50,073 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:12:50,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:50,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:50,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 03:12:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:50,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:12:50,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:50,261 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:12:50,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:50,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:50,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744180644] [2024-11-17 03:12:50,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744180644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:50,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:50,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075525447] [2024-11-17 03:12:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:50,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:50,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:50,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:12:50,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:50,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:50,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:57,220 INFO L124 PetriNetUnfolderBase]: 50459/66999 cut-off events. [2024-11-17 03:12:57,221 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2024-11-17 03:12:57,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133619 conditions, 66999 events. 50459/66999 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 1891. Compared 395872 event pairs, 6395 based on Foata normal form. 3024/69996 useless extension candidates. Maximal degree in co-relation 133607. Up to 57025 conditions per place. [2024-11-17 03:12:57,726 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 58 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2024-11-17 03:12:57,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 276 flow [2024-11-17 03:12:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-17 03:12:57,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-11-17 03:12:57,744 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 103 transitions. [2024-11-17 03:12:57,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 276 flow [2024-11-17 03:12:57,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:57,761 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-17 03:12:57,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-17 03:12:57,769 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-17 03:12:57,769 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-17 03:12:57,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:12:57,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:57,770 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:57,776 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:12:57,970 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:12:57,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1806599428, now seen corresponding path program 1 times [2024-11-17 03:12:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810048120] [2024-11-17 03:12:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:57,974 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:12:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:57,977 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:12:57,979 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:12:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:58,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:12:58,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:58,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:58,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810048120] [2024-11-17 03:12:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810048120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:58,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:12:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910870335] [2024-11-17 03:12:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:58,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:12:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:12:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:12:58,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:12:58,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:12:58,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:58,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:12:58,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:02,202 INFO L124 PetriNetUnfolderBase]: 40307/58505 cut-off events. [2024-11-17 03:13:02,202 INFO L125 PetriNetUnfolderBase]: For 1712/1712 co-relation queries the response was YES. [2024-11-17 03:13:02,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114443 conditions, 58505 events. 40307/58505 cut-off events. For 1712/1712 co-relation queries the response was YES. Maximal size of possible extension queue 1808. Compared 409565 event pairs, 4407 based on Foata normal form. 1512/59998 useless extension candidates. Maximal degree in co-relation 114433. Up to 34917 conditions per place. [2024-11-17 03:13:02,514 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 76 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2024-11-17 03:13:02,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 370 flow [2024-11-17 03:13:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:13:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:13:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-17 03:13:02,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6157407407407407 [2024-11-17 03:13:02,517 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 4 states and 133 transitions. [2024-11-17 03:13:02,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 370 flow [2024-11-17 03:13:02,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:13:02,530 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 140 flow [2024-11-17 03:13:02,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-17 03:13:02,531 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-11-17 03:13:02,531 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 140 flow [2024-11-17 03:13:02,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:13:02,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:02,532 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:13:02,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-17 03:13:02,732 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:13:02,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:02,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1261697086, now seen corresponding path program 1 times [2024-11-17 03:13:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:13:02,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335276068] [2024-11-17 03:13:02,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:02,735 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:13:02,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:13:02,736 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:13:02,737 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:13:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:02,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:13:02,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:13:03,036 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:13:03,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:13:03,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:13:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335276068] [2024-11-17 03:13:03,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335276068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:03,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:13:03,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534154656] [2024-11-17 03:13:03,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:03,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:13:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:13:03,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:13:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:13:03,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:03,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:13:03,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:03,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:03,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:06,030 INFO L124 PetriNetUnfolderBase]: 24739/35929 cut-off events. [2024-11-17 03:13:06,030 INFO L125 PetriNetUnfolderBase]: For 6564/6564 co-relation queries the response was YES. [2024-11-17 03:13:06,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78793 conditions, 35929 events. 24739/35929 cut-off events. For 6564/6564 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 231463 event pairs, 2563 based on Foata normal form. 1192/37102 useless extension candidates. Maximal degree in co-relation 78781. Up to 15765 conditions per place.