./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008.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_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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_fb1e684e-18dc-45d6-9008-495f909afdb8/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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:50:10,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:50:10,899 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:50:10,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:50:10,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:50:10,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:50:10,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:50:10,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:50:10,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:50:10,956 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:50:10,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:50:10,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:50:10,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:50:10,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:50:10,961 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:50:10,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:50:10,962 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:50:10,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:50:10,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:50:10,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:50:10,964 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:50:10,964 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:50:10,965 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:50:10,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:50:10,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:50:10,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:50:10,967 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:50:10,967 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:50:10,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:50:10,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:50:10,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:50:10,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:50:10,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:50:10,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:50:10,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:50:10,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:50:10,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:50:10,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:50:10,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:50:10,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:50:10,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:50:10,973 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_fb1e684e-18dc-45d6-9008-495f909afdb8/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_fb1e684e-18dc-45d6-9008-495f909afdb8/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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2023-11-24 21:50:11,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:50:11,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:50:11,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:50:11,302 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:50:11,302 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:50:11,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2023-11-24 21:50:14,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:50:14,706 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:50:14,714 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2023-11-24 21:50:14,741 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data/3805a1d78/323c200f6aa741f5b02fbd33c33722ec/FLAG0ba43bfd6 [2023-11-24 21:50:14,758 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data/3805a1d78/323c200f6aa741f5b02fbd33c33722ec [2023-11-24 21:50:14,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:50:14,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:50:14,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:50:14,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:50:14,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:50:14,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:50:14" (1/1) ... [2023-11-24 21:50:14,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebd264c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:14, skipping insertion in model container [2023-11-24 21:50:14,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:50:14" (1/1) ... [2023-11-24 21:50:14,848 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:50:15,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:50:15,340 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:50:15,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:50:15,490 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:50:15,490 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:50:15,498 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:50:15,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15 WrapperNode [2023-11-24 21:50:15,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:50:15,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:50:15,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:50:15,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:50:15,508 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:50:15" (1/1) ... [2023-11-24 21:50:15,529 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:50:15" (1/1) ... [2023-11-24 21:50:15,562 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2023-11-24 21:50:15,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:50:15,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:50:15,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:50:15,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:50:15,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,618 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:50:15,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:50:15,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:50:15,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:50:15,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:50:15,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (1/1) ... [2023-11-24 21:50:15,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:50:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:50:15,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:15,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:50:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:50:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:50:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:50:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:50:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:50:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:50:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:50:15,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:50:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:50:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:50:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:50:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:50:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:50:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:50:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:50:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:50:15,749 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:50:15,954 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:50:15,957 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:50:16,386 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:50:16,604 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:50:16,604 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:50:16,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:50:16 BoogieIcfgContainer [2023-11-24 21:50:16,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:50:16,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:50:16,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:50:16,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:50:16,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:50:14" (1/3) ... [2023-11-24 21:50:16,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ee1875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:50:16, skipping insertion in model container [2023-11-24 21:50:16,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:15" (2/3) ... [2023-11-24 21:50:16,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ee1875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:50:16, skipping insertion in model container [2023-11-24 21:50:16,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:50:16" (3/3) ... [2023-11-24 21:50:16,616 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2023-11-24 21:50:16,637 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:50:16,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:50:16,638 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:50:16,701 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:50:16,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 94 flow [2023-11-24 21:50:16,772 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-24 21:50:16,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:50:16,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-24 21:50:16,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 94 flow [2023-11-24 21:50:16,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 41 transitions, 88 flow [2023-11-24 21:50:16,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:50:16,798 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;@4d44ae50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:50:16,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:50:16,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:50:16,802 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:50:16,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:50:16,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:16,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:50:16,804 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:50:16,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash 12529, now seen corresponding path program 1 times [2023-11-24 21:50:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846057453] [2023-11-24 21:50:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:16,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:17,164 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:50:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:17,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846057453] [2023-11-24 21:50:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846057453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:17,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:17,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:50:17,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101290322] [2023-11-24 21:50:17,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:17,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:17,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-24 21:50:17,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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:50:17,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:17,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-24 21:50:17,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:17,449 INFO L124 PetriNetUnfolderBase]: 203/490 cut-off events. [2023-11-24 21:50:17,450 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:50:17,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 490 events. 203/490 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3061 event pairs, 149 based on Foata normal form. 36/484 useless extension candidates. Maximal degree in co-relation 844. Up to 265 conditions per place. [2023-11-24 21:50:17,460 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-24 21:50:17,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 146 flow [2023-11-24 21:50:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:50:17,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-24 21:50:17,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:50:17,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:50:17,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:17,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:50:17,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:50:17,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:17,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:17,487 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 88 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:50:17,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 146 flow [2023-11-24 21:50:17,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:17,493 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-24 21:50:17,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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:50:17,499 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-24 21:50:17,499 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-24 21:50:17,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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:50:17,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:17,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:50:17,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:50:17,501 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:50:17,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 12530, now seen corresponding path program 1 times [2023-11-24 21:50:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:17,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014248794] [2023-11-24 21:50:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:17,626 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:50:17,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:17,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014248794] [2023-11-24 21:50:17,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014248794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:17,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:17,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:50:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792615026] [2023-11-24 21:50:17,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:17,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:17,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-24 21:50:17,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 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:50:17,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:17,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-24 21:50:17,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:17,842 INFO L124 PetriNetUnfolderBase]: 203/489 cut-off events. [2023-11-24 21:50:17,842 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:50:17,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 489 events. 203/489 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3063 event pairs, 149 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 862. Up to 264 conditions per place. [2023-11-24 21:50:17,849 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:50:17,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-24 21:50:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:50:17,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-24 21:50:17,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:50:17,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:50:17,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:17,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:50:17,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:50:17,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:17,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:17,855 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:50:17,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-24 21:50:17,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:17,858 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:50:17,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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:50:17,859 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-24 21:50:17,860 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:50:17,860 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:50:17,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:17,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:50:17,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:50:17,861 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:50:17,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:17,862 INFO L85 PathProgramCache]: Analyzing trace with hash 373603251, now seen corresponding path program 1 times [2023-11-24 21:50:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264679493] [2023-11-24 21:50:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:17,925 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:50:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264679493] [2023-11-24 21:50:17,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264679493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:17,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:50:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783670902] [2023-11-24 21:50:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:17,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:17,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-24 21:50:17,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:50:17,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:17,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-24 21:50:17,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:18,093 INFO L124 PetriNetUnfolderBase]: 205/487 cut-off events. [2023-11-24 21:50:18,093 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:50:18,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 487 events. 205/487 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3040 event pairs, 124 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 865. Up to 265 conditions per place. [2023-11-24 21:50:18,098 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:50:18,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-24 21:50:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-24 21:50:18,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2023-11-24 21:50:18,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-24 21:50:18,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-24 21:50:18,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:18,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-24 21:50:18,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:50:18,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:18,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:18,104 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 87 transitions. [2023-11-24 21:50:18,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-24 21:50:18,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:18,107 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 21:50:18,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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:50:18,108 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-24 21:50:18,108 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 21:50:18,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:50:18,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:18,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:50:18,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:50:18,109 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:50:18,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash 373603252, now seen corresponding path program 1 times [2023-11-24 21:50:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:18,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924556543] [2023-11-24 21:50:18,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:18,237 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:50:18,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:18,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924556543] [2023-11-24 21:50:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924556543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:18,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:18,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:50:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082728793] [2023-11-24 21:50:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:18,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:18,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:18,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:18,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-24 21:50:18,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 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:50:18,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:18,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-24 21:50:18,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:18,442 INFO L124 PetriNetUnfolderBase]: 203/477 cut-off events. [2023-11-24 21:50:18,442 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:50:18,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 477 events. 203/477 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2988 event pairs, 153 based on Foata normal form. 3/446 useless extension candidates. Maximal degree in co-relation 853. Up to 260 conditions per place. [2023-11-24 21:50:18,448 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 21:50:18,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 140 flow [2023-11-24 21:50:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:50:18,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-24 21:50:18,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:50:18,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:50:18,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:18,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:50:18,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:50:18,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:18,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:18,456 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:50:18,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 140 flow [2023-11-24 21:50:18,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:18,460 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 21:50:18,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 21:50:18,463 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-24 21:50:18,463 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 21:50:18,463 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:50:18,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:18,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:50:18,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:50:18,466 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:50:18,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1754536846, now seen corresponding path program 1 times [2023-11-24 21:50:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:18,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925169748] [2023-11-24 21:50:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:18,678 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:50:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925169748] [2023-11-24 21:50:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925169748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:18,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:50:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352957781] [2023-11-24 21:50:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:18,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:18,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-24 21:50:18,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:50:18,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:18,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-24 21:50:18,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:18,806 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-11-24 21:50:18,806 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 21:50:18,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 371 events. 166/371 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2056 event pairs, 18 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 683. Up to 245 conditions per place. [2023-11-24 21:50:18,810 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 22 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-24 21:50:18,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 146 flow [2023-11-24 21:50:18,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-24 21:50:18,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2023-11-24 21:50:18,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-24 21:50:18,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-24 21:50:18,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:18,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-24 21:50:18,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:50:18,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:18,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:18,820 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 93 transitions. [2023-11-24 21:50:18,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 146 flow [2023-11-24 21:50:18,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:18,822 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-24 21:50:18,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-24 21:50:18,824 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-24 21:50:18,824 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-24 21:50:18,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:50:18,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:18,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:50:18,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:50:18,825 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:50:18,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1590334757, now seen corresponding path program 1 times [2023-11-24 21:50:18,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967204074] [2023-11-24 21:50:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:19,158 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:50:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967204074] [2023-11-24 21:50:19,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967204074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:19,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:19,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:50:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611071080] [2023-11-24 21:50:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:19,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:50:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:50:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:50:19,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-24 21:50:19,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 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:50:19,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:19,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-24 21:50:19,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:19,475 INFO L124 PetriNetUnfolderBase]: 144/352 cut-off events. [2023-11-24 21:50:19,476 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-24 21:50:19,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 352 events. 144/352 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1995 event pairs, 120 based on Foata normal form. 15/356 useless extension candidates. Maximal degree in co-relation 630. Up to 215 conditions per place. [2023-11-24 21:50:19,479 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 16 selfloop transitions, 2 changer transitions 7/39 dead transitions. [2023-11-24 21:50:19,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 138 flow [2023-11-24 21:50:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:50:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:50:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2023-11-24 21:50:19,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2023-11-24 21:50:19,481 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 126 transitions. [2023-11-24 21:50:19,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 126 transitions. [2023-11-24 21:50:19,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:19,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 126 transitions. [2023-11-24 21:50:19,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:50:19,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:19,483 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:19,483 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 5 states and 126 transitions. [2023-11-24 21:50:19,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 138 flow [2023-11-24 21:50:19,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:19,485 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-24 21:50:19,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-24 21:50:19,486 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-24 21:50:19,487 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-24 21:50:19,487 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:50:19,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:19,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:50:19,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:50:19,488 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:50:19,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1590334803, now seen corresponding path program 1 times [2023-11-24 21:50:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279292955] [2023-11-24 21:50:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:19,630 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:50:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279292955] [2023-11-24 21:50:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279292955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:50:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636453767] [2023-11-24 21:50:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:19,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:50:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:50:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:50:19,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-24 21:50:19,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:50:19,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:19,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-24 21:50:19,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:19,800 INFO L124 PetriNetUnfolderBase]: 191/431 cut-off events. [2023-11-24 21:50:19,800 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:50:19,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 431 events. 191/431 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2147 event pairs, 31 based on Foata normal form. 24/451 useless extension candidates. Maximal degree in co-relation 790. Up to 191 conditions per place. [2023-11-24 21:50:19,804 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 31 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2023-11-24 21:50:19,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 180 flow [2023-11-24 21:50:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:50:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:50:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2023-11-24 21:50:19,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2023-11-24 21:50:19,806 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 114 transitions. [2023-11-24 21:50:19,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 114 transitions. [2023-11-24 21:50:19,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:19,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 114 transitions. [2023-11-24 21:50:19,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 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:50:19,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 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:50:19,809 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 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:50:19,809 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 4 states and 114 transitions. [2023-11-24 21:50:19,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 180 flow [2023-11-24 21:50:19,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:19,812 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 91 flow [2023-11-24 21:50:19,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-11-24 21:50:19,813 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-24 21:50:19,814 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 91 flow [2023-11-24 21:50:19,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:50:19,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:19,815 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:50:19,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:50:19,815 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:50:19,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 85130742, now seen corresponding path program 1 times [2023-11-24 21:50:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663265352] [2023-11-24 21:50:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:20,004 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:50:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663265352] [2023-11-24 21:50:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663265352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:50:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144876012] [2023-11-24 21:50:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:20,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:50:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:50:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:50:20,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-24 21:50:20,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:50:20,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:20,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-24 21:50:20,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:20,150 INFO L124 PetriNetUnfolderBase]: 97/219 cut-off events. [2023-11-24 21:50:20,150 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:50:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 219 events. 97/219 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 774 event pairs, 21 based on Foata normal form. 16/230 useless extension candidates. Maximal degree in co-relation 496. Up to 86 conditions per place. [2023-11-24 21:50:20,152 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 26 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2023-11-24 21:50:20,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 189 flow [2023-11-24 21:50:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:50:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:50:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2023-11-24 21:50:20,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2023-11-24 21:50:20,154 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 130 transitions. [2023-11-24 21:50:20,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 130 transitions. [2023-11-24 21:50:20,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:20,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 130 transitions. [2023-11-24 21:50:20,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 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:50:20,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:20,157 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:20,157 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 91 flow. Second operand 5 states and 130 transitions. [2023-11-24 21:50:20,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 189 flow [2023-11-24 21:50:20,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:20,160 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 107 flow [2023-11-24 21:50:20,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-24 21:50:20,161 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-11-24 21:50:20,161 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 107 flow [2023-11-24 21:50:20,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:50:20,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:20,162 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] [2023-11-24 21:50:20,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:50:20,162 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:50:20,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1177509844, now seen corresponding path program 1 times [2023-11-24 21:50:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:20,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454430674] [2023-11-24 21:50:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:20,501 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:50:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454430674] [2023-11-24 21:50:20,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454430674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:20,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:20,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:50:20,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73128061] [2023-11-24 21:50:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:20,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:50:20,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:20,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:50:20,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:50:20,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2023-11-24 21:50:20,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 107 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:50:20,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:20,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2023-11-24 21:50:20,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:20,808 INFO L124 PetriNetUnfolderBase]: 141/333 cut-off events. [2023-11-24 21:50:20,809 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-24 21:50:20,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 333 events. 141/333 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1360 event pairs, 33 based on Foata normal form. 4/327 useless extension candidates. Maximal degree in co-relation 729. Up to 163 conditions per place. [2023-11-24 21:50:20,811 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 30 selfloop transitions, 8 changer transitions 9/60 dead transitions. [2023-11-24 21:50:20,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 269 flow [2023-11-24 21:50:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:50:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:50:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2023-11-24 21:50:20,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5780730897009967 [2023-11-24 21:50:20,814 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 174 transitions. [2023-11-24 21:50:20,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 174 transitions. [2023-11-24 21:50:20,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:20,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 174 transitions. [2023-11-24 21:50:20,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 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:50:20,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 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:50:20,817 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 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:50:20,817 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 107 flow. Second operand 7 states and 174 transitions. [2023-11-24 21:50:20,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 269 flow [2023-11-24 21:50:20,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 235 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-24 21:50:20,822 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 131 flow [2023-11-24 21:50:20,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-11-24 21:50:20,824 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-11-24 21:50:20,824 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 131 flow [2023-11-24 21:50:20,824 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:50:20,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:20,825 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] [2023-11-24 21:50:20,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:50:20,825 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:50:20,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1001872268, now seen corresponding path program 2 times [2023-11-24 21:50:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761463027] [2023-11-24 21:50:20,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:21,159 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:50:21,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761463027] [2023-11-24 21:50:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761463027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:21,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:21,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:50:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316801185] [2023-11-24 21:50:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:21,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:50:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:21,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:50:21,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:50:21,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2023-11-24 21:50:21,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 131 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:50:21,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:21,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2023-11-24 21:50:21,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:21,433 INFO L124 PetriNetUnfolderBase]: 171/406 cut-off events. [2023-11-24 21:50:21,433 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-24 21:50:21,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 406 events. 171/406 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1806 event pairs, 51 based on Foata normal form. 4/396 useless extension candidates. Maximal degree in co-relation 908. Up to 151 conditions per place. [2023-11-24 21:50:21,436 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 20 selfloop transitions, 3 changer transitions 27/63 dead transitions. [2023-11-24 21:50:21,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 297 flow [2023-11-24 21:50:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:50:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:50:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2023-11-24 21:50:21,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2023-11-24 21:50:21,438 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 194 transitions. [2023-11-24 21:50:21,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 194 transitions. [2023-11-24 21:50:21,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:21,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 194 transitions. [2023-11-24 21:50:21,440 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:50:21,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 43.0) internal successors, (387), 9 states have internal predecessors, (387), 0 states have call successors, (0), 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:50:21,441 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 43.0) internal successors, (387), 9 states have internal predecessors, (387), 0 states have call successors, (0), 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:50:21,441 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 131 flow. Second operand 8 states and 194 transitions. [2023-11-24 21:50:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 297 flow [2023-11-24 21:50:21,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 291 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:21,445 INFO L231 Difference]: Finished difference. Result has 55 places, 32 transitions, 106 flow [2023-11-24 21:50:21,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2023-11-24 21:50:21,446 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2023-11-24 21:50:21,446 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 32 transitions, 106 flow [2023-11-24 21:50:21,446 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:50:21,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:21,447 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] [2023-11-24 21:50:21,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:50:21,447 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:50:21,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 556208328, now seen corresponding path program 3 times [2023-11-24 21:50:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:21,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015469258] [2023-11-24 21:50:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:23,751 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:50:23,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:50:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015469258] [2023-11-24 21:50:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015469258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:23,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:50:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805305541] [2023-11-24 21:50:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:23,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:50:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:50:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:50:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:50:23,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-24 21:50:23,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 32 transitions, 106 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:50:23,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:23,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-24 21:50:23,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:24,035 INFO L124 PetriNetUnfolderBase]: 68/202 cut-off events. [2023-11-24 21:50:24,035 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2023-11-24 21:50:24,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 202 events. 68/202 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 715 event pairs, 26 based on Foata normal form. 4/197 useless extension candidates. Maximal degree in co-relation 415. Up to 72 conditions per place. [2023-11-24 21:50:24,037 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 15 selfloop transitions, 4 changer transitions 17/52 dead transitions. [2023-11-24 21:50:24,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 226 flow [2023-11-24 21:50:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:50:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:50:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2023-11-24 21:50:24,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5744186046511628 [2023-11-24 21:50:24,039 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 247 transitions. [2023-11-24 21:50:24,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 247 transitions. [2023-11-24 21:50:24,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:24,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 247 transitions. [2023-11-24 21:50:24,041 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:50:24,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 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:50:24,043 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 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:50:24,043 INFO L175 Difference]: Start difference. First operand has 55 places, 32 transitions, 106 flow. Second operand 10 states and 247 transitions. [2023-11-24 21:50:24,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 226 flow [2023-11-24 21:50:24,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 199 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-24 21:50:24,046 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 107 flow [2023-11-24 21:50:24,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=107, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2023-11-24 21:50:24,046 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2023-11-24 21:50:24,047 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 107 flow [2023-11-24 21:50:24,047 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:50:24,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:24,047 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] [2023-11-24 21:50:24,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:50:24,048 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:50:24,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:24,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1772664046, now seen corresponding path program 4 times [2023-11-24 21:50:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:50:24,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297761058] [2023-11-24 21:50:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:24,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:50:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:50:24,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:50:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:50:24,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:50:24,182 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:50:24,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:50:24,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:50:24,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:50:24,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:50:24,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:50:24,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:50:24,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:50:24,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:50:24,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:50:24,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:50:24,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:50:24,188 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:50:24,193 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:50:24,194 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:50:24,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:50:24,238 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:50:24,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:50:24,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:50:24,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:50:24 BasicIcfg [2023-11-24 21:50:24,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:50:24,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:50:24,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:50:24,262 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:50:24,262 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:50:16" (3/4) ... [2023-11-24 21:50:24,264 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:50:24,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:50:24,266 INFO L158 Benchmark]: Toolchain (without parser) took 9500.37ms. Allocated memory was 136.3MB in the beginning and 220.2MB in the end (delta: 83.9MB). Free memory was 87.5MB in the beginning and 132.0MB in the end (delta: -44.5MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2023-11-24 21:50:24,266 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 136.3MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:50:24,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.34ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 87.1MB in the beginning and 141.6MB in the end (delta: -54.4MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2023-11-24 21:50:24,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.34ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:50:24,267 INFO L158 Benchmark]: Boogie Preprocessor took 89.49ms. Allocated memory is still 176.2MB. Free memory was 138.4MB in the beginning and 134.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:50:24,268 INFO L158 Benchmark]: RCFGBuilder took 951.77ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 84.9MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-24 21:50:24,268 INFO L158 Benchmark]: TraceAbstraction took 7652.64ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 83.9MB in the beginning and 132.0MB in the end (delta: -48.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:50:24,269 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 220.2MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:50:24,271 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.23ms. Allocated memory is still 136.3MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.34ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 87.1MB in the beginning and 141.6MB in the end (delta: -54.4MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.34ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.49ms. Allocated memory is still 176.2MB. Free memory was 138.4MB in the beginning and 134.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 951.77ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 84.9MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7652.64ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 83.9MB in the beginning and 132.0MB in the end (delta: -48.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 220.2MB. Free memory is still 132.0MB. 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; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((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, t1723={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] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1723={5:0}, t1724={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] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 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}, 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] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 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) [L790] 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)) [L791] 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)) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 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}, 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] [L801] 2 __unbuffered_p1_EBX = x 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}, 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] [L743] 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] [L746] 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] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 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) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 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] [L804] 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) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 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 [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 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] [L811] 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=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] [L767] 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=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] [L831] 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, t1723={5:0}, t1724={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] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 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) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 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 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 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, t1723={5:0}, t1724={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] [L842] 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, t1723={5:0}, t1724={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] [L844] 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] [L18] 0 __assert_fail ("0", "rfi008.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] - 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: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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, 61 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: 7.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 359 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 926 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 10 mSDtfsCounter, 926 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 21:50:24,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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_fb1e684e-18dc-45d6-9008-495f909afdb8/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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:50:26,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:50:27,144 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:50:27,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:50:27,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:50:27,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:50:27,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:50:27,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:50:27,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:50:27,209 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:50:27,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:50:27,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:50:27,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:50:27,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:50:27,213 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:50:27,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:50:27,214 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:50:27,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:50:27,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:50:27,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:50:27,216 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:50:27,217 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:50:27,218 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:50:27,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:50:27,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:50:27,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:50:27,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:50:27,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:50:27,221 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:50:27,221 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:50:27,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:50:27,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:50:27,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:50:27,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:50:27,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:50:27,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:50:27,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:50:27,227 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:50:27,227 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:50:27,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:50:27,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:50:27,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:50:27,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:50:27,229 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:50:27,230 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_fb1e684e-18dc-45d6-9008-495f909afdb8/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_fb1e684e-18dc-45d6-9008-495f909afdb8/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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2023-11-24 21:50:27,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:50:27,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:50:27,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:50:27,711 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:50:27,712 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:50:27,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2023-11-24 21:50:30,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:50:31,239 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:50:31,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2023-11-24 21:50:31,279 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data/972e3ac33/2f7f1c136feb4083a61aecd3cc962f86/FLAG923604c5b [2023-11-24 21:50:31,299 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/data/972e3ac33/2f7f1c136feb4083a61aecd3cc962f86 [2023-11-24 21:50:31,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:50:31,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:50:31,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:50:31,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:50:31,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:50:31,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:50:31" (1/1) ... [2023-11-24 21:50:31,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c6106e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:31, skipping insertion in model container [2023-11-24 21:50:31,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:50:31" (1/1) ... [2023-11-24 21:50:31,392 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:50:31,995 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:50:32,017 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:50:32,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:50:32,204 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:50:32,204 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:50:32,213 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:50:32,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32 WrapperNode [2023-11-24 21:50:32,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:50:32,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:50:32,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:50:32,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:50:32,224 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:50:32" (1/1) ... [2023-11-24 21:50:32,271 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:50:32" (1/1) ... [2023-11-24 21:50:32,316 INFO L138 Inliner]: procedures = 178, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-11-24 21:50:32,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:50:32,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:50:32,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:50:32,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:50:32,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,376 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:50:32,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:50:32,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:50:32,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:50:32,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:50:32,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (1/1) ... [2023-11-24 21:50:32,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:50:32,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:50:32,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:32,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:50:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:50:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:50:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:50:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:50:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:50:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:50:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:50:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:50:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:50:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:50:32,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:50:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:50:32,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:50:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:50:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:50:32,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:50:32,524 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:50:32,725 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:50:32,727 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:50:33,196 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:50:33,521 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:50:33,522 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:50:33,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:50:33 BoogieIcfgContainer [2023-11-24 21:50:33,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:50:33,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:50:33,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:50:33,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:50:33,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:50:31" (1/3) ... [2023-11-24 21:50:33,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fd2ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:50:33, skipping insertion in model container [2023-11-24 21:50:33,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:50:32" (2/3) ... [2023-11-24 21:50:33,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fd2ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:50:33, skipping insertion in model container [2023-11-24 21:50:33,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:50:33" (3/3) ... [2023-11-24 21:50:33,545 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2023-11-24 21:50:33,568 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:50:33,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:50:33,569 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:50:33,647 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:50:33,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 94 flow [2023-11-24 21:50:33,719 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-24 21:50:33,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:50:33,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-24 21:50:33,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 94 flow [2023-11-24 21:50:33,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 41 transitions, 88 flow [2023-11-24 21:50:33,749 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:50:33,757 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;@76837ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:50:33,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:50:33,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:50:33,762 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:50:33,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:50:33,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:33,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:50:33,765 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:50:33,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash 12593, now seen corresponding path program 1 times [2023-11-24 21:50:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322733114] [2023-11-24 21:50:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:33,792 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:50:33,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:33,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:33,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:33,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:50:33,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:33,994 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:50:34,017 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:50:34,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:34,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:34,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322733114] [2023-11-24 21:50:34,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322733114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:34,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:34,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:50:34,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307296500] [2023-11-24 21:50:34,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:34,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:34,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:34,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:34,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-24 21:50:34,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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:50:34,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:34,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-24 21:50:34,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:34,402 INFO L124 PetriNetUnfolderBase]: 203/490 cut-off events. [2023-11-24 21:50:34,402 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:50:34,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 490 events. 203/490 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3056 event pairs, 149 based on Foata normal form. 36/491 useless extension candidates. Maximal degree in co-relation 844. Up to 265 conditions per place. [2023-11-24 21:50:34,410 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-24 21:50:34,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 146 flow [2023-11-24 21:50:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:50:34,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-24 21:50:34,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:50:34,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:50:34,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:34,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:50:34,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:50:34,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:34,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:34,438 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 88 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:50:34,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 146 flow [2023-11-24 21:50:34,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:34,444 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-24 21:50:34,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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:50:34,450 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-24 21:50:34,450 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-24 21:50:34,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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:50:34,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:34,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:50:34,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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)] Ended with exit code 0 [2023-11-24 21:50:34,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:34,654 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:50:34,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash 12594, now seen corresponding path program 1 times [2023-11-24 21:50:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:34,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410938808] [2023-11-24 21:50:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:34,656 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:50:34,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:34,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:34,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:34,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:50:34,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:34,763 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:50:34,774 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:50:34,774 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:34,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410938808] [2023-11-24 21:50:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410938808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:34,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:50:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125344906] [2023-11-24 21:50:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:34,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:34,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:34,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-24 21:50:34,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 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:50:34,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:34,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-24 21:50:34,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:35,020 INFO L124 PetriNetUnfolderBase]: 203/489 cut-off events. [2023-11-24 21:50:35,021 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:50:35,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 489 events. 203/489 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3069 event pairs, 149 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 862. Up to 264 conditions per place. [2023-11-24 21:50:35,027 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:50:35,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-24 21:50:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:50:35,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-24 21:50:35,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:50:35,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:50:35,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:35,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:50:35,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:50:35,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:35,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:35,045 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:50:35,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-24 21:50:35,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:35,051 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:50:35,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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:50:35,053 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-24 21:50:35,053 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:50:35,053 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:50:35,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:35,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:50:35,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,256 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:50:35,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash 375509939, now seen corresponding path program 1 times [2023-11-24 21:50:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447745128] [2023-11-24 21:50:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:35,258 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:50:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:35,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:35,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:50:35,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:35,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 7 [2023-11-24 21:50:35,391 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:50:35,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:35,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:35,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447745128] [2023-11-24 21:50:35,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447745128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:50:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234211388] [2023-11-24 21:50:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:35,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:35,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:35,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:35,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:35,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-24 21:50:35,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:50:35,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:35,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-24 21:50:35,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:35,588 INFO L124 PetriNetUnfolderBase]: 205/488 cut-off events. [2023-11-24 21:50:35,589 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:50:35,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 488 events. 205/488 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3030 event pairs, 99 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 866. Up to 265 conditions per place. [2023-11-24 21:50:35,595 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:50:35,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-24 21:50:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-24 21:50:35,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2023-11-24 21:50:35,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-24 21:50:35,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-24 21:50:35,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:35,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-24 21:50:35,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:50:35,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:35,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:35,607 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 87 transitions. [2023-11-24 21:50:35,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-24 21:50:35,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:35,610 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 21:50:35,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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:50:35,612 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-24 21:50:35,613 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 21:50:35,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:50:35,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:35,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:50:35,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,816 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:50:35,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash 375509940, now seen corresponding path program 1 times [2023-11-24 21:50:35,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:35,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452799912] [2023-11-24 21:50:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:35,818 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:50:35,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:35,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:35,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:50:35,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:35,934 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:50:35,948 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:50:35,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:35,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:35,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452799912] [2023-11-24 21:50:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452799912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:35,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:35,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:50:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938514898] [2023-11-24 21:50:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:35,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:35,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:35,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:35,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-24 21:50:35,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 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:50:35,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:35,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-24 21:50:35,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:36,129 INFO L124 PetriNetUnfolderBase]: 203/477 cut-off events. [2023-11-24 21:50:36,129 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:50:36,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 477 events. 203/477 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2927 event pairs, 153 based on Foata normal form. 3/452 useless extension candidates. Maximal degree in co-relation 853. Up to 260 conditions per place. [2023-11-24 21:50:36,134 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 21:50:36,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 140 flow [2023-11-24 21:50:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:50:36,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-24 21:50:36,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:50:36,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:50:36,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:36,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:50:36,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:50:36,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:36,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:36,138 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:50:36,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 140 flow [2023-11-24 21:50:36,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:36,141 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 21:50:36,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 21:50:36,142 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-24 21:50:36,143 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 21:50:36,143 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:50:36,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:36,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:50:36,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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)] Ended with exit code 0 [2023-11-24 21:50:36,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:36,346 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:50:36,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1572859182, now seen corresponding path program 1 times [2023-11-24 21:50:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:36,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938549927] [2023-11-24 21:50:36,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:36,347 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:50:36,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:36,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:36,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:36,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:50:36,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:36,496 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:50:36,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:36,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938549927] [2023-11-24 21:50:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938549927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:50:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668301357] [2023-11-24 21:50:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:36,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:50:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:50:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:50:36,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-24 21:50:36,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:50:36,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:36,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-24 21:50:36,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:36,620 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-11-24 21:50:36,620 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 21:50:36,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 371 events. 166/371 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2059 event pairs, 18 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 683. Up to 245 conditions per place. [2023-11-24 21:50:36,624 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 22 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-24 21:50:36,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 146 flow [2023-11-24 21:50:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:50:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:50:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-24 21:50:36,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2023-11-24 21:50:36,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-24 21:50:36,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-24 21:50:36,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:36,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-24 21:50:36,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:50:36,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:36,628 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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:50:36,629 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 93 transitions. [2023-11-24 21:50:36,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 146 flow [2023-11-24 21:50:36,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:36,631 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-24 21:50:36,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-24 21:50:36,632 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-24 21:50:36,632 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-24 21:50:36,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:50:36,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:36,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:50:36,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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)] Ended with exit code 0 [2023-11-24 21:50:36,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:36,836 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:50:36,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1177415843, now seen corresponding path program 1 times [2023-11-24 21:50:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658403193] [2023-11-24 21:50:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:36,837 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:50:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:36,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:36,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:36,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:50:36,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:37,007 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:50:37,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:37,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658403193] [2023-11-24 21:50:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658403193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:37,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:37,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:50:37,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250113472] [2023-11-24 21:50:37,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:37,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:50:37,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:50:37,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:50:37,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-24 21:50:37,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:50:37,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:37,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-24 21:50:37,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:37,220 INFO L124 PetriNetUnfolderBase]: 213/485 cut-off events. [2023-11-24 21:50:37,221 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 21:50:37,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 485 events. 213/485 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2519 event pairs, 31 based on Foata normal form. 24/507 useless extension candidates. Maximal degree in co-relation 902. Up to 229 conditions per place. [2023-11-24 21:50:37,225 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 32 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2023-11-24 21:50:37,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 188 flow [2023-11-24 21:50:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:50:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:50:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2023-11-24 21:50:37,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2023-11-24 21:50:37,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2023-11-24 21:50:37,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2023-11-24 21:50:37,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:37,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2023-11-24 21:50:37,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:50:37,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 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:50:37,230 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 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:50:37,230 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 4 states and 115 transitions. [2023-11-24 21:50:37,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 188 flow [2023-11-24 21:50:37,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:37,233 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 94 flow [2023-11-24 21:50:37,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-24 21:50:37,234 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-24 21:50:37,234 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 94 flow [2023-11-24 21:50:37,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:50:37,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:37,235 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:50:37,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:37,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:37,438 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:50:37,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash -966942074, now seen corresponding path program 1 times [2023-11-24 21:50:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:37,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850073022] [2023-11-24 21:50:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:37,439 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:50:37,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:37,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:37,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:37,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:50:37,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:37,645 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:50:37,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:37,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:37,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850073022] [2023-11-24 21:50:37,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850073022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:37,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:37,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:50:37,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102084661] [2023-11-24 21:50:37,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:37,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:50:37,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:37,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:50:37,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:50:37,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-24 21:50:37,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:50:37,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:37,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-24 21:50:37,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:37,840 INFO L124 PetriNetUnfolderBase]: 101/231 cut-off events. [2023-11-24 21:50:37,841 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:50:37,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 231 events. 101/231 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 817 event pairs, 21 based on Foata normal form. 16/245 useless extension candidates. Maximal degree in co-relation 512. Up to 86 conditions per place. [2023-11-24 21:50:37,843 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 27 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2023-11-24 21:50:37,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 193 flow [2023-11-24 21:50:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:50:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:50:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2023-11-24 21:50:37,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6093023255813953 [2023-11-24 21:50:37,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 131 transitions. [2023-11-24 21:50:37,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 131 transitions. [2023-11-24 21:50:37,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:37,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 131 transitions. [2023-11-24 21:50:37,846 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:50:37,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:37,848 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:37,848 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 94 flow. Second operand 5 states and 131 transitions. [2023-11-24 21:50:37,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 193 flow [2023-11-24 21:50:37,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 184 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:50:37,851 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 110 flow [2023-11-24 21:50:37,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-24 21:50:37,852 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-11-24 21:50:37,852 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 110 flow [2023-11-24 21:50:37,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:50:37,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:37,853 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] [2023-11-24 21:50:37,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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)] Ended with exit code 0 [2023-11-24 21:50:38,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:38,056 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:50:38,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash 916274200, now seen corresponding path program 1 times [2023-11-24 21:50:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092667365] [2023-11-24 21:50:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:38,058 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:50:38,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:38,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:38,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:38,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:50:38,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:38,624 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1723~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1724~0#1.base_49| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1723~0#1.base_43| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1724~0#1.base_49| (_ bv0 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1723~0#1.base_43| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1724~0#1.base_49|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1723~0#1.base_43|)))) is different from true [2023-11-24 21:50:38,626 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:50:38,626 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:38,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092667365] [2023-11-24 21:50:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092667365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:38,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:50:38,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112982227] [2023-11-24 21:50:38,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:38,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:50:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:38,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:50:38,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-24 21:50:38,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2023-11-24 21:50:38,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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:50:38,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:38,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2023-11-24 21:50:38,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:38,831 INFO L124 PetriNetUnfolderBase]: 60/169 cut-off events. [2023-11-24 21:50:38,831 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-24 21:50:38,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 169 events. 60/169 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 608 event pairs, 21 based on Foata normal form. 4/169 useless extension candidates. Maximal degree in co-relation 345. Up to 107 conditions per place. [2023-11-24 21:50:38,833 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 20 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-11-24 21:50:38,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 172 flow [2023-11-24 21:50:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:50:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:50:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2023-11-24 21:50:38,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2023-11-24 21:50:38,835 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 101 transitions. [2023-11-24 21:50:38,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 101 transitions. [2023-11-24 21:50:38,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:38,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 101 transitions. [2023-11-24 21:50:38,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 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:50:38,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:38,838 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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:50:38,838 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 110 flow. Second operand 5 states and 101 transitions. [2023-11-24 21:50:38,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 172 flow [2023-11-24 21:50:38,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 144 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-24 21:50:38,841 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 105 flow [2023-11-24 21:50:38,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-11-24 21:50:38,842 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-11-24 21:50:38,842 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 105 flow [2023-11-24 21:50:38,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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:50:38,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:38,843 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] [2023-11-24 21:50:38,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:39,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:39,047 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:50:39,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:39,047 INFO L85 PathProgramCache]: Analyzing trace with hash 689520884, now seen corresponding path program 1 times [2023-11-24 21:50:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:39,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2351503] [2023-11-24 21:50:39,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:50:39,048 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:50:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:39,049 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:39,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:50:39,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:50:39,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:39,259 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:50:39,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:39,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2351503] [2023-11-24 21:50:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2351503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:39,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:39,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:50:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357887994] [2023-11-24 21:50:39,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:39,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:50:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:50:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:50:39,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-24 21:50:39,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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:50:39,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:39,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-24 21:50:39,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:39,530 INFO L124 PetriNetUnfolderBase]: 128/338 cut-off events. [2023-11-24 21:50:39,530 INFO L125 PetriNetUnfolderBase]: For 98/102 co-relation queries the response was YES. [2023-11-24 21:50:39,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 338 events. 128/338 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1439 event pairs, 33 based on Foata normal form. 4/335 useless extension candidates. Maximal degree in co-relation 738. Up to 145 conditions per place. [2023-11-24 21:50:39,533 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 40 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-11-24 21:50:39,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 270 flow [2023-11-24 21:50:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:50:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:50:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2023-11-24 21:50:39,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2023-11-24 21:50:39,535 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 156 transitions. [2023-11-24 21:50:39,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 156 transitions. [2023-11-24 21:50:39,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:39,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 156 transitions. [2023-11-24 21:50:39,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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:50:39,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 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:50:39,538 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 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:50:39,538 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 105 flow. Second operand 6 states and 156 transitions. [2023-11-24 21:50:39,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 270 flow [2023-11-24 21:50:39,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:50:39,542 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 137 flow [2023-11-24 21:50:39,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-24 21:50:39,543 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-11-24 21:50:39,543 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 137 flow [2023-11-24 21:50:39,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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:50:39,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:39,544 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] [2023-11-24 21:50:39,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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)] Ended with exit code 0 [2023-11-24 21:50:39,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:39,747 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:50:39,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:39,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1966561906, now seen corresponding path program 2 times [2023-11-24 21:50:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454908550] [2023-11-24 21:50:39,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:50:39,748 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:50:39,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:39,750 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:39,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:39,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 21:50:39,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:50:39,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-24 21:50:39,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:50:40,974 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:50:40,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:50:40,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:50:40,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454908550] [2023-11-24 21:50:40,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454908550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:50:40,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:50:40,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:50:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706352776] [2023-11-24 21:50:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:50:40,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:50:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:50:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:50:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:50:40,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-24 21:50:40,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 137 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:50:40,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:50:40,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-24 21:50:40,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:50:41,443 INFO L124 PetriNetUnfolderBase]: 162/437 cut-off events. [2023-11-24 21:50:41,444 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2023-11-24 21:50:41,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 437 events. 162/437 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2166 event pairs, 22 based on Foata normal form. 4/431 useless extension candidates. Maximal degree in co-relation 1075. Up to 167 conditions per place. [2023-11-24 21:50:41,448 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 39 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2023-11-24 21:50:41,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 353 flow [2023-11-24 21:50:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:50:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:50:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2023-11-24 21:50:41,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5883720930232558 [2023-11-24 21:50:41,451 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 253 transitions. [2023-11-24 21:50:41,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 253 transitions. [2023-11-24 21:50:41,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:50:41,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 253 transitions. [2023-11-24 21:50:41,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 25.3) internal successors, (253), 10 states have internal predecessors, (253), 0 states have call successors, (0), 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:50:41,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 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:50:41,454 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 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:50:41,454 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 137 flow. Second operand 10 states and 253 transitions. [2023-11-24 21:50:41,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 353 flow [2023-11-24 21:50:41,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:50:41,459 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 232 flow [2023-11-24 21:50:41,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-11-24 21:50:41,460 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2023-11-24 21:50:41,460 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 232 flow [2023-11-24 21:50:41,461 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:50:41,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:50:41,461 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] [2023-11-24 21:50:41,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:41,665 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:50:41,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:50:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -596149118, now seen corresponding path program 3 times [2023-11-24 21:50:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:50:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886287798] [2023-11-24 21:50:41,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:50:41,666 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:50:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:50:41,668 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:41,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:41,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 21:50:41,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 21:50:41,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:50:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:50:42,009 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 21:50:42,009 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:50:42,010 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:50:42,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:50:42,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:50:42,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:50:42,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:50:42,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:50:42,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:50:42,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:50:42,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:50:42,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:50:42,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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)] Ended with exit code 0 [2023-11-24 21:50:42,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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:50:42,218 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:50:42,224 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:50:42,224 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:50:42,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:50:42,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:50:42,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:50:42,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:50:42,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:50:42 BasicIcfg [2023-11-24 21:50:42,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:50:42,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:50:42,335 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:50:42,335 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:50:42,335 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:50:33" (3/4) ... [2023-11-24 21:50:42,337 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:50:42,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:50:42,339 INFO L158 Benchmark]: Toolchain (without parser) took 11036.69ms. Allocated memory was 79.7MB in the beginning and 182.5MB in the end (delta: 102.8MB). Free memory was 54.3MB in the beginning and 140.4MB in the end (delta: -86.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-11-24 21:50:42,340 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 54.5MB. Free memory is still 30.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:50:42,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 910.11ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 50.0MB in the end (delta: 4.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2023-11-24 21:50:42,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.75ms. Allocated memory is still 79.7MB. Free memory was 50.0MB in the beginning and 47.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:50:42,341 INFO L158 Benchmark]: Boogie Preprocessor took 109.86ms. Allocated memory is still 79.7MB. Free memory was 47.2MB in the beginning and 43.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:50:42,341 INFO L158 Benchmark]: RCFGBuilder took 1095.77ms. Allocated memory is still 79.7MB. Free memory was 43.6MB in the beginning and 28.7MB in the end (delta: 14.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-24 21:50:42,342 INFO L158 Benchmark]: TraceAbstraction took 8798.99ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 80.1MB in the beginning and 141.4MB in the end (delta: -61.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2023-11-24 21:50:42,342 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 182.5MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:50:42,344 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.46ms. Allocated memory is still 54.5MB. Free memory is still 30.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 910.11ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 50.0MB in the end (delta: 4.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.75ms. Allocated memory is still 79.7MB. Free memory was 50.0MB in the beginning and 47.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.86ms. Allocated memory is still 79.7MB. Free memory was 47.2MB in the beginning and 43.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.77ms. Allocated memory is still 79.7MB. Free memory was 43.6MB in the beginning and 28.7MB in the end (delta: 14.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8798.99ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 80.1MB in the beginning and 141.4MB in the end (delta: -61.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 182.5MB. Free memory is still 140.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; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((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, t1723={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] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((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, t1723={3:0}, t1724={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] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 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] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 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) [L790] 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)) [L791] 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)) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 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] [L801] 2 __unbuffered_p1_EBX = x 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}, 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] [L743] 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] [L746] 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] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 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) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 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] [L767] 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=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L804] 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) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 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 [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 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=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=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] [L811] 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] [L831] 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, t1723={3:0}, t1724={7: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] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 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) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 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 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 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, t1723={3:0}, t1724={7: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] [L842] 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, t1723={3:0}, t1724={7: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] [L844] 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] [L18] 0 __assert_fail ("0", "rfi008.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] - 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: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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, 61 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.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 780 IncrementalHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 5 mSDtfsCounter, 780 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred 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.8s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 1 QuantifiedInterpolants, 1030 SizeOfPredicates, 12 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 61 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:50:42,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb1e684e-18dc-45d6-9008-495f909afdb8/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