./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI --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 f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:40:36,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:40:36,253 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:40:36,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:40:36,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:40:36,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:40:36,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:40:36,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:40:36,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:40:36,306 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:40:36,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:40:36,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:40:36,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:40:36,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:40:36,311 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:40:36,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:40:36,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:40:36,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:40:36,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:40:36,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:40:36,314 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:40:36,315 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:40:36,315 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:40:36,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:40:36,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:40:36,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:40:36,317 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:40:36,317 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:40:36,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:40:36,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:40:36,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:40:36,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:40:36,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:40:36,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:40:36,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:40:36,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:40:36,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:40:36,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:40:36,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:40:36,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:40:36,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:40:36,323 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_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/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_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI 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 -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2023-11-24 21:40:36,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:40:36,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:40:36,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:40:36,620 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:40:36,621 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:40:36,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-24 21:40:39,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:40:40,119 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:40:40,120 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-24 21:40:40,153 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data/08406ac93/1d5bf9b1456240dd86bc753742a3b998/FLAG998d36d9b [2023-11-24 21:40:40,167 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data/08406ac93/1d5bf9b1456240dd86bc753742a3b998 [2023-11-24 21:40:40,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:40:40,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:40:40,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:40:40,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:40:40,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:40:40,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759d74c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40, skipping insertion in model container [2023-11-24 21:40:40,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:40:40,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:40:40,680 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:40:40,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:40:40,792 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:40:40,792 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:40:40,799 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:40:40,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40 WrapperNode [2023-11-24 21:40:40,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:40:40,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:40:40,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:40:40,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:40:40,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,893 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-11-24 21:40:40,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:40:40,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:40:40,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:40:40,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:40:40,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,951 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 21:40:40,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:40,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:40:40,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:40:40,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:40:40,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:40:40,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (1/1) ... [2023-11-24 21:40:41,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:40:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:40:41,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:40:41,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:40:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:40:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:40:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:40:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:40:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:40:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:40:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:40:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:40:41,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:40:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:40:41,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:40:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:40:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:40:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:40:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:40:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:40:41,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:40:41,081 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:40:41,253 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:40:41,256 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:40:41,604 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:40:41,882 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:40:41,883 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:40:41,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:40:41 BoogieIcfgContainer [2023-11-24 21:40:41,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:40:41,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:40:41,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:40:41,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:40:41,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:40:40" (1/3) ... [2023-11-24 21:40:41,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bd8161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:40:41, skipping insertion in model container [2023-11-24 21:40:41,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:40" (2/3) ... [2023-11-24 21:40:41,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bd8161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:40:41, skipping insertion in model container [2023-11-24 21:40:41,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:40:41" (3/3) ... [2023-11-24 21:40:41,897 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-11-24 21:40:41,915 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:40:41,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:40:41,915 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:40:41,975 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:40:42,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 96 flow [2023-11-24 21:40:42,056 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2023-11-24 21:40:42,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:40:42,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-24 21:40:42,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 96 flow [2023-11-24 21:40:42,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 42 transitions, 90 flow [2023-11-24 21:40:42,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:40:42,104 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@386f51c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:40:42,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:40:42,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:40:42,109 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:40:42,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:40:42,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:42,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:40:42,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:42,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash 12729, now seen corresponding path program 1 times [2023-11-24 21:40:42,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133880384] [2023-11-24 21:40:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:42,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133880384] [2023-11-24 21:40:42,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133880384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:42,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:40:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537237112] [2023-11-24 21:40:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:42,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:40:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:40:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:40:42,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-24 21:40:42,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-24 21:40:42,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:42,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-24 21:40:42,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:42,840 INFO L124 PetriNetUnfolderBase]: 203/491 cut-off events. [2023-11-24 21:40:42,840 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:40:42,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 491 events. 203/491 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3149 event pairs, 149 based on Foata normal form. 36/491 useless extension candidates. Maximal degree in co-relation 845. Up to 265 conditions per place. [2023-11-24 21:40:42,854 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 24 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-24 21:40:42,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 148 flow [2023-11-24 21:40:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:40:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:40:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-24 21:40:42,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-24 21:40:42,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-24 21:40:42,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-24 21:40:42,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:42,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-24 21:40:42,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:42,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:42,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:42,888 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 92 transitions. [2023-11-24 21:40:42,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 148 flow [2023-11-24 21:40:42,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:42,899 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-24 21:40:42,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-24 21:40:42,905 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-24 21:40:42,906 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-24 21:40:42,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-24 21:40:42,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:42,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:40:42,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:40:42,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:42,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash 12730, now seen corresponding path program 1 times [2023-11-24 21:40:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:42,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21953184] [2023-11-24 21:40:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:43,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21953184] [2023-11-24 21:40:43,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21953184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:43,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:40:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672946513] [2023-11-24 21:40:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:43,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:40:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:40:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:40:43,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-24 21:40:43,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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) [2023-11-24 21:40:43,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:43,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-24 21:40:43,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:43,210 INFO L124 PetriNetUnfolderBase]: 203/490 cut-off events. [2023-11-24 21:40:43,211 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:40:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 490 events. 203/490 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3113 event pairs, 149 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 863. Up to 264 conditions per place. [2023-11-24 21:40:43,216 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 23 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-24 21:40:43,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 146 flow [2023-11-24 21:40:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:40:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:40:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-24 21:40:43,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-24 21:40:43,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-24 21:40:43,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-24 21:40:43,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:43,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-24 21:40:43,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:43,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:43,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:43,227 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 92 transitions. [2023-11-24 21:40:43,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 146 flow [2023-11-24 21:40:43,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:43,233 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-24 21:40:43,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-24 21:40:43,237 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-11-24 21:40:43,238 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-24 21:40:43,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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) [2023-11-24 21:40:43,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:43,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:40:43,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:40:43,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:43,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 379563466, now seen corresponding path program 1 times [2023-11-24 21:40:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313160149] [2023-11-24 21:40:43,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:43,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:43,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313160149] [2023-11-24 21:40:43,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313160149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:43,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:43,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:40:43,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510465472] [2023-11-24 21:40:43,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:43,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:40:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:40:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:40:43,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-24 21:40:43,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:43,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:43,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-24 21:40:43,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:43,554 INFO L124 PetriNetUnfolderBase]: 205/489 cut-off events. [2023-11-24 21:40:43,554 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:40:43,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 489 events. 205/489 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3116 event pairs, 99 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 867. Up to 265 conditions per place. [2023-11-24 21:40:43,559 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:40:43,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 146 flow [2023-11-24 21:40:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:40:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:40:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-24 21:40:43,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-24 21:40:43,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-24 21:40:43,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-24 21:40:43,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:43,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-24 21:40:43,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 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) [2023-11-24 21:40:43,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:43,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:43,564 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 90 transitions. [2023-11-24 21:40:43,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 146 flow [2023-11-24 21:40:43,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:43,567 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:40:43,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 21:40:43,568 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-11-24 21:40:43,568 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:40:43,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:43,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:43,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:40:43,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:40:43,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:43,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 379563467, now seen corresponding path program 1 times [2023-11-24 21:40:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507788288] [2023-11-24 21:40:43,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507788288] [2023-11-24 21:40:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507788288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:40:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399804666] [2023-11-24 21:40:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:43,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:40:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:40:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:40:43,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-24 21:40:43,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:43,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:43,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-24 21:40:43,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:43,815 INFO L124 PetriNetUnfolderBase]: 203/484 cut-off events. [2023-11-24 21:40:43,815 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:40:43,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 484 events. 203/484 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3098 event pairs, 99 based on Foata normal form. 3/459 useless extension candidates. Maximal degree in co-relation 860. Up to 260 conditions per place. [2023-11-24 21:40:43,820 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:40:43,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-24 21:40:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:40:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:40:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-24 21:40:43,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-24 21:40:43,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-24 21:40:43,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-24 21:40:43,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:43,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-24 21:40:43,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:43,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:43,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:43,826 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 92 transitions. [2023-11-24 21:40:43,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-24 21:40:43,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:43,829 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 21:40:43,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 21:40:43,830 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2023-11-24 21:40:43,830 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 21:40:43,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:43,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:43,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:40:43,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:40:43,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:43,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1073317634, now seen corresponding path program 1 times [2023-11-24 21:40:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657589599] [2023-11-24 21:40:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:43,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657589599] [2023-11-24 21:40:43,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657589599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:43,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:43,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:40:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786616346] [2023-11-24 21:40:43,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:43,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:40:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:40:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:40:43,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 44 [2023-11-24 21:40:43,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-11-24 21:40:43,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:43,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 44 [2023-11-24 21:40:43,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:44,120 INFO L124 PetriNetUnfolderBase]: 166/372 cut-off events. [2023-11-24 21:40:44,121 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 21:40:44,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 372 events. 166/372 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2101 event pairs, 18 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 684. Up to 245 conditions per place. [2023-11-24 21:40:44,125 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 22 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-11-24 21:40:44,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 148 flow [2023-11-24 21:40:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:40:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:40:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-24 21:40:44,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-24 21:40:44,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-24 21:40:44,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-24 21:40:44,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:44,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-24 21:40:44,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:44,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:44,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:40:44,130 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 96 transitions. [2023-11-24 21:40:44,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 148 flow [2023-11-24 21:40:44,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:44,132 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 74 flow [2023-11-24 21:40:44,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-24 21:40:44,133 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-11-24 21:40:44,133 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 74 flow [2023-11-24 21:40:44,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-11-24 21:40:44,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:44,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:40:44,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:40:44,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:44,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 818549937, now seen corresponding path program 1 times [2023-11-24 21:40:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410888274] [2023-11-24 21:40:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410888274] [2023-11-24 21:40:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410888274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:44,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:44,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:40:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765881298] [2023-11-24 21:40:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:44,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:40:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:44,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:40:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:40:44,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2023-11-24 21:40:44,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 74 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) [2023-11-24 21:40:44,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:44,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2023-11-24 21:40:44,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:44,939 INFO L124 PetriNetUnfolderBase]: 367/862 cut-off events. [2023-11-24 21:40:44,939 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-24 21:40:44,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 862 events. 367/862 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5682 event pairs, 336 based on Foata normal form. 20/870 useless extension candidates. Maximal degree in co-relation 1562. Up to 294 conditions per place. [2023-11-24 21:40:44,946 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 3 changer transitions 8/55 dead transitions. [2023-11-24 21:40:44,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 206 flow [2023-11-24 21:40:44,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:40:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:40:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2023-11-24 21:40:44,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2023-11-24 21:40:44,949 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 142 transitions. [2023-11-24 21:40:44,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 142 transitions. [2023-11-24 21:40:44,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:44,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 142 transitions. [2023-11-24 21:40:44,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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) [2023-11-24 21:40:44,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:40:44,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:40:44,954 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 74 flow. Second operand 5 states and 142 transitions. [2023-11-24 21:40:44,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 206 flow [2023-11-24 21:40:44,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:44,957 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 92 flow [2023-11-24 21:40:44,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-24 21:40:44,961 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-24 21:40:44,961 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 92 flow [2023-11-24 21:40:44,961 INFO L496 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) [2023-11-24 21:40:44,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:44,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:40:44,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:40:44,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:44,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 818549763, now seen corresponding path program 1 times [2023-11-24 21:40:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361970124] [2023-11-24 21:40:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361970124] [2023-11-24 21:40:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361970124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:40:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245249493] [2023-11-24 21:40:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:45,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:40:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:40:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:40:45,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2023-11-24 21:40:45,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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) [2023-11-24 21:40:45,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:45,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2023-11-24 21:40:45,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:45,621 INFO L124 PetriNetUnfolderBase]: 590/1195 cut-off events. [2023-11-24 21:40:45,622 INFO L125 PetriNetUnfolderBase]: For 63/65 co-relation queries the response was YES. [2023-11-24 21:40:45,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 1195 events. 590/1195 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7791 event pairs, 327 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 2326. Up to 742 conditions per place. [2023-11-24 21:40:45,630 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 30 selfloop transitions, 6 changer transitions 28/77 dead transitions. [2023-11-24 21:40:45,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 318 flow [2023-11-24 21:40:45,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:40:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:40:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2023-11-24 21:40:45,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2023-11-24 21:40:45,633 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 217 transitions. [2023-11-24 21:40:45,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 217 transitions. [2023-11-24 21:40:45,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:45,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 217 transitions. [2023-11-24 21:40:45,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 27.125) internal successors, (217), 8 states have internal predecessors, (217), 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) [2023-11-24 21:40:45,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:45,636 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:45,636 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 92 flow. Second operand 8 states and 217 transitions. [2023-11-24 21:40:45,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 318 flow [2023-11-24 21:40:45,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:45,639 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 132 flow [2023-11-24 21:40:45,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-11-24 21:40:45,640 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-11-24 21:40:45,641 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 132 flow [2023-11-24 21:40:45,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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) [2023-11-24 21:40:45,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:45,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:40:45,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:40:45,642 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:45,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash -828198465, now seen corresponding path program 1 times [2023-11-24 21:40:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615781052] [2023-11-24 21:40:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615781052] [2023-11-24 21:40:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615781052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:45,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:40:45,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224826848] [2023-11-24 21:40:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:45,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:40:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:40:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:40:45,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2023-11-24 21:40:45,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:45,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2023-11-24 21:40:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:46,249 INFO L124 PetriNetUnfolderBase]: 426/920 cut-off events. [2023-11-24 21:40:46,249 INFO L125 PetriNetUnfolderBase]: For 564/566 co-relation queries the response was YES. [2023-11-24 21:40:46,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 920 events. 426/920 cut-off events. For 564/566 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5849 event pairs, 262 based on Foata normal form. 12/922 useless extension candidates. Maximal degree in co-relation 2207. Up to 563 conditions per place. [2023-11-24 21:40:46,258 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 30 selfloop transitions, 6 changer transitions 19/69 dead transitions. [2023-11-24 21:40:46,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 344 flow [2023-11-24 21:40:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:40:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:40:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2023-11-24 21:40:46,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6107954545454546 [2023-11-24 21:40:46,260 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 215 transitions. [2023-11-24 21:40:46,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 215 transitions. [2023-11-24 21:40:46,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:46,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 215 transitions. [2023-11-24 21:40:46,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 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) [2023-11-24 21:40:46,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:46,264 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:46,264 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 132 flow. Second operand 8 states and 215 transitions. [2023-11-24 21:40:46,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 344 flow [2023-11-24 21:40:46,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 318 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-24 21:40:46,274 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 144 flow [2023-11-24 21:40:46,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-11-24 21:40:46,277 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2023-11-24 21:40:46,277 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 144 flow [2023-11-24 21:40:46,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:46,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:46,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:40:46,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:40:46,279 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:46,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1434348941, now seen corresponding path program 1 times [2023-11-24 21:40:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:46,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301639859] [2023-11-24 21:40:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301639859] [2023-11-24 21:40:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301639859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:40:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409777793] [2023-11-24 21:40:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:46,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:40:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:46,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:40:46,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:40:46,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2023-11-24 21:40:46,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:46,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:46,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2023-11-24 21:40:46,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:46,948 INFO L124 PetriNetUnfolderBase]: 545/1119 cut-off events. [2023-11-24 21:40:46,948 INFO L125 PetriNetUnfolderBase]: For 1044/1046 co-relation queries the response was YES. [2023-11-24 21:40:46,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 1119 events. 545/1119 cut-off events. For 1044/1046 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6968 event pairs, 126 based on Foata normal form. 36/1147 useless extension candidates. Maximal degree in co-relation 2795. Up to 480 conditions per place. [2023-11-24 21:40:46,958 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 47 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2023-11-24 21:40:46,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 372 flow [2023-11-24 21:40:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:40:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:40:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2023-11-24 21:40:46,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5965909090909091 [2023-11-24 21:40:46,961 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 210 transitions. [2023-11-24 21:40:46,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 210 transitions. [2023-11-24 21:40:46,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:46,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 210 transitions. [2023-11-24 21:40:46,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 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) [2023-11-24 21:40:46,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:46,964 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:46,964 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 144 flow. Second operand 8 states and 210 transitions. [2023-11-24 21:40:46,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 372 flow [2023-11-24 21:40:46,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 328 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-11-24 21:40:46,974 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 205 flow [2023-11-24 21:40:46,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=205, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-24 21:40:46,975 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2023-11-24 21:40:46,975 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 205 flow [2023-11-24 21:40:46,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:46,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:46,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:40:46,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:40:46,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:46,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1654129779, now seen corresponding path program 1 times [2023-11-24 21:40:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722637861] [2023-11-24 21:40:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722637861] [2023-11-24 21:40:47,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722637861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:47,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:47,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:40:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759292563] [2023-11-24 21:40:47,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:47,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:40:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:40:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:40:47,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-24 21:40:47,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:47,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:47,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-24 21:40:47,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:47,554 INFO L124 PetriNetUnfolderBase]: 304/729 cut-off events. [2023-11-24 21:40:47,554 INFO L125 PetriNetUnfolderBase]: For 692/694 co-relation queries the response was YES. [2023-11-24 21:40:47,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1828 conditions, 729 events. 304/729 cut-off events. For 692/694 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4605 event pairs, 213 based on Foata normal form. 24/744 useless extension candidates. Maximal degree in co-relation 1804. Up to 489 conditions per place. [2023-11-24 21:40:47,560 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 17 selfloop transitions, 3 changer transitions 14/52 dead transitions. [2023-11-24 21:40:47,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 291 flow [2023-11-24 21:40:47,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:40:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:40:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2023-11-24 21:40:47,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2023-11-24 21:40:47,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 131 transitions. [2023-11-24 21:40:47,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 131 transitions. [2023-11-24 21:40:47,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:47,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 131 transitions. [2023-11-24 21:40:47,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.2) internal successors, (131), 5 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) [2023-11-24 21:40:47,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:40:47,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:40:47,565 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 205 flow. Second operand 5 states and 131 transitions. [2023-11-24 21:40:47,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 291 flow [2023-11-24 21:40:47,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 269 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:47,572 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 146 flow [2023-11-24 21:40:47,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2023-11-24 21:40:47,575 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2023-11-24 21:40:47,575 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 146 flow [2023-11-24 21:40:47,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:47,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:47,576 INFO L208 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] [2023-11-24 21:40:47,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:40:47,577 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:47,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 8116249, now seen corresponding path program 1 times [2023-11-24 21:40:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036048694] [2023-11-24 21:40:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:47,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036048694] [2023-11-24 21:40:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036048694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:40:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923006816] [2023-11-24 21:40:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:47,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:40:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:47,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:40:47,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:40:47,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2023-11-24 21:40:47,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 36 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:47,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:47,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2023-11-24 21:40:47,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:48,071 INFO L124 PetriNetUnfolderBase]: 367/823 cut-off events. [2023-11-24 21:40:48,072 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2023-11-24 21:40:48,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 823 events. 367/823 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4578 event pairs, 65 based on Foata normal form. 52/871 useless extension candidates. Maximal degree in co-relation 1884. Up to 350 conditions per place. [2023-11-24 21:40:48,078 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-11-24 21:40:48,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 276 flow [2023-11-24 21:40:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:40:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:40:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2023-11-24 21:40:48,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6704545454545454 [2023-11-24 21:40:48,080 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 118 transitions. [2023-11-24 21:40:48,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 118 transitions. [2023-11-24 21:40:48,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:48,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 118 transitions. [2023-11-24 21:40:48,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:48,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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) [2023-11-24 21:40:48,082 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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) [2023-11-24 21:40:48,082 INFO L175 Difference]: Start difference. First operand has 59 places, 36 transitions, 146 flow. Second operand 4 states and 118 transitions. [2023-11-24 21:40:48,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 276 flow [2023-11-24 21:40:48,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 260 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-24 21:40:48,087 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 163 flow [2023-11-24 21:40:48,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-11-24 21:40:48,088 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2023-11-24 21:40:48,088 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 163 flow [2023-11-24 21:40:48,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:48,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:48,088 INFO L208 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] [2023-11-24 21:40:48,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:40:48,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:48,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1604573275, now seen corresponding path program 1 times [2023-11-24 21:40:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546897920] [2023-11-24 21:40:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:48,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546897920] [2023-11-24 21:40:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546897920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:48,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:48,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:40:48,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629173603] [2023-11-24 21:40:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:48,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:40:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:48,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:40:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:40:48,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2023-11-24 21:40:48,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:48,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:48,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2023-11-24 21:40:48,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:48,570 INFO L124 PetriNetUnfolderBase]: 245/553 cut-off events. [2023-11-24 21:40:48,570 INFO L125 PetriNetUnfolderBase]: For 287/291 co-relation queries the response was YES. [2023-11-24 21:40:48,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 553 events. 245/553 cut-off events. For 287/291 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2671 event pairs, 66 based on Foata normal form. 34/583 useless extension candidates. Maximal degree in co-relation 1426. Up to 219 conditions per place. [2023-11-24 21:40:48,574 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2023-11-24 21:40:48,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 265 flow [2023-11-24 21:40:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:40:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:40:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2023-11-24 21:40:48,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2023-11-24 21:40:48,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 136 transitions. [2023-11-24 21:40:48,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 136 transitions. [2023-11-24 21:40:48,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:48,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 136 transitions. [2023-11-24 21:40:48,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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) [2023-11-24 21:40:48,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:40:48,578 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:40:48,578 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 163 flow. Second operand 5 states and 136 transitions. [2023-11-24 21:40:48,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 265 flow [2023-11-24 21:40:48,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 237 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-24 21:40:48,584 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 159 flow [2023-11-24 21:40:48,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-11-24 21:40:48,585 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2023-11-24 21:40:48,585 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 159 flow [2023-11-24 21:40:48,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:48,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:48,586 INFO L208 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] [2023-11-24 21:40:48,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:40:48,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:48,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 726543941, now seen corresponding path program 1 times [2023-11-24 21:40:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821598750] [2023-11-24 21:40:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821598750] [2023-11-24 21:40:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821598750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:48,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:40:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444659136] [2023-11-24 21:40:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:48,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:40:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:48,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:40:48,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:40:48,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2023-11-24 21:40:48,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:48,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:48,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2023-11-24 21:40:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:49,239 INFO L124 PetriNetUnfolderBase]: 277/711 cut-off events. [2023-11-24 21:40:49,240 INFO L125 PetriNetUnfolderBase]: For 515/545 co-relation queries the response was YES. [2023-11-24 21:40:49,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 711 events. 277/711 cut-off events. For 515/545 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4103 event pairs, 93 based on Foata normal form. 8/669 useless extension candidates. Maximal degree in co-relation 1733. Up to 308 conditions per place. [2023-11-24 21:40:49,244 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 30 selfloop transitions, 10 changer transitions 13/68 dead transitions. [2023-11-24 21:40:49,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 346 flow [2023-11-24 21:40:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:40:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:40:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2023-11-24 21:40:49,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2023-11-24 21:40:49,247 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 196 transitions. [2023-11-24 21:40:49,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 196 transitions. [2023-11-24 21:40:49,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:49,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 196 transitions. [2023-11-24 21:40:49,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.5) internal successors, (196), 8 states have internal predecessors, (196), 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) [2023-11-24 21:40:49,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:49,250 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:49,250 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 159 flow. Second operand 8 states and 196 transitions. [2023-11-24 21:40:49,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 346 flow [2023-11-24 21:40:49,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 337 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:49,254 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 209 flow [2023-11-24 21:40:49,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2023-11-24 21:40:49,255 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2023-11-24 21:40:49,256 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 209 flow [2023-11-24 21:40:49,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:40:49,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:49,256 INFO L208 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] [2023-11-24 21:40:49,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:40:49,257 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:49,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 363131571, now seen corresponding path program 2 times [2023-11-24 21:40:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244073496] [2023-11-24 21:40:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244073496] [2023-11-24 21:40:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244073496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:40:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759255012] [2023-11-24 21:40:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:49,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:40:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:40:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:40:49,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2023-11-24 21:40:49,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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) [2023-11-24 21:40:49,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:49,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2023-11-24 21:40:49,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:49,903 INFO L124 PetriNetUnfolderBase]: 293/752 cut-off events. [2023-11-24 21:40:49,903 INFO L125 PetriNetUnfolderBase]: For 618/664 co-relation queries the response was YES. [2023-11-24 21:40:49,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 752 events. 293/752 cut-off events. For 618/664 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4674 event pairs, 105 based on Foata normal form. 18/707 useless extension candidates. Maximal degree in co-relation 1977. Up to 272 conditions per place. [2023-11-24 21:40:49,908 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 20 selfloop transitions, 3 changer transitions 28/66 dead transitions. [2023-11-24 21:40:49,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 379 flow [2023-11-24 21:40:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:40:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:40:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2023-11-24 21:40:49,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2023-11-24 21:40:49,910 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 194 transitions. [2023-11-24 21:40:49,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 194 transitions. [2023-11-24 21:40:49,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:49,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 194 transitions. [2023-11-24 21:40:49,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 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) [2023-11-24 21:40:49,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:49,914 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 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) [2023-11-24 21:40:49,915 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 209 flow. Second operand 8 states and 194 transitions. [2023-11-24 21:40:49,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 379 flow [2023-11-24 21:40:49,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 373 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-24 21:40:49,920 INFO L231 Difference]: Finished difference. Result has 65 places, 34 transitions, 153 flow [2023-11-24 21:40:49,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=153, PETRI_PLACES=65, PETRI_TRANSITIONS=34} [2023-11-24 21:40:49,922 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2023-11-24 21:40:49,923 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 34 transitions, 153 flow [2023-11-24 21:40:49,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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) [2023-11-24 21:40:49,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:49,923 INFO L208 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] [2023-11-24 21:40:49,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:40:49,924 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:49,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash -431979459, now seen corresponding path program 3 times [2023-11-24 21:40:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851330596] [2023-11-24 21:40:49,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:40:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:40:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:40:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851330596] [2023-11-24 21:40:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851330596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:40:51,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:40:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:40:51,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247397951] [2023-11-24 21:40:51,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:40:51,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:40:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:40:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:40:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:40:51,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-24 21:40:51,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 34 transitions, 153 flow. Second operand has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 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) [2023-11-24 21:40:51,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:40:51,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-24 21:40:51,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:40:51,865 INFO L124 PetriNetUnfolderBase]: 80/243 cut-off events. [2023-11-24 21:40:51,865 INFO L125 PetriNetUnfolderBase]: For 147/157 co-relation queries the response was YES. [2023-11-24 21:40:51,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 243 events. 80/243 cut-off events. For 147/157 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 999 event pairs, 29 based on Foata normal form. 5/225 useless extension candidates. Maximal degree in co-relation 610. Up to 83 conditions per place. [2023-11-24 21:40:51,867 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 15 selfloop transitions, 4 changer transitions 18/54 dead transitions. [2023-11-24 21:40:51,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 54 transitions, 281 flow [2023-11-24 21:40:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:40:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:40:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2023-11-24 21:40:51,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5613636363636364 [2023-11-24 21:40:51,869 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 247 transitions. [2023-11-24 21:40:51,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 247 transitions. [2023-11-24 21:40:51,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:40:51,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 247 transitions. [2023-11-24 21:40:51,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 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) [2023-11-24 21:40:51,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 44.0) internal successors, (484), 11 states have internal predecessors, (484), 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) [2023-11-24 21:40:51,873 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 44.0) internal successors, (484), 11 states have internal predecessors, (484), 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) [2023-11-24 21:40:51,873 INFO L175 Difference]: Start difference. First operand has 65 places, 34 transitions, 153 flow. Second operand 10 states and 247 transitions. [2023-11-24 21:40:51,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 54 transitions, 281 flow [2023-11-24 21:40:51,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 242 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-11-24 21:40:51,877 INFO L231 Difference]: Finished difference. Result has 63 places, 33 transitions, 138 flow [2023-11-24 21:40:51,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=33} [2023-11-24 21:40:51,878 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2023-11-24 21:40:51,878 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 33 transitions, 138 flow [2023-11-24 21:40:51,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 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) [2023-11-24 21:40:51,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:40:51,879 INFO L208 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] [2023-11-24 21:40:51,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:40:51,879 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:40:51,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:40:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -430951109, now seen corresponding path program 4 times [2023-11-24 21:40:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:40:51,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649477888] [2023-11-24 21:40:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:40:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:40:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:40:51,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:40:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:40:52,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:40:52,029 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:40:52,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:40:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:40:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:40:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:40:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:40:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:40:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:40:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:40:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:40:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:40:52,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:40:52,034 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:40:52,041 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:40:52,041 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:40:52,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:40:52,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:40:52,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:40:52,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:40:52,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:40:52 BasicIcfg [2023-11-24 21:40:52,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:40:52,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:40:52,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:40:52,112 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:40:52,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:40:41" (3/4) ... [2023-11-24 21:40:52,114 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:40:52,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:40:52,116 INFO L158 Benchmark]: Toolchain (without parser) took 11944.49ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 125.0MB in the beginning and 122.4MB in the end (delta: 2.7MB). Peak memory consumption was 126.2MB. Max. memory is 16.1GB. [2023-11-24 21:40:52,116 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:40:52,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.60ms. Allocated memory is still 163.6MB. Free memory was 124.8MB in the beginning and 100.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-24 21:40:52,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.24ms. Allocated memory is still 163.6MB. Free memory was 100.7MB in the beginning and 97.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:40:52,117 INFO L158 Benchmark]: Boogie Preprocessor took 99.59ms. Allocated memory is still 163.6MB. Free memory was 97.8MB in the beginning and 94.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:40:52,118 INFO L158 Benchmark]: RCFGBuilder took 890.13ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 110.3MB in the end (delta: -15.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-11-24 21:40:52,118 INFO L158 Benchmark]: TraceAbstraction took 10224.12ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 109.5MB in the beginning and 122.4MB in the end (delta: -12.9MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2023-11-24 21:40:52,119 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 285.2MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:40:52,120 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.30ms. Allocated memory is still 111.1MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.60ms. Allocated memory is still 163.6MB. Free memory was 124.8MB in the beginning and 100.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.24ms. Allocated memory is still 163.6MB. Free memory was 100.7MB in the beginning and 97.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.59ms. Allocated memory is still 163.6MB. Free memory was 97.8MB in the beginning and 94.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 890.13ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 110.3MB in the end (delta: -15.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10224.12ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 109.5MB in the beginning and 122.4MB in the end (delta: -12.9MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 285.2MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix009.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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 5 procedures, 63 locations, 10 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.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1451 IncrementalHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 47 mSDtfsCounter, 1451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=13, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 1725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 [2023-11-24 21:40:52,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI --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 f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:40:54,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:40:54,871 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:40:54,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:40:54,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:40:54,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:40:54,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:40:54,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:40:54,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:40:54,933 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:40:54,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:40:54,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:40:54,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:40:54,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:40:54,939 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:40:54,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:40:54,943 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:40:54,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:40:54,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:40:54,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:40:54,950 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:40:54,951 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:40:54,951 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:40:54,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:40:54,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:40:54,953 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:40:54,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:40:54,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:40:54,955 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:40:54,955 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:40:54,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:40:54,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:40:54,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:40:54,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:40:54,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:40:54,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:40:54,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:40:54,961 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:40:54,961 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:40:54,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:40:54,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:40:54,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:40:54,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:40:54,963 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:40:54,964 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_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/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_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI 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 -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2023-11-24 21:40:55,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:40:55,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:40:55,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:40:55,451 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:40:55,452 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:40:55,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-24 21:40:58,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:40:59,087 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:40:59,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-24 21:40:59,118 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data/f5723b2ca/d12a08c1c6c5460ea874f78e84f2c60d/FLAG087612e62 [2023-11-24 21:40:59,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/data/f5723b2ca/d12a08c1c6c5460ea874f78e84f2c60d [2023-11-24 21:40:59,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:40:59,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:40:59,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:40:59,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:40:59,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:40:59,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:40:59,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6caca03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59, skipping insertion in model container [2023-11-24 21:40:59,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:40:59,241 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:40:59,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:40:59,822 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:40:59,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:40:59,949 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:40:59,950 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:40:59,962 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:40:59,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59 WrapperNode [2023-11-24 21:40:59,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:40:59,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:40:59,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:40:59,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:40:59,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,043 INFO L138 Inliner]: procedures = 178, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-11-24 21:41:00,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:00,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:41:00,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:41:00,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:41:00,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,079 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 21:41:00,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:41:00,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:41:00,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:41:00,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:41:00,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (1/1) ... [2023-11-24 21:41:00,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:00,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:41:00,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:41:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:41:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:41:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:41:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:41:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:41:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:41:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:41:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:41:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:41:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:41:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:41:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:41:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:41:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:41:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:41:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:41:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:41:00,189 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:41:00,365 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:41:00,367 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:41:00,874 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:41:01,136 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:41:01,137 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:41:01,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:01 BoogieIcfgContainer [2023-11-24 21:41:01,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:41:01,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:41:01,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:41:01,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:41:01,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:40:59" (1/3) ... [2023-11-24 21:41:01,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282123c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:01, skipping insertion in model container [2023-11-24 21:41:01,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:40:59" (2/3) ... [2023-11-24 21:41:01,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282123c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:01, skipping insertion in model container [2023-11-24 21:41:01,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:01" (3/3) ... [2023-11-24 21:41:01,147 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-11-24 21:41:01,167 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:41:01,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:41:01,168 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:41:01,222 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:41:01,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 96 flow [2023-11-24 21:41:01,298 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2023-11-24 21:41:01,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:01,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-24 21:41:01,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 96 flow [2023-11-24 21:41:01,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 42 transitions, 90 flow [2023-11-24 21:41:01,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:41:01,342 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1184464c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:41:01,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:41:01,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:41:01,345 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:41:01,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:01,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:01,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:01,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:01,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 12793, now seen corresponding path program 1 times [2023-11-24 21:41:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760611872] [2023-11-24 21:41:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:01,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:01,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:01,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:01,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-24 21:41:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:01,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:41:01,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:01,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 21:41:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:01,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:01,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:01,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760611872] [2023-11-24 21:41:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760611872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:01,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:01,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024310139] [2023-11-24 21:41:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:01,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:01,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:01,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-24 21:41:01,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-24 21:41:01,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:01,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-24 21:41:01,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:02,012 INFO L124 PetriNetUnfolderBase]: 203/491 cut-off events. [2023-11-24 21:41:02,012 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:41:02,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 491 events. 203/491 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3149 event pairs, 149 based on Foata normal form. 36/491 useless extension candidates. Maximal degree in co-relation 845. Up to 265 conditions per place. [2023-11-24 21:41:02,021 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 24 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-24 21:41:02,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 148 flow [2023-11-24 21:41:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-24 21:41:02,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-24 21:41:02,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-24 21:41:02,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-24 21:41:02,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:02,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-24 21:41:02,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:02,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:02,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:02,049 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 92 transitions. [2023-11-24 21:41:02,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 148 flow [2023-11-24 21:41:02,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:02,056 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-24 21:41:02,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-24 21:41:02,061 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-24 21:41:02,062 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-24 21:41:02,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-24 21:41:02,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:02,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:02,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:02,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:02,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:02,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash 12794, now seen corresponding path program 1 times [2023-11-24 21:41:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460727103] [2023-11-24 21:41:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:02,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:02,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:02,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:02,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 21:41:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:02,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:41:02,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:02,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:41:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:02,397 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:02,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:02,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460727103] [2023-11-24 21:41:02,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460727103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:02,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:02,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107904386] [2023-11-24 21:41:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:02,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:02,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:02,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-24 21:41:02,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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) [2023-11-24 21:41:02,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:02,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-24 21:41:02,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:02,621 INFO L124 PetriNetUnfolderBase]: 203/490 cut-off events. [2023-11-24 21:41:02,621 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:41:02,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 490 events. 203/490 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3113 event pairs, 149 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 863. Up to 264 conditions per place. [2023-11-24 21:41:02,627 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 23 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-24 21:41:02,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 146 flow [2023-11-24 21:41:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-24 21:41:02,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-24 21:41:02,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-24 21:41:02,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-24 21:41:02,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:02,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-24 21:41:02,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:02,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:02,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:02,648 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 92 transitions. [2023-11-24 21:41:02,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 146 flow [2023-11-24 21:41:02,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:02,652 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-24 21:41:02,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-24 21:41:02,657 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-11-24 21:41:02,657 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-24 21:41:02,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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) [2023-11-24 21:41:02,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:02,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:02,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:02,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:02,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:02,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 381472076, now seen corresponding path program 1 times [2023-11-24 21:41:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941972371] [2023-11-24 21:41:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:02,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:02,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 21:41:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:02,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:41:02,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:02,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 21:41:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:02,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:02,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941972371] [2023-11-24 21:41:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941972371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:02,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252191367] [2023-11-24 21:41:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:02,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:02,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:02,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:03,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-24 21:41:03,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:03,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:03,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-24 21:41:03,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:03,187 INFO L124 PetriNetUnfolderBase]: 205/483 cut-off events. [2023-11-24 21:41:03,187 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:41:03,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 483 events. 205/483 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3078 event pairs, 155 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 861. Up to 265 conditions per place. [2023-11-24 21:41:03,193 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:41:03,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 146 flow [2023-11-24 21:41:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-24 21:41:03,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-24 21:41:03,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-24 21:41:03,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-24 21:41:03,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:03,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-24 21:41:03,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 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) [2023-11-24 21:41:03,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:03,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:03,199 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 90 transitions. [2023-11-24 21:41:03,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 146 flow [2023-11-24 21:41:03,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:03,201 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:41:03,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 21:41:03,202 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-11-24 21:41:03,202 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:41:03,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:03,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:03,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:03,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:03,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:03,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash 381472077, now seen corresponding path program 1 times [2023-11-24 21:41:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:03,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234815493] [2023-11-24 21:41:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:03,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:03,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:03,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 21:41:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:03,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:41:03,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:03,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:41:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:03,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:03,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:03,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234815493] [2023-11-24 21:41:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234815493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911603122] [2023-11-24 21:41:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:03,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:03,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-24 21:41:03,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:03,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:03,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-24 21:41:03,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:03,748 INFO L124 PetriNetUnfolderBase]: 203/478 cut-off events. [2023-11-24 21:41:03,748 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:41:03,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 478 events. 203/478 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3058 event pairs, 153 based on Foata normal form. 3/452 useless extension candidates. Maximal degree in co-relation 854. Up to 260 conditions per place. [2023-11-24 21:41:03,753 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:41:03,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-24 21:41:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-24 21:41:03,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-24 21:41:03,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-24 21:41:03,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-24 21:41:03,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:03,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-24 21:41:03,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:03,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:03,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:03,765 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 92 transitions. [2023-11-24 21:41:03,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-24 21:41:03,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:03,772 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 21:41:03,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 21:41:03,774 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2023-11-24 21:41:03,774 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 21:41:03,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:03,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:03,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:03,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:03,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:03,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:03,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash -48489986, now seen corresponding path program 1 times [2023-11-24 21:41:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686606031] [2023-11-24 21:41:03,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:03,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:03,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:03,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 21:41:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:04,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:41:04,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:04,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:04,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:04,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686606031] [2023-11-24 21:41:04,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686606031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824641596] [2023-11-24 21:41:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:04,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:04,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:04,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:04,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 44 [2023-11-24 21:41:04,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-11-24 21:41:04,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:04,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 44 [2023-11-24 21:41:04,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:04,242 INFO L124 PetriNetUnfolderBase]: 166/372 cut-off events. [2023-11-24 21:41:04,243 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 21:41:04,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 372 events. 166/372 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2106 event pairs, 18 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 684. Up to 245 conditions per place. [2023-11-24 21:41:04,247 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 22 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-11-24 21:41:04,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 148 flow [2023-11-24 21:41:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-24 21:41:04,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-24 21:41:04,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-24 21:41:04,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-24 21:41:04,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:04,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-24 21:41:04,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:04,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:04,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2023-11-24 21:41:04,253 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 96 transitions. [2023-11-24 21:41:04,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 148 flow [2023-11-24 21:41:04,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:04,256 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 74 flow [2023-11-24 21:41:04,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-24 21:41:04,258 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-11-24 21:41:04,259 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 74 flow [2023-11-24 21:41:04,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-11-24 21:41:04,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:04,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:04,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:04,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:04,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:04,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 211852019, now seen corresponding path program 1 times [2023-11-24 21:41:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:04,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891328893] [2023-11-24 21:41:04,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:04,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:04,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:04,467 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:04,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 21:41:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:04,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:41:04,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:04,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:04,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891328893] [2023-11-24 21:41:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891328893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:04,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:41:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792321715] [2023-11-24 21:41:04,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:04,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:04,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:04,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:04,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2023-11-24 21:41:04,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 74 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) [2023-11-24 21:41:04,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:04,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2023-11-24 21:41:04,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:04,820 INFO L124 PetriNetUnfolderBase]: 213/486 cut-off events. [2023-11-24 21:41:04,820 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 21:41:04,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 486 events. 213/486 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2537 event pairs, 31 based on Foata normal form. 24/507 useless extension candidates. Maximal degree in co-relation 903. Up to 229 conditions per place. [2023-11-24 21:41:04,824 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 32 selfloop transitions, 4 changer transitions 1/51 dead transitions. [2023-11-24 21:41:04,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 190 flow [2023-11-24 21:41:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2023-11-24 21:41:04,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6761363636363636 [2023-11-24 21:41:04,826 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 119 transitions. [2023-11-24 21:41:04,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 119 transitions. [2023-11-24 21:41:04,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:04,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 119 transitions. [2023-11-24 21:41:04,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:04,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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) [2023-11-24 21:41:04,828 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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) [2023-11-24 21:41:04,828 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 74 flow. Second operand 4 states and 119 transitions. [2023-11-24 21:41:04,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 190 flow [2023-11-24 21:41:04,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:04,831 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 96 flow [2023-11-24 21:41:04,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-11-24 21:41:04,832 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-11-24 21:41:04,832 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 96 flow [2023-11-24 21:41:04,832 INFO L496 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) [2023-11-24 21:41:04,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:04,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:04,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:05,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:05,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:05,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash -757991213, now seen corresponding path program 1 times [2023-11-24 21:41:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:05,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622264044] [2023-11-24 21:41:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:05,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:05,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:05,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:05,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 21:41:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:05,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:41:05,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:05,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:05,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:05,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622264044] [2023-11-24 21:41:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622264044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881191062] [2023-11-24 21:41:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:05,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:05,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2023-11-24 21:41:05,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:05,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:05,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2023-11-24 21:41:05,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:05,378 INFO L124 PetriNetUnfolderBase]: 101/232 cut-off events. [2023-11-24 21:41:05,378 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:41:05,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 232 events. 101/232 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 819 event pairs, 21 based on Foata normal form. 16/245 useless extension candidates. Maximal degree in co-relation 513. Up to 86 conditions per place. [2023-11-24 21:41:05,380 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-11-24 21:41:05,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 195 flow [2023-11-24 21:41:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:41:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:41:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2023-11-24 21:41:05,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2023-11-24 21:41:05,382 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 136 transitions. [2023-11-24 21:41:05,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 136 transitions. [2023-11-24 21:41:05,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:05,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 136 transitions. [2023-11-24 21:41:05,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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) [2023-11-24 21:41:05,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:41:05,384 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:41:05,384 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 96 flow. Second operand 5 states and 136 transitions. [2023-11-24 21:41:05,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 195 flow [2023-11-24 21:41:05,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:05,387 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 112 flow [2023-11-24 21:41:05,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-11-24 21:41:05,388 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2023-11-24 21:41:05,388 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 112 flow [2023-11-24 21:41:05,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:05,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:05,388 INFO L208 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] [2023-11-24 21:41:05,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:05,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:05,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:05,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1012883327, now seen corresponding path program 1 times [2023-11-24 21:41:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:05,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901499563] [2023-11-24 21:41:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:05,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:05,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:05,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:05,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-24 21:41:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:05,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:41:05,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:06,087 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t243~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t244~0#1.base_43| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t243~0#1.base_47|) (_ bv0 1)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t243~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t244~0#1.base_43|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t243~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t244~0#1.base_43| (_ bv0 1))))) is different from true [2023-11-24 21:41:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:06,089 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:06,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901499563] [2023-11-24 21:41:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901499563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:06,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:06,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:41:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591855201] [2023-11-24 21:41:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:06,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:06,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:06,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-24 21:41:06,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2023-11-24 21:41:06,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:06,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:06,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2023-11-24 21:41:06,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:06,281 INFO L124 PetriNetUnfolderBase]: 60/170 cut-off events. [2023-11-24 21:41:06,282 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-24 21:41:06,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 170 events. 60/170 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 624 event pairs, 21 based on Foata normal form. 4/169 useless extension candidates. Maximal degree in co-relation 346. Up to 107 conditions per place. [2023-11-24 21:41:06,284 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 20 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2023-11-24 21:41:06,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 174 flow [2023-11-24 21:41:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:41:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:41:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2023-11-24 21:41:06,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2023-11-24 21:41:06,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 106 transitions. [2023-11-24 21:41:06,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 106 transitions. [2023-11-24 21:41:06,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:06,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 106 transitions. [2023-11-24 21:41:06,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2023-11-24 21:41:06,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:41:06,288 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2023-11-24 21:41:06,288 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 112 flow. Second operand 5 states and 106 transitions. [2023-11-24 21:41:06,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 174 flow [2023-11-24 21:41:06,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 146 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-24 21:41:06,293 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 107 flow [2023-11-24 21:41:06,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-24 21:41:06,295 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-11-24 21:41:06,296 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 107 flow [2023-11-24 21:41:06,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:06,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:06,296 INFO L208 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] [2023-11-24 21:41:06,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:06,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:06,500 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:06,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 326258241, now seen corresponding path program 1 times [2023-11-24 21:41:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065836748] [2023-11-24 21:41:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:06,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:06,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:06,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-24 21:41:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:06,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:41:06,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:06,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:06,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065836748] [2023-11-24 21:41:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065836748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:41:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836866517] [2023-11-24 21:41:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:06,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:41:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:06,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:41:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:41:06,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2023-11-24 21:41:06,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2023-11-24 21:41:06,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:06,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2023-11-24 21:41:06,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:06,977 INFO L124 PetriNetUnfolderBase]: 128/352 cut-off events. [2023-11-24 21:41:06,977 INFO L125 PetriNetUnfolderBase]: For 98/102 co-relation queries the response was YES. [2023-11-24 21:41:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 352 events. 128/352 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1543 event pairs, 33 based on Foata normal form. 4/350 useless extension candidates. Maximal degree in co-relation 752. Up to 145 conditions per place. [2023-11-24 21:41:06,981 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-11-24 21:41:06,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 272 flow [2023-11-24 21:41:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:41:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:41:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2023-11-24 21:41:06,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2023-11-24 21:41:06,983 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 162 transitions. [2023-11-24 21:41:06,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 162 transitions. [2023-11-24 21:41:06,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:06,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 162 transitions. [2023-11-24 21:41:06,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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) [2023-11-24 21:41:06,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 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) [2023-11-24 21:41:06,985 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 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) [2023-11-24 21:41:06,986 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 107 flow. Second operand 6 states and 162 transitions. [2023-11-24 21:41:06,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 272 flow [2023-11-24 21:41:06,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:41:06,989 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 139 flow [2023-11-24 21:41:06,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-11-24 21:41:06,990 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2023-11-24 21:41:06,990 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 139 flow [2023-11-24 21:41:06,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2023-11-24 21:41:06,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:06,990 INFO L208 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] [2023-11-24 21:41:06,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:07,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:07,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:07,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -780281481, now seen corresponding path program 2 times [2023-11-24 21:41:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428035066] [2023-11-24 21:41:07,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:41:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:07,197 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:07,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-24 21:41:07,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 21:41:07,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:41:07,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-24 21:41:07,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:08,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:08,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:41:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428035066] [2023-11-24 21:41:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428035066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:08,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:08,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:41:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589805879] [2023-11-24 21:41:08,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:08,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:41:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:41:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:41:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:41:08,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-24 21:41:08,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 139 flow. Second operand has 9 states, 9 states have (on average 23.555555555555557) internal successors, (212), 9 states have internal predecessors, (212), 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) [2023-11-24 21:41:08,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:08,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-24 21:41:08,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:08,702 INFO L124 PetriNetUnfolderBase]: 162/440 cut-off events. [2023-11-24 21:41:08,702 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2023-11-24 21:41:08,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 440 events. 162/440 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2187 event pairs, 22 based on Foata normal form. 4/431 useless extension candidates. Maximal degree in co-relation 1078. Up to 167 conditions per place. [2023-11-24 21:41:08,706 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 39 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2023-11-24 21:41:08,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 355 flow [2023-11-24 21:41:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:41:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:41:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 263 transitions. [2023-11-24 21:41:08,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5977272727272728 [2023-11-24 21:41:08,708 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 263 transitions. [2023-11-24 21:41:08,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 263 transitions. [2023-11-24 21:41:08,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:08,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 263 transitions. [2023-11-24 21:41:08,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 26.3) internal successors, (263), 10 states have internal predecessors, (263), 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) [2023-11-24 21:41:08,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 44.0) internal successors, (484), 11 states have internal predecessors, (484), 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) [2023-11-24 21:41:08,712 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 44.0) internal successors, (484), 11 states have internal predecessors, (484), 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) [2023-11-24 21:41:08,712 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 139 flow. Second operand 10 states and 263 transitions. [2023-11-24 21:41:08,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 355 flow [2023-11-24 21:41:08,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:08,716 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 234 flow [2023-11-24 21:41:08,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=234, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-11-24 21:41:08,717 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2023-11-24 21:41:08,717 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 234 flow [2023-11-24 21:41:08,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.555555555555557) internal successors, (212), 9 states have internal predecessors, (212), 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) [2023-11-24 21:41:08,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:08,718 INFO L208 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] [2023-11-24 21:41:08,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:08,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:08,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:41:08,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2017973991, now seen corresponding path program 3 times [2023-11-24 21:41:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:41:08,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067251190] [2023-11-24 21:41:08,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:41:08,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:08,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:41:08,933 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:41:08,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-24 21:41:09,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 21:41:09,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 21:41:09,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:41:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:41:09,201 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 21:41:09,202 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:41:09,203 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:41:09,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:41:09,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:41:09,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:41:09,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:41:09,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:41:09,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:41:09,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:41:09,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:41:09,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:41:09,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:09,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:41:09,407 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:09,412 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:41:09,412 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:41:09,464 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:41:09,467 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:41:09,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:41:09,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:41:09,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:41:09 BasicIcfg [2023-11-24 21:41:09,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:41:09,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:41:09,490 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:41:09,490 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:41:09,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:01" (3/4) ... [2023-11-24 21:41:09,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:41:09,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:41:09,494 INFO L158 Benchmark]: Toolchain (without parser) took 10343.54ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 69.4MB in the beginning and 89.5MB in the end (delta: -20.1MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2023-11-24 21:41:09,495 INFO L158 Benchmark]: CDTParser took 1.42ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 40.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:41:09,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.61ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 65.0MB in the end (delta: 4.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-11-24 21:41:09,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.40ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 62.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:41:09,496 INFO L158 Benchmark]: Boogie Preprocessor took 60.10ms. Allocated memory is still 94.4MB. Free memory was 62.2MB in the beginning and 58.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:41:09,496 INFO L158 Benchmark]: RCFGBuilder took 1032.51ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 54.8MB in the end (delta: 3.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:41:09,497 INFO L158 Benchmark]: TraceAbstraction took 8349.75ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 53.9MB in the beginning and 90.6MB in the end (delta: -36.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2023-11-24 21:41:09,497 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 163.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:41:09,499 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.42ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 40.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.61ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 65.0MB in the end (delta: 4.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.40ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 62.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.10ms. Allocated memory is still 94.4MB. Free memory was 62.2MB in the beginning and 58.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1032.51ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 54.8MB in the end (delta: 3.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8349.75ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 53.9MB in the beginning and 90.6MB in the end (delta: -36.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 163.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={7:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={7:0}, t244={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={7:0}, t244={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={7:0}, t244={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix009.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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 5 procedures, 63 locations, 10 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: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 740 IncrementalHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 12 mSDtfsCounter, 740 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 132 ConstructedInterpolants, 1 QuantifiedInterpolants, 1012 SizeOfPredicates, 11 NumberOfNonLiveVariables, 993 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 21:41:09,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5b2cc-defb-4c49-9723-360548d1d300/bin/uautomizer-verify-NlZe1sFDwI/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