./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX --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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:42:51,941 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:42:52,037 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-08 18:42:52,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:42:52,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:42:52,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:42:52,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:42:52,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:42:52,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:42:52,087 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:42:52,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:42:52,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:42:52,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:42:52,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:42:52,089 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:42:52,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:42:52,092 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:42:52,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:42:52,093 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:42:52,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:42:52,093 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 18:42:52,097 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-08 18:42:52,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-08 18:42:52,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:42:52,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:42:52,098 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:42:52,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 18:42:52,098 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:42:52,099 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:42:52,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:42:52,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:42:52,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:42:52,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:42:52,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:42:52,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:42:52,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:42:52,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:42:52,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:42:52,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:42:52,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:42:52,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:42:52,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:42:52,107 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX
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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c
[2024-11-08 18:42:52,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:42:52,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:42:52,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:42:52,417 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:42:52,418 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:42:52,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix011.opt.i
Unable to find full path for "g++"
[2024-11-08 18:42:54,483 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:42:54,727 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:42:54,728 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/sv-benchmarks/c/pthread-wmm/mix011.opt.i
[2024-11-08 18:42:54,745 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data/23016f2b1/10b3c1b622354e1ab75478c03d90b0d5/FLAG4bc9d1ddb
[2024-11-08 18:42:54,763 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data/23016f2b1/10b3c1b622354e1ab75478c03d90b0d5
[2024-11-08 18:42:54,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:42:54,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:42:54,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:42:54,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:42:54,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:42:54,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:42:54" (1/1) ...
[2024-11-08 18:42:54,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9475d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:54, skipping insertion in model container
[2024-11-08 18:42:54,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:42:54" (1/1) ...
[2024-11-08 18:42:54,834 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:42:55,377 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:42:55,392 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:42:55,493 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:42:55,549 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:42:55,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55 WrapperNode
[2024-11-08 18:42:55,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:42:55,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:42:55,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:42:55,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:42:55,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,632 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144
[2024-11-08 18:42:55,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:42:55,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:42:55,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:42:55,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:42:55,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,690 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-08 18:42:55,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:42:55,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:42:55,728 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:42:55,729 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:42:55,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (1/1) ...
[2024-11-08 18:42:55,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:42:55,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:42:55,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:42:55,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:42:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 18:42:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:42:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 18:42:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 18:42:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 18:42:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 18:42:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-08 18:42:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-08 18:42:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:42:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 18:42:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:42:55,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:42:55,802 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 18:42:55,953 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:42:55,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:42:56,385 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 18:42:56,386 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:42:56,690 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:42:56,691 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:42:56,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:42:56 BoogieIcfgContainer
[2024-11-08 18:42:56,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:42:56,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:42:56,695 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:42:56,698 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:42:56,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:42:54" (1/3) ...
[2024-11-08 18:42:56,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360b34d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:42:56, skipping insertion in model container
[2024-11-08 18:42:56,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:55" (2/3) ...
[2024-11-08 18:42:56,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360b34d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:42:56, skipping insertion in model container
[2024-11-08 18:42:56,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:42:56" (3/3) ...
[2024-11-08 18:42:56,703 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i
[2024-11-08 18:42:56,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:42:56,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 18:42:56,722 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 18:42:56,794 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 18:42:56,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow
[2024-11-08 18:42:56,861 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events.
[2024-11-08 18:42:56,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:42:56,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place.
[2024-11-08 18:42:56,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow
[2024-11-08 18:42:56,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow
[2024-11-08 18:42:56,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:42:56,884 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;@1cf587c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:42:56,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-08 18:42:56,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 18:42:56,892 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events.
[2024-11-08 18:42:56,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:42:56,892 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:42:56,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:42:56,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:42:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:42:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2040167228, now seen corresponding path program 1 times
[2024-11-08 18:42:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:42:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824067608]
[2024-11-08 18:42:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:42:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:42:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:42:57,496 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-08 18:42:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:42:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824067608]
[2024-11-08 18:42:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824067608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:42:57,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:42:57,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:42:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560236675]
[2024-11-08 18:42:57,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:42:57,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:42:57,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:42:57,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:42:57,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:42:57,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47
[2024-11-08 18:42:57,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-08 18:42:57,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:42:57,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47
[2024-11-08 18:42:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:42:57,906 INFO L124 PetriNetUnfolderBase]: 459/871 cut-off events.
[2024-11-08 18:42:57,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:42:57,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 871 events. 459/871 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5981 event pairs, 67 based on Foata normal form. 60/910 useless extension candidates. Maximal degree in co-relation 1599. Up to 585 conditions per place.
[2024-11-08 18:42:57,916 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 26 selfloop transitions, 2 changer transitions 2/50 dead transitions.
[2024-11-08 18:42:57,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 169 flow
[2024-11-08 18:42:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:42:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:42:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions.
[2024-11-08 18:42:57,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7375886524822695
[2024-11-08 18:42:57,935 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 104 transitions.
[2024-11-08 18:42:57,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 169 flow
[2024-11-08 18:42:57,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-08 18:42:57,944 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow
[2024-11-08 18:42:57,947 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39}
[2024-11-08 18:42:57,951 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places.
[2024-11-08 18:42:57,952 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow
[2024-11-08 18:42:57,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-08 18:42:57,952 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:42:57,952 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:42:57,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:42:57,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:42:57,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:42:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash -326082749, now seen corresponding path program 1 times
[2024-11-08 18:42:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:42:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453592658]
[2024-11-08 18:42:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:42:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:42:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:42:58,058 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-08 18:42:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:42:58,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453592658]
[2024-11-08 18:42:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453592658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:42:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:42:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:42:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425295288]
[2024-11-08 18:42:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:42:58,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:42:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:42:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:42:58,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:42:58,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47
[2024-11-08 18:42:58,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:42:58,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:42:58,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47
[2024-11-08 18:42:58,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:42:58,306 INFO L124 PetriNetUnfolderBase]: 400/818 cut-off events.
[2024-11-08 18:42:58,307 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES.
[2024-11-08 18:42:58,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 818 events. 400/818 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5745 event pairs, 400 based on Foata normal form. 30/815 useless extension candidates. Maximal degree in co-relation 1499. Up to 627 conditions per place.
[2024-11-08 18:42:58,313 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 17 selfloop transitions, 1 changer transitions 1/38 dead transitions.
[2024-11-08 18:42:58,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 124 flow
[2024-11-08 18:42:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:42:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:42:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions.
[2024-11-08 18:42:58,315 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844
[2024-11-08 18:42:58,316 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 86 transitions.
[2024-11-08 18:42:58,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 124 flow
[2024-11-08 18:42:58,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:42:58,318 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow
[2024-11-08 18:42:58,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37}
[2024-11-08 18:42:58,319 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places.
[2024-11-08 18:42:58,319 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow
[2024-11-08 18:42:58,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:42:58,319 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:42:58,319 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:42:58,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:42:58,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:42:58,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:42:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -326081384, now seen corresponding path program 1 times
[2024-11-08 18:42:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:42:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899515986]
[2024-11-08 18:42:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:42:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:42:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:42:58,622 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-08 18:42:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:42:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899515986]
[2024-11-08 18:42:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899515986] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:42:58,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:42:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:42:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698239558]
[2024-11-08 18:42:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:42:58,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:42:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:42:58,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:42:58,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:42:58,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47
[2024-11-08 18:42:58,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:42:58,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:42:58,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47
[2024-11-08 18:42:58,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:42:59,932 INFO L124 PetriNetUnfolderBase]: 3294/5590 cut-off events.
[2024-11-08 18:42:59,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:42:59,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10577 conditions, 5590 events. 3294/5590 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 41563 event pairs, 802 based on Foata normal form. 0/5386 useless extension candidates. Maximal degree in co-relation 10571. Up to 2096 conditions per place.
[2024-11-08 18:42:59,966 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 34 selfloop transitions, 7 changer transitions 72/126 dead transitions.
[2024-11-08 18:42:59,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 126 transitions, 488 flow
[2024-11-08 18:42:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:42:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 18:42:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions.
[2024-11-08 18:42:59,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6335697399527187
[2024-11-08 18:42:59,972 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 9 states and 268 transitions.
[2024-11-08 18:42:59,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 126 transitions, 488 flow
[2024-11-08 18:42:59,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 126 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 18:42:59,978 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 177 flow
[2024-11-08 18:42:59,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=42}
[2024-11-08 18:42:59,980 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places.
[2024-11-08 18:42:59,980 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 177 flow
[2024-11-08 18:42:59,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:42:59,981 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:42:59,981 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:42:59,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:42:59,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:42:59,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:42:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash -79062377, now seen corresponding path program 1 times
[2024-11-08 18:42:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:42:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387642274]
[2024-11-08 18:42:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:42:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:00,266 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-08 18:43:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:00,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387642274]
[2024-11-08 18:43:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387642274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:00,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:00,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:43:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560242733]
[2024-11-08 18:43:00,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:00,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:43:00,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:43:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:43:00,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47
[2024-11-08 18:43:00,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:00,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:00,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47
[2024-11-08 18:43:00,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:01,307 INFO L124 PetriNetUnfolderBase]: 2256/4138 cut-off events.
[2024-11-08 18:43:01,307 INFO L125 PetriNetUnfolderBase]: For 5496/5496 co-relation queries the response was YES.
[2024-11-08 18:43:01,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12070 conditions, 4138 events. 2256/4138 cut-off events. For 5496/5496 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 30245 event pairs, 466 based on Foata normal form. 120/4228 useless extension candidates. Maximal degree in co-relation 12055. Up to 1482 conditions per place.
[2024-11-08 18:43:01,340 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 41 selfloop transitions, 8 changer transitions 54/116 dead transitions.
[2024-11-08 18:43:01,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 116 transitions, 745 flow
[2024-11-08 18:43:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 18:43:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 18:43:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions.
[2024-11-08 18:43:01,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5659574468085107
[2024-11-08 18:43:01,342 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 177 flow. Second operand 10 states and 266 transitions.
[2024-11-08 18:43:01,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 116 transitions, 745 flow
[2024-11-08 18:43:01,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 116 transitions, 637 flow, removed 27 selfloop flow, removed 4 redundant places.
[2024-11-08 18:43:01,372 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 229 flow
[2024-11-08 18:43:01,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=229, PETRI_PLACES=68, PETRI_TRANSITIONS=46}
[2024-11-08 18:43:01,373 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places.
[2024-11-08 18:43:01,373 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 229 flow
[2024-11-08 18:43:01,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:01,373 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:01,373 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:01,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:43:01,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:01,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:01,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1410012614, now seen corresponding path program 1 times
[2024-11-08 18:43:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:01,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434345811]
[2024-11-08 18:43:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:01,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:01,706 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-08 18:43:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434345811]
[2024-11-08 18:43:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434345811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:01,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:01,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:43:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858920783]
[2024-11-08 18:43:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:01,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:43:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:43:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:01,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:01,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:01,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:01,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:01,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:02,529 INFO L124 PetriNetUnfolderBase]: 1788/3633 cut-off events.
[2024-11-08 18:43:02,530 INFO L125 PetriNetUnfolderBase]: For 6733/6736 co-relation queries the response was YES.
[2024-11-08 18:43:02,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10661 conditions, 3633 events. 1788/3633 cut-off events. For 6733/6736 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28320 event pairs, 820 based on Foata normal form. 98/3650 useless extension candidates. Maximal degree in co-relation 10639. Up to 2135 conditions per place.
[2024-11-08 18:43:02,610 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 37 selfloop transitions, 5 changer transitions 29/89 dead transitions.
[2024-11-08 18:43:02,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 587 flow
[2024-11-08 18:43:02,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 18:43:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-08 18:43:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions.
[2024-11-08 18:43:02,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5896656534954408
[2024-11-08 18:43:02,619 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 229 flow. Second operand 7 states and 194 transitions.
[2024-11-08 18:43:02,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 587 flow
[2024-11-08 18:43:02,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 555 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-11-08 18:43:02,703 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 271 flow
[2024-11-08 18:43:02,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=49}
[2024-11-08 18:43:02,704 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places.
[2024-11-08 18:43:02,704 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 271 flow
[2024-11-08 18:43:02,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:02,705 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:02,705 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 18:43:02,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1122829211, now seen corresponding path program 1 times
[2024-11-08 18:43:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135540155]
[2024-11-08 18:43:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:03,032 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-08 18:43:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135540155]
[2024-11-08 18:43:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135540155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:43:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458774008]
[2024-11-08 18:43:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:03,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:43:03,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:43:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:43:03,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47
[2024-11-08 18:43:03,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:03,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:03,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47
[2024-11-08 18:43:03,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:03,949 INFO L124 PetriNetUnfolderBase]: 1866/3539 cut-off events.
[2024-11-08 18:43:03,949 INFO L125 PetriNetUnfolderBase]: For 7048/7048 co-relation queries the response was YES.
[2024-11-08 18:43:03,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11077 conditions, 3539 events. 1866/3539 cut-off events. For 7048/7048 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 25670 event pairs, 357 based on Foata normal form. 88/3596 useless extension candidates. Maximal degree in co-relation 11053. Up to 1164 conditions per place.
[2024-11-08 18:43:03,981 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 53 selfloop transitions, 10 changer transitions 48/124 dead transitions.
[2024-11-08 18:43:03,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 124 transitions, 897 flow
[2024-11-08 18:43:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 18:43:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 18:43:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions.
[2024-11-08 18:43:03,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5680851063829787
[2024-11-08 18:43:03,983 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 271 flow. Second operand 10 states and 267 transitions.
[2024-11-08 18:43:03,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 124 transitions, 897 flow
[2024-11-08 18:43:04,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 124 transitions, 854 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-11-08 18:43:04,026 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 351 flow
[2024-11-08 18:43:04,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=351, PETRI_PLACES=75, PETRI_TRANSITIONS=53}
[2024-11-08 18:43:04,027 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places.
[2024-11-08 18:43:04,027 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 351 flow
[2024-11-08 18:43:04,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:04,028 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:04,028 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-08 18:43:04,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 18:43:04,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:04,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash -84525990, now seen corresponding path program 1 times
[2024-11-08 18:43:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751410954]
[2024-11-08 18:43:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:04,233 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-08 18:43:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751410954]
[2024-11-08 18:43:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751410954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:04,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:04,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:43:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640356497]
[2024-11-08 18:43:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:04,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:43:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:04,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:43:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:43:04,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:04,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:04,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:04,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:04,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:05,155 INFO L124 PetriNetUnfolderBase]: 2770/4700 cut-off events.
[2024-11-08 18:43:05,155 INFO L125 PetriNetUnfolderBase]: For 9578/9977 co-relation queries the response was YES.
[2024-11-08 18:43:05,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13577 conditions, 4700 events. 2770/4700 cut-off events. For 9578/9977 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 31430 event pairs, 404 based on Foata normal form. 235/4778 useless extension candidates. Maximal degree in co-relation 13549. Up to 2414 conditions per place.
[2024-11-08 18:43:05,199 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 52 selfloop transitions, 5 changer transitions 0/84 dead transitions.
[2024-11-08 18:43:05,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 629 flow
[2024-11-08 18:43:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:43:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 18:43:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions.
[2024-11-08 18:43:05,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6542553191489362
[2024-11-08 18:43:05,201 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 351 flow. Second operand 4 states and 123 transitions.
[2024-11-08 18:43:05,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 629 flow
[2024-11-08 18:43:05,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 607 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-08 18:43:05,246 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 367 flow
[2024-11-08 18:43:05,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=69, PETRI_TRANSITIONS=57}
[2024-11-08 18:43:05,247 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places.
[2024-11-08 18:43:05,247 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 367 flow
[2024-11-08 18:43:05,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:05,247 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:05,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:05,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 18:43:05,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash -930439468, now seen corresponding path program 1 times
[2024-11-08 18:43:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036861306]
[2024-11-08 18:43:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:05,685 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-08 18:43:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036861306]
[2024-11-08 18:43:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036861306] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:43:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623519736]
[2024-11-08 18:43:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:43:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:43:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:05,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:05,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 367 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-08 18:43:05,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:05,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:05,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:06,454 INFO L124 PetriNetUnfolderBase]: 2072/3592 cut-off events.
[2024-11-08 18:43:06,454 INFO L125 PetriNetUnfolderBase]: For 5756/6204 co-relation queries the response was YES.
[2024-11-08 18:43:06,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11098 conditions, 3592 events. 2072/3592 cut-off events. For 5756/6204 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22942 event pairs, 203 based on Foata normal form. 239/3699 useless extension candidates. Maximal degree in co-relation 11071. Up to 1112 conditions per place.
[2024-11-08 18:43:06,481 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 63 selfloop transitions, 8 changer transitions 0/98 dead transitions.
[2024-11-08 18:43:06,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 729 flow
[2024-11-08 18:43:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:43:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:43:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions.
[2024-11-08 18:43:06,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6638297872340425
[2024-11-08 18:43:06,483 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 367 flow. Second operand 5 states and 156 transitions.
[2024-11-08 18:43:06,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 729 flow
[2024-11-08 18:43:06,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 722 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-11-08 18:43:06,496 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 415 flow
[2024-11-08 18:43:06,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=72, PETRI_TRANSITIONS=61}
[2024-11-08 18:43:06,497 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places.
[2024-11-08 18:43:06,497 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 415 flow
[2024-11-08 18:43:06,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-08 18:43:06,498 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:06,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:06,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 18:43:06,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:06,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash 104529342, now seen corresponding path program 1 times
[2024-11-08 18:43:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:06,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826116396]
[2024-11-08 18:43:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:06,874 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-08 18:43:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:06,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826116396]
[2024-11-08 18:43:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826116396] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:06,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:06,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:43:06,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046046589]
[2024-11-08 18:43:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:06,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:43:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:43:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:43:06,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:06,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:06,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:06,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:06,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:07,500 INFO L124 PetriNetUnfolderBase]: 1624/2796 cut-off events.
[2024-11-08 18:43:07,500 INFO L125 PetriNetUnfolderBase]: For 7068/7722 co-relation queries the response was YES.
[2024-11-08 18:43:07,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9846 conditions, 2796 events. 1624/2796 cut-off events. For 7068/7722 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17490 event pairs, 175 based on Foata normal form. 177/2845 useless extension candidates. Maximal degree in co-relation 9818. Up to 1100 conditions per place.
[2024-11-08 18:43:07,517 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 56 selfloop transitions, 11 changer transitions 0/94 dead transitions.
[2024-11-08 18:43:07,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 709 flow
[2024-11-08 18:43:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:43:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 18:43:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions.
[2024-11-08 18:43:07,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6134751773049646
[2024-11-08 18:43:07,521 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 415 flow. Second operand 6 states and 173 transitions.
[2024-11-08 18:43:07,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 94 transitions, 709 flow
[2024-11-08 18:43:07,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 661 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-11-08 18:43:07,534 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 417 flow
[2024-11-08 18:43:07,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=73, PETRI_TRANSITIONS=62}
[2024-11-08 18:43:07,536 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2024-11-08 18:43:07,537 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 417 flow
[2024-11-08 18:43:07,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:07,537 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:07,537 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]
[2024-11-08 18:43:07,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 18:43:07,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:07,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash -150073575, now seen corresponding path program 1 times
[2024-11-08 18:43:07,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499989458]
[2024-11-08 18:43:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:07,934 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-08 18:43:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499989458]
[2024-11-08 18:43:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499989458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:07,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:43:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742752756]
[2024-11-08 18:43:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:07,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:43:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:43:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:43:07,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:07,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:07,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:07,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:07,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:08,586 INFO L124 PetriNetUnfolderBase]: 1334/2879 cut-off events.
[2024-11-08 18:43:08,586 INFO L125 PetriNetUnfolderBase]: For 6267/6591 co-relation queries the response was YES.
[2024-11-08 18:43:08,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9158 conditions, 2879 events. 1334/2879 cut-off events. For 6267/6591 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22312 event pairs, 414 based on Foata normal form. 44/2614 useless extension candidates. Maximal degree in co-relation 9132. Up to 1050 conditions per place.
[2024-11-08 18:43:08,607 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 31 selfloop transitions, 1 changer transitions 26/92 dead transitions.
[2024-11-08 18:43:08,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 651 flow
[2024-11-08 18:43:08,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:43:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 18:43:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions.
[2024-11-08 18:43:08,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432
[2024-11-08 18:43:08,609 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 417 flow. Second operand 6 states and 164 transitions.
[2024-11-08 18:43:08,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 651 flow
[2024-11-08 18:43:08,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 585 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-11-08 18:43:08,650 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 330 flow
[2024-11-08 18:43:08,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=77, PETRI_TRANSITIONS=57}
[2024-11-08 18:43:08,652 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places.
[2024-11-08 18:43:08,653 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 330 flow
[2024-11-08 18:43:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:08,654 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:08,654 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]
[2024-11-08 18:43:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 18:43:08,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1233706511, now seen corresponding path program 2 times
[2024-11-08 18:43:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233138105]
[2024-11-08 18:43:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:09,051 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-08 18:43:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233138105]
[2024-11-08 18:43:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233138105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:43:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346472147]
[2024-11-08 18:43:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:43:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:43:09,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:09,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:09,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-08 18:43:09,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:09,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:09,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:09,535 INFO L124 PetriNetUnfolderBase]: 1118/2482 cut-off events.
[2024-11-08 18:43:09,536 INFO L125 PetriNetUnfolderBase]: For 3392/3576 co-relation queries the response was YES.
[2024-11-08 18:43:09,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7079 conditions, 2482 events. 1118/2482 cut-off events. For 3392/3576 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19121 event pairs, 437 based on Foata normal form. 30/2229 useless extension candidates. Maximal degree in co-relation 7052. Up to 956 conditions per place.
[2024-11-08 18:43:09,552 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 23 selfloop transitions, 2 changer transitions 31/80 dead transitions.
[2024-11-08 18:43:09,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 518 flow
[2024-11-08 18:43:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:43:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:43:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions.
[2024-11-08 18:43:09,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638
[2024-11-08 18:43:09,553 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 330 flow. Second operand 5 states and 140 transitions.
[2024-11-08 18:43:09,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 518 flow
[2024-11-08 18:43:09,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 80 transitions, 507 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-08 18:43:09,580 INFO L231 Difference]: Finished difference. Result has 77 places, 45 transitions, 231 flow
[2024-11-08 18:43:09,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=77, PETRI_TRANSITIONS=45}
[2024-11-08 18:43:09,581 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places.
[2024-11-08 18:43:09,581 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 45 transitions, 231 flow
[2024-11-08 18:43:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-08 18:43:09,581 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:09,582 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]
[2024-11-08 18:43:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 18:43:09,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1793139937, now seen corresponding path program 3 times
[2024-11-08 18:43:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062429605]
[2024-11-08 18:43:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:43:09,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:43:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:43:09,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:43:09,784 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:43:09,786 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-08 18:43:09,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-08 18:43:09,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-08 18:43:09,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-08 18:43:09,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-08 18:43:09,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-08 18:43:09,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-08 18:43:09,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 18:43:09,789 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:09,885 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 18:43:09,885 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:43:09,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:43:09 BasicIcfg
[2024-11-08 18:43:09,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:43:09,893 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:43:09,893 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:43:09,893 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:43:09,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:42:56" (3/4) ...
[2024-11-08 18:43:09,896 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:43:09,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:43:09,899 INFO L158 Benchmark]: Toolchain (without parser) took 15130.09ms. Allocated memory was 190.8MB in the beginning and 775.9MB in the end (delta: 585.1MB). Free memory was 150.7MB in the beginning and 264.5MB in the end (delta: -113.7MB). Peak memory consumption was 474.5MB. Max. memory is 16.1GB.
[2024-11-08 18:43:09,900 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 138.4MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:43:09,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 781.99ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 124.0MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-11-08 18:43:09,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.24ms. Allocated memory is still 190.8MB. Free memory was 124.0MB in the beginning and 120.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:43:09,904 INFO L158 Benchmark]: Boogie Preprocessor took 83.29ms. Allocated memory is still 190.8MB. Free memory was 120.6MB in the beginning and 117.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:43:09,904 INFO L158 Benchmark]: RCFGBuilder took 967.38ms. Allocated memory is still 190.8MB. Free memory was 117.2MB in the beginning and 138.8MB in the end (delta: -21.6MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB.
[2024-11-08 18:43:09,904 INFO L158 Benchmark]: TraceAbstraction took 13196.74ms. Allocated memory was 190.8MB in the beginning and 775.9MB in the end (delta: 585.1MB). Free memory was 137.7MB in the beginning and 264.5MB in the end (delta: -126.8MB). Peak memory consumption was 458.5MB. Max. memory is 16.1GB.
[2024-11-08 18:43:09,905 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 775.9MB. Free memory is still 264.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:43:09,909 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.26ms. Allocated memory is still 138.4MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 781.99ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 124.0MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 85.24ms. Allocated memory is still 190.8MB. Free memory was 124.0MB in the beginning and 120.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 83.29ms. Allocated memory is still 190.8MB. Free memory was 120.6MB in the beginning and 117.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 967.38ms. Allocated memory is still 190.8MB. Free memory was 117.2MB in the beginning and 138.8MB in the end (delta: -21.6MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 13196.74ms. Allocated memory was 190.8MB in the beginning and 775.9MB in the end (delta: 585.1MB). Free memory was 137.7MB in the beginning and 264.5MB in the end (delta: -126.8MB). Peak memory consumption was 458.5MB. Max. memory is 16.1GB.
* Witness Printer took 4.03ms. Allocated memory is still 775.9MB. Free memory is still 264.5MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p1_EBX = 0;
[L715] 0 int __unbuffered_p2_EAX = 0;
[L717] 0 int __unbuffered_p2_EBX = 0;
[L719] 0 int a = 0;
[L720] 0 _Bool main$tmp_guard0;
[L721] 0 _Bool main$tmp_guard1;
[L723] 0 int x = 0;
[L725] 0 int y = 0;
[L727] 0 int z = 0;
[L728] 0 _Bool z$flush_delayed;
[L729] 0 int z$mem_tmp;
[L730] 0 _Bool z$r_buff0_thd0;
[L731] 0 _Bool z$r_buff0_thd1;
[L732] 0 _Bool z$r_buff0_thd2;
[L733] 0 _Bool z$r_buff0_thd3;
[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$read_delayed;
[L739] 0 int *z$read_delayed_var;
[L740] 0 int z$w_buff0;
[L741] 0 _Bool z$w_buff0_used;
[L742] 0 int z$w_buff1;
[L743] 0 _Bool z$w_buff1_used;
[L744] 0 _Bool weak$$choice0;
[L745] 0 _Bool weak$$choice2;
[L851] 0 pthread_t t284;
[L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L853] 0 pthread_t t285;
[L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=-3, t285=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L855] 0 pthread_t t286;
[L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=-3, t285=-2, t286=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L798] 3 z$w_buff1 = z$w_buff0
[L799] 3 z$w_buff0 = 1
[L800] 3 z$w_buff1_used = z$w_buff0_used
[L801] 3 z$w_buff0_used = (_Bool)1
[L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0
[L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1
[L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2
[L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3
[L807] 3 z$r_buff0_thd3 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L810] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L811] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L812] 3 z$flush_delayed = weak$$choice2
[L813] 3 z$mem_tmp = z
[L814] 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)
[L815] 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))
[L816] 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))
[L817] 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))
[L818] 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))
[L819] 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))
[L820] 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))
[L821] 3 __unbuffered_p2_EAX = z
[L822] 3 z = z$flush_delayed ? z$mem_tmp : z
[L823] 3 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L826] 3 __unbuffered_p2_EBX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L749] 1 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L752] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L764] 2 x = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L767] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L770] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L773] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L774] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L775] 2 z$flush_delayed = weak$$choice2
[L776] 2 z$mem_tmp = z
[L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 __unbuffered_p1_EBX = z
[L785] 2 z = z$flush_delayed ? z$mem_tmp : z
[L786] 2 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=-3, t285=-2, t286=-1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L860] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L860] RET 0 assume_abort_if_not(main$tmp_guard0)
[L862] 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)
[L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L864] 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
[L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L866] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=-3, t285=-2, t286=-1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=-3, t285=-2, t286=-1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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", "mix011.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 849]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 54 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=9, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 839 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-08 18:43:09,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX --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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:43:12,318 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:43:12,411 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-08 18:43:12,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:43:12,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:43:12,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:43:12,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:43:12,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:43:12,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:43:12,470 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:43:12,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:43:12,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:43:12,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:43:12,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:43:12,477 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:43:12,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:43:12,478 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:43:12,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:43:12,478 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:43:12,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:43:12,479 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 18:43:12,480 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-08 18:43:12,481 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-08 18:43:12,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:43:12,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:43:12,482 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 18:43:12,483 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:43:12,484 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 18:43:12,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 18:43:12,485 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:43:12,485 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:43:12,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:43:12,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:43:12,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:43:12,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:43:12,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:43:12,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:43:12,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:43:12,489 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 18:43:12,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 18:43:12,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:43:12,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:43:12,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:43:12,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:43:12,490 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX
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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c
[2024-11-08 18:43:12,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:43:12,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:43:12,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:43:12,926 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:43:12,927 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:43:12,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix011.opt.i
Unable to find full path for "g++"
[2024-11-08 18:43:15,074 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:43:15,372 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:43:15,373 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/sv-benchmarks/c/pthread-wmm/mix011.opt.i
[2024-11-08 18:43:15,388 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data/0f82efb2e/cf1244267aeb4c36980a4750103c633a/FLAG1766685c7
[2024-11-08 18:43:15,403 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/data/0f82efb2e/cf1244267aeb4c36980a4750103c633a
[2024-11-08 18:43:15,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:43:15,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:43:15,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:43:15,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:43:15,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:43:15,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:43:15" (1/1) ...
[2024-11-08 18:43:15,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f945fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:15, skipping insertion in model container
[2024-11-08 18:43:15,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:43:15" (1/1) ...
[2024-11-08 18:43:15,488 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:43:15,950 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:43:15,972 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:43:16,089 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:43:16,146 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:43:16,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16 WrapperNode
[2024-11-08 18:43:16,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:43:16,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:43:16,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:43:16,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:43:16,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,236 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145
[2024-11-08 18:43:16,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:43:16,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:43:16,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:43:16,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:43:16,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,293 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-08 18:43:16,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:43:16,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:43:16,333 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:43:16,334 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:43:16,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (1/1) ...
[2024-11-08 18:43:16,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:43:16,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:16,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:43:16,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:43:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 18:43:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:43:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 18:43:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 18:43:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 18:43:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 18:43:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 18:43:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-08 18:43:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-08 18:43:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 18:43:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:43:16,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:43:16,412 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 18:43:16,597 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:43:16,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:43:16,968 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 18:43:16,969 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:43:17,347 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:43:17,348 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:43:17,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:17 BoogieIcfgContainer
[2024-11-08 18:43:17,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:43:17,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:43:17,352 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:43:17,355 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:43:17,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:43:15" (1/3) ...
[2024-11-08 18:43:17,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249536fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:43:17, skipping insertion in model container
[2024-11-08 18:43:17,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:16" (2/3) ...
[2024-11-08 18:43:17,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249536fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:43:17, skipping insertion in model container
[2024-11-08 18:43:17,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:17" (3/3) ...
[2024-11-08 18:43:17,371 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i
[2024-11-08 18:43:17,391 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:43:17,391 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 18:43:17,391 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 18:43:17,470 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 18:43:17,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow
[2024-11-08 18:43:17,550 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events.
[2024-11-08 18:43:17,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:43:17,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place.
[2024-11-08 18:43:17,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow
[2024-11-08 18:43:17,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow
[2024-11-08 18:43:17,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:43:17,585 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;@1e2a09ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:43:17,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-08 18:43:17,596 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 18:43:17,596 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events.
[2024-11-08 18:43:17,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:43:17,597 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:17,597 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:17,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:17,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1015339580, now seen corresponding path program 1 times
[2024-11-08 18:43:17,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:17,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193612024]
[2024-11-08 18:43:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:17,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:17,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:17,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:17,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 18:43:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:17,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:17,777 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:17,823 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-08 18:43:17,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:17,824 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193612024]
[2024-11-08 18:43:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193612024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:43:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750365400]
[2024-11-08 18:43:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:17,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:43:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:43:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:43:17,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47
[2024-11-08 18:43:17,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-08 18:43:17,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:17,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47
[2024-11-08 18:43:17,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:18,353 INFO L124 PetriNetUnfolderBase]: 459/871 cut-off events.
[2024-11-08 18:43:18,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:43:18,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 871 events. 459/871 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5981 event pairs, 67 based on Foata normal form. 60/910 useless extension candidates. Maximal degree in co-relation 1599. Up to 585 conditions per place.
[2024-11-08 18:43:18,368 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 26 selfloop transitions, 2 changer transitions 2/50 dead transitions.
[2024-11-08 18:43:18,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 169 flow
[2024-11-08 18:43:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:43:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:43:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions.
[2024-11-08 18:43:18,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7375886524822695
[2024-11-08 18:43:18,385 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 104 transitions.
[2024-11-08 18:43:18,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 169 flow
[2024-11-08 18:43:18,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-08 18:43:18,393 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow
[2024-11-08 18:43:18,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39}
[2024-11-08 18:43:18,401 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places.
[2024-11-08 18:43:18,402 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow
[2024-11-08 18:43:18,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-08 18:43:18,403 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:18,403 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:18,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 18:43:18,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:18,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:18,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -932780667, now seen corresponding path program 1 times
[2024-11-08 18:43:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482721466]
[2024-11-08 18:43:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:18,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:18,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:18,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:18,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 18:43:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:18,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:18,728 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:18,783 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-08 18:43:18,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:18,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482721466]
[2024-11-08 18:43:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482721466] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:43:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669474408]
[2024-11-08 18:43:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:18,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:43:18,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:43:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:43:18,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47
[2024-11-08 18:43:18,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:18,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:18,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47
[2024-11-08 18:43:18,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:19,040 INFO L124 PetriNetUnfolderBase]: 400/818 cut-off events.
[2024-11-08 18:43:19,041 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES.
[2024-11-08 18:43:19,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 818 events. 400/818 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5732 event pairs, 400 based on Foata normal form. 30/815 useless extension candidates. Maximal degree in co-relation 1499. Up to 627 conditions per place.
[2024-11-08 18:43:19,052 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 17 selfloop transitions, 1 changer transitions 1/38 dead transitions.
[2024-11-08 18:43:19,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 124 flow
[2024-11-08 18:43:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:43:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:43:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions.
[2024-11-08 18:43:19,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844
[2024-11-08 18:43:19,056 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 86 transitions.
[2024-11-08 18:43:19,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 124 flow
[2024-11-08 18:43:19,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:43:19,060 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow
[2024-11-08 18:43:19,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37}
[2024-11-08 18:43:19,063 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places.
[2024-11-08 18:43:19,063 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow
[2024-11-08 18:43:19,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:19,064 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:19,064 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:19,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 18:43:19,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:19,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:19,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:19,266 INFO L85 PathProgramCache]: Analyzing trace with hash -932779302, now seen corresponding path program 1 times
[2024-11-08 18:43:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:19,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875527798]
[2024-11-08 18:43:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:19,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:19,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:19,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:19,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 18:43:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:19,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:19,403 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:19,454 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-08 18:43:19,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:19,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875527798]
[2024-11-08 18:43:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875527798] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:19,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:43:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920355594]
[2024-11-08 18:43:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:19,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:43:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:43:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:43:19,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:19,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 18:43:19,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:19,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:19,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:19,891 INFO L124 PetriNetUnfolderBase]: 1079/1919 cut-off events.
[2024-11-08 18:43:19,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:43:19,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 1919 events. 1079/1919 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12475 event pairs, 107 based on Foata normal form. 72/1981 useless extension candidates. Maximal degree in co-relation 3595. Up to 1011 conditions per place.
[2024-11-08 18:43:19,904 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 39 selfloop transitions, 5 changer transitions 1/60 dead transitions.
[2024-11-08 18:43:19,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 222 flow
[2024-11-08 18:43:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:43:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 18:43:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions.
[2024-11-08 18:43:19,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6542553191489362
[2024-11-08 18:43:19,909 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 4 states and 123 transitions.
[2024-11-08 18:43:19,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 222 flow
[2024-11-08 18:43:19,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 18:43:19,912 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow
[2024-11-08 18:43:19,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40}
[2024-11-08 18:43:19,913 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places.
[2024-11-08 18:43:19,913 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow
[2024-11-08 18:43:19,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 18:43:19,913 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:19,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:19,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 18:43:20,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:20,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:20,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1290699061, now seen corresponding path program 1 times
[2024-11-08 18:43:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017411529]
[2024-11-08 18:43:20,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:20,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:20,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:20,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:20,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 18:43:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:20,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:20,218 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:20,267 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-08 18:43:20,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:20,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017411529]
[2024-11-08 18:43:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017411529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:43:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707743892]
[2024-11-08 18:43:20,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:43:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:20,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:43:20,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:20,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:20,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:20,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:20,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:20,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:20,619 INFO L124 PetriNetUnfolderBase]: 733/1311 cut-off events.
[2024-11-08 18:43:20,619 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES.
[2024-11-08 18:43:20,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 1311 events. 733/1311 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7421 event pairs, 41 based on Foata normal form. 64/1365 useless extension candidates. Maximal degree in co-relation 2953. Up to 521 conditions per place.
[2024-11-08 18:43:20,628 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 49 selfloop transitions, 8 changer transitions 1/73 dead transitions.
[2024-11-08 18:43:20,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 318 flow
[2024-11-08 18:43:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:43:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:43:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions.
[2024-11-08 18:43:20,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063
[2024-11-08 18:43:20,630 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 155 transitions.
[2024-11-08 18:43:20,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 318 flow
[2024-11-08 18:43:20,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-08 18:43:20,634 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow
[2024-11-08 18:43:20,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43}
[2024-11-08 18:43:20,635 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places.
[2024-11-08 18:43:20,635 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow
[2024-11-08 18:43:20,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:43:20,635 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:20,635 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:20,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 18:43:20,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:20,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:20,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1207461753, now seen corresponding path program 1 times
[2024-11-08 18:43:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:20,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6519719]
[2024-11-08 18:43:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:20,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:20,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:20,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 18:43:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:20,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:20,951 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:21,034 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-08 18:43:21,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:21,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6519719]
[2024-11-08 18:43:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6519719] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:21,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:21,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:43:21,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180920291]
[2024-11-08 18:43:21,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:21,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:43:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:43:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:43:21,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:21,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-08 18:43:21,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:21,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:21,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:21,385 INFO L124 PetriNetUnfolderBase]: 411/709 cut-off events.
[2024-11-08 18:43:21,386 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES.
[2024-11-08 18:43:21,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1880 conditions, 709 events. 411/709 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3178 event pairs, 29 based on Foata normal form. 36/735 useless extension candidates. Maximal degree in co-relation 1869. Up to 268 conditions per place.
[2024-11-08 18:43:21,391 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 43 selfloop transitions, 11 changer transitions 1/70 dead transitions.
[2024-11-08 18:43:21,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 329 flow
[2024-11-08 18:43:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:43:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 18:43:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions.
[2024-11-08 18:43:21,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043
[2024-11-08 18:43:21,393 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 171 transitions.
[2024-11-08 18:43:21,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 329 flow
[2024-11-08 18:43:21,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 304 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-08 18:43:21,399 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow
[2024-11-08 18:43:21,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43}
[2024-11-08 18:43:21,400 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places.
[2024-11-08 18:43:21,400 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow
[2024-11-08 18:43:21,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-08 18:43:21,401 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:21,401 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]
[2024-11-08 18:43:21,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-08 18:43:21,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:21,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:21,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1558180915, now seen corresponding path program 1 times
[2024-11-08 18:43:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954944]
[2024-11-08 18:43:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:21,608 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:21,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 18:43:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:21,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:21,728 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:22,001 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-08 18:43:22,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:22,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954944]
[2024-11-08 18:43:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:22,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:22,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:43:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514586069]
[2024-11-08 18:43:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:22,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:43:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:43:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:43:22,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47
[2024-11-08 18:43:22,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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-08 18:43:22,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:22,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47
[2024-11-08 18:43:22,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:22,594 INFO L124 PetriNetUnfolderBase]: 763/1292 cut-off events.
[2024-11-08 18:43:22,595 INFO L125 PetriNetUnfolderBase]: For 1244/1248 co-relation queries the response was YES.
[2024-11-08 18:43:22,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 1292 events. 763/1292 cut-off events. For 1244/1248 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6318 event pairs, 183 based on Foata normal form. 12/1295 useless extension candidates. Maximal degree in co-relation 3414. Up to 741 conditions per place.
[2024-11-08 18:43:22,603 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 46 selfloop transitions, 7 changer transitions 33/98 dead transitions.
[2024-11-08 18:43:22,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 98 transitions, 543 flow
[2024-11-08 18:43:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:43:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 18:43:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions.
[2024-11-08 18:43:22,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213
[2024-11-08 18:43:22,605 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 9 states and 225 transitions.
[2024-11-08 18:43:22,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 98 transitions, 543 flow
[2024-11-08 18:43:22,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 426 flow, removed 20 selfloop flow, removed 8 redundant places.
[2024-11-08 18:43:22,615 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 157 flow
[2024-11-08 18:43:22,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=157, PETRI_PLACES=63, PETRI_TRANSITIONS=46}
[2024-11-08 18:43:22,616 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2024-11-08 18:43:22,616 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 157 flow
[2024-11-08 18:43:22,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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-08 18:43:22,617 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:22,617 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]
[2024-11-08 18:43:22,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-08 18:43:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:22,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1941248949, now seen corresponding path program 2 times
[2024-11-08 18:43:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113120250]
[2024-11-08 18:43:22,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 18:43:22,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:22,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:22,825 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:22,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 18:43:22,944 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-08 18:43:22,945 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 18:43:22,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:22,951 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:24,298 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-08 18:43:24,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:24,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:24,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113120250]
[2024-11-08 18:43:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113120250] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:24,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:24,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 18:43:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660358817]
[2024-11-08 18:43:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:24,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:43:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:43:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:43:24,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47
[2024-11-08 18:43:24,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 157 flow. Second operand has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 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-08 18:43:24,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:24,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47
[2024-11-08 18:43:24,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:25,115 INFO L124 PetriNetUnfolderBase]: 594/1054 cut-off events.
[2024-11-08 18:43:25,116 INFO L125 PetriNetUnfolderBase]: For 303/309 co-relation queries the response was YES.
[2024-11-08 18:43:25,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 1054 events. 594/1054 cut-off events. For 303/309 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4983 event pairs, 124 based on Foata normal form. 10/1052 useless extension candidates. Maximal degree in co-relation 2489. Up to 611 conditions per place.
[2024-11-08 18:43:25,124 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 43 selfloop transitions, 26 changer transitions 30/114 dead transitions.
[2024-11-08 18:43:25,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 598 flow
[2024-11-08 18:43:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-08 18:43:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-11-08 18:43:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 321 transitions.
[2024-11-08 18:43:25,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5253682487725041
[2024-11-08 18:43:25,126 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 157 flow. Second operand 13 states and 321 transitions.
[2024-11-08 18:43:25,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 598 flow
[2024-11-08 18:43:25,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 114 transitions, 540 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-11-08 18:43:25,130 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 303 flow
[2024-11-08 18:43:25,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=303, PETRI_PLACES=71, PETRI_TRANSITIONS=67}
[2024-11-08 18:43:25,131 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places.
[2024-11-08 18:43:25,131 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 303 flow
[2024-11-08 18:43:25,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 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-08 18:43:25,132 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:25,132 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]
[2024-11-08 18:43:25,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-11-08 18:43:25,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:25,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1134053475, now seen corresponding path program 3 times
[2024-11-08 18:43:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:25,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706519704]
[2024-11-08 18:43:25,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 18:43:25,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:25,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:25,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:25,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-08 18:43:25,456 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-08 18:43:25,457 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 18:43:25,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:25,461 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:25,619 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-08 18:43:25,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:25,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:25,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706519704]
[2024-11-08 18:43:25,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706519704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:25,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:25,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:43:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808708797]
[2024-11-08 18:43:25,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:25,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:43:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:43:25,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:43:25,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47
[2024-11-08 18:43:25,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 303 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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-08 18:43:25,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:25,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47
[2024-11-08 18:43:25,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:26,196 INFO L124 PetriNetUnfolderBase]: 719/1258 cut-off events.
[2024-11-08 18:43:26,196 INFO L125 PetriNetUnfolderBase]: For 566/574 co-relation queries the response was YES.
[2024-11-08 18:43:26,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1258 events. 719/1258 cut-off events. For 566/574 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6256 event pairs, 173 based on Foata normal form. 16/1265 useless extension candidates. Maximal degree in co-relation 3246. Up to 630 conditions per place.
[2024-11-08 18:43:26,204 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 48 selfloop transitions, 13 changer transitions 51/124 dead transitions.
[2024-11-08 18:43:26,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 124 transitions, 715 flow
[2024-11-08 18:43:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:43:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 18:43:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions.
[2024-11-08 18:43:26,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5437352245862884
[2024-11-08 18:43:26,207 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 303 flow. Second operand 9 states and 230 transitions.
[2024-11-08 18:43:26,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 124 transitions, 715 flow
[2024-11-08 18:43:26,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 124 transitions, 697 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-11-08 18:43:26,211 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 280 flow
[2024-11-08 18:43:26,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=280, PETRI_PLACES=76, PETRI_TRANSITIONS=59}
[2024-11-08 18:43:26,212 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places.
[2024-11-08 18:43:26,212 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 280 flow
[2024-11-08 18:43:26,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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-08 18:43:26,213 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:26,213 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]
[2024-11-08 18:43:26,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-08 18:43:26,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:26,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:26,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1138529877, now seen corresponding path program 4 times
[2024-11-08 18:43:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180081951]
[2024-11-08 18:43:26,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 18:43:26,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:26,422 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:26,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-08 18:43:26,520 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 18:43:26,520 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 18:43:26,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:26,524 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:26,594 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-08 18:43:26,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:26,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:26,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180081951]
[2024-11-08 18:43:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180081951] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:26,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:43:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963676374]
[2024-11-08 18:43:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:26,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:43:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:43:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:43:26,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47
[2024-11-08 18:43:26,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-08 18:43:26,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:43:26,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47
[2024-11-08 18:43:26,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:43:27,000 INFO L124 PetriNetUnfolderBase]: 604/1259 cut-off events.
[2024-11-08 18:43:27,000 INFO L125 PetriNetUnfolderBase]: For 622/634 co-relation queries the response was YES.
[2024-11-08 18:43:27,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 1259 events. 604/1259 cut-off events. For 622/634 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7298 event pairs, 194 based on Foata normal form. 8/1200 useless extension candidates. Maximal degree in co-relation 2946. Up to 466 conditions per place.
[2024-11-08 18:43:27,009 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 28 selfloop transitions, 2 changer transitions 39/94 dead transitions.
[2024-11-08 18:43:27,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 94 transitions, 524 flow
[2024-11-08 18:43:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:43:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 18:43:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions.
[2024-11-08 18:43:27,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432
[2024-11-08 18:43:27,011 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 280 flow. Second operand 6 states and 164 transitions.
[2024-11-08 18:43:27,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 94 transitions, 524 flow
[2024-11-08 18:43:27,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 94 transitions, 488 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-11-08 18:43:27,016 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 208 flow
[2024-11-08 18:43:27,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=73, PETRI_TRANSITIONS=50}
[2024-11-08 18:43:27,017 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2024-11-08 18:43:27,018 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 208 flow
[2024-11-08 18:43:27,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-08 18:43:27,018 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:43:27,018 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]
[2024-11-08 18:43:27,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-11-08 18:43:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:27,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 18:43:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash -27285965, now seen corresponding path program 5 times
[2024-11-08 18:43:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:27,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72075088]
[2024-11-08 18:43:27,224 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 18:43:27,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:27,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:27,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-08 18:43:27,334 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-08 18:43:27,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-08 18:43:27,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:43:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:43:27,433 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-08 18:43:27,434 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:43:27,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-08 18:43:27,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-08 18:43:27,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-08 18:43:27,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-08 18:43:27,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-08 18:43:27,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-08 18:43:27,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-08 18:43:27,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-11-08 18:43:27,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:27,639 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2024-11-08 18:43:27,719 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 18:43:27,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:43:27,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:43:27 BasicIcfg
[2024-11-08 18:43:27,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:43:27,727 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:43:27,727 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:43:27,727 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:43:27,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:17" (3/4) ...
[2024-11-08 18:43:27,730 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:43:27,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:43:27,734 INFO L158 Benchmark]: Toolchain (without parser) took 12324.98ms. Allocated memory was 69.2MB in the beginning and 197.1MB in the end (delta: 127.9MB). Free memory was 36.2MB in the beginning and 91.4MB in the end (delta: -55.1MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB.
[2024-11-08 18:43:27,734 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 44.9MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:43:27,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.28ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 36.0MB in the beginning and 63.7MB in the end (delta: -27.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB.
[2024-11-08 18:43:27,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.07ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 60.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:43:27,738 INFO L158 Benchmark]: Boogie Preprocessor took 91.47ms. Allocated memory is still 94.4MB. Free memory was 60.6MB in the beginning and 57.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:43:27,738 INFO L158 Benchmark]: RCFGBuilder took 1016.29ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 35.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-08 18:43:27,739 INFO L158 Benchmark]: TraceAbstraction took 10374.83ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 34.5MB in the beginning and 92.4MB in the end (delta: -57.9MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB.
[2024-11-08 18:43:27,739 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 197.1MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:43:27,744 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 1.24ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 44.9MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 739.28ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 36.0MB in the beginning and 63.7MB in the end (delta: -27.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 92.07ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 60.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 91.47ms. Allocated memory is still 94.4MB. Free memory was 60.6MB in the beginning and 57.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1016.29ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 35.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 10374.83ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 34.5MB in the beginning and 92.4MB in the end (delta: -57.9MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB.
* Witness Printer took 4.54ms. Allocated memory is still 197.1MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p1_EBX = 0;
[L715] 0 int __unbuffered_p2_EAX = 0;
[L717] 0 int __unbuffered_p2_EBX = 0;
[L719] 0 int a = 0;
[L720] 0 _Bool main$tmp_guard0;
[L721] 0 _Bool main$tmp_guard1;
[L723] 0 int x = 0;
[L725] 0 int y = 0;
[L727] 0 int z = 0;
[L728] 0 _Bool z$flush_delayed;
[L729] 0 int z$mem_tmp;
[L730] 0 _Bool z$r_buff0_thd0;
[L731] 0 _Bool z$r_buff0_thd1;
[L732] 0 _Bool z$r_buff0_thd2;
[L733] 0 _Bool z$r_buff0_thd3;
[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$read_delayed;
[L739] 0 int *z$read_delayed_var;
[L740] 0 int z$w_buff0;
[L741] 0 _Bool z$w_buff0_used;
[L742] 0 int z$w_buff1;
[L743] 0 _Bool z$w_buff1_used;
[L744] 0 _Bool weak$$choice0;
[L745] 0 _Bool weak$$choice2;
[L851] 0 pthread_t t284;
[L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=14, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L853] 0 pthread_t t285;
[L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=14, t285=15, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L855] 0 pthread_t t286;
[L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t284=14, t285=15, t286=16, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L798] 3 z$w_buff1 = z$w_buff0
[L799] 3 z$w_buff0 = 1
[L800] 3 z$w_buff1_used = z$w_buff0_used
[L801] 3 z$w_buff0_used = (_Bool)1
[L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0
[L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1
[L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2
[L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3
[L807] 3 z$r_buff0_thd3 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L810] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L811] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L812] 3 z$flush_delayed = weak$$choice2
[L813] 3 z$mem_tmp = z
[L814] 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)
[L815] 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))
[L816] 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))
[L817] 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))
[L818] 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))
[L819] 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))
[L820] 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))
[L821] 3 __unbuffered_p2_EAX = z
[L822] 3 z = z$flush_delayed ? z$mem_tmp : z
[L823] 3 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L826] 3 __unbuffered_p2_EBX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L749] 1 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L752] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L764] 2 x = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L767] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L770] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L773] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L774] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L775] 2 z$flush_delayed = weak$$choice2
[L776] 2 z$mem_tmp = z
[L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 __unbuffered_p1_EBX = z
[L785] 2 z = z$flush_delayed ? z$mem_tmp : z
[L786] 2 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=14, t285=15, t286=16, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L860] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L860] RET 0 assume_abort_if_not(main$tmp_guard0)
[L862] 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)
[L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L864] 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
[L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L866] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=14, t285=15, t286=16, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=14, t285=15, t286=16, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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", "mix011.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 849]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1563 IncrementalHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 14 mSDtfsCounter, 1563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 249 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 971 SizeOfPredicates, 37 NumberOfNonLiveVariables, 967 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 18:43:27,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffdc7a74-950e-4625-8c91-a163ddc16b06/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample