./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --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 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:37:45,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:37:45,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:37:45,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:37:45,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:37:45,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:37:45,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:37:45,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:37:45,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:37:45,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:37:45,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:37:45,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:37:45,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:37:45,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:37:45,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:37:45,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:37:45,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:37:45,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:37:45,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:37:45,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:37:45,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:37:45,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:37:45,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:37:45,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:37:45,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:37:45,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:37:45,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:37:45,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:37:45,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:37:45,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:37:45,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:37:45,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:37:45,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:37:45,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:37:45,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:37:45,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:37:45,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:37:46,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:37:46,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:37:46,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:37:46,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:37:46,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:37:46,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:37:46,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:37:46,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:37:46,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:37:46,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:37:46,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:37:46,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:37:46,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:37:46,064 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:37:46,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:37:46,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:37:46,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:37:46,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:37:46,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:37:46,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:37:46,065 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:37:46,065 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:37:46,066 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:37:46,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:37:46,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:37:46,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:37:46,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:37:46,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:37:46,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:37:46,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:37:46,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:37:46,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:37:46,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:37:46,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:37:46,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:37:46,090 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:37:46,090 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:37:46,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:37:46,091 INFO L138 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_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2022-11-25 15:37:46,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:37:46,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:37:46,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:37:46,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:37:46,363 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:37:46,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-11-25 15:37:49,377 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:37:49,713 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:37:49,715 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-11-25 15:37:49,732 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data/1eb4f0b47/ba72278070cb42bcbeb39835be874422/FLAG745275bd9 [2022-11-25 15:37:49,753 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data/1eb4f0b47/ba72278070cb42bcbeb39835be874422 [2022-11-25 15:37:49,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:37:49,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:37:49,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:37:49,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:37:49,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:37:49,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:49" (1/1) ... [2022-11-25 15:37:49,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df35ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:49, skipping insertion in model container [2022-11-25 15:37:49,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:49" (1/1) ... [2022-11-25 15:37:49,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:37:49,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:37:50,089 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-11-25 15:37:50,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:37:50,365 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:37:50,382 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-11-25 15:37:50,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:50,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:50,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:37:50,537 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:37:50,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50 WrapperNode [2022-11-25 15:37:50,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:37:50,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:37:50,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:37:50,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:37:50,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,598 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-25 15:37:50,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:37:50,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:37:50,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:37:50,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:37:50,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:37:50,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:37:50,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:37:50,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:37:50,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (1/1) ... [2022-11-25 15:37:50,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:37:50,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:37:50,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:37:50,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:37:50,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:37:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:37:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:37:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:37:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:37:50,746 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:37:50,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:37:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:37:50,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:37:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:37:50,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:37:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 15:37:50,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 15:37:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:37:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:37:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:37:50,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:37:50,750 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:37:50,925 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:37:50,927 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:37:51,408 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:37:51,642 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:37:51,642 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:37:51,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:51 BoogieIcfgContainer [2022-11-25 15:37:51,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:37:51,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:37:51,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:37:51,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:37:51,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:37:49" (1/3) ... [2022-11-25 15:37:51,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8c88e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:37:51, skipping insertion in model container [2022-11-25 15:37:51,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:50" (2/3) ... [2022-11-25 15:37:51,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8c88e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:37:51, skipping insertion in model container [2022-11-25 15:37:51,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:51" (3/3) ... [2022-11-25 15:37:51,654 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2022-11-25 15:37:51,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:37:51,669 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 15:37:51,669 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:37:51,726 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:37:51,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-11-25 15:37:51,828 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-25 15:37:51,828 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:51,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 15:37:51,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-11-25 15:37:51,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-11-25 15:37:51,848 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:37:51,871 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-11-25 15:37:51,880 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-11-25 15:37:51,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-11-25 15:37:51,956 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-25 15:37:51,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:51,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 15:37:51,965 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-11-25 15:37:58,861 INFO L134 LiptonReduction]: Checked pairs total: 10417 [2022-11-25 15:37:58,861 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-11-25 15:37:58,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:37:58,885 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;@7a5e6c2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:37:58,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 15:37:58,887 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 15:37:58,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:58,887 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:58,888 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:37:58,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:37:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 1 times [2022-11-25 15:37:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:37:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537502887] [2022-11-25 15:37:58,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:37:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:59,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:37:59,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537502887] [2022-11-25 15:37:59,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537502887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:59,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:59,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:37:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013105741] [2022-11-25 15:37:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:59,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:37:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:37:59,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:37:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:37:59,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 293 [2022-11-25 15:37:59,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:37:59,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:59,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 293 [2022-11-25 15:37:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:01,409 INFO L130 PetriNetUnfolder]: 10487/14093 cut-off events. [2022-11-25 15:38:01,409 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 15:38:01,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28369 conditions, 14093 events. 10487/14093 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 72139 event pairs, 10487 based on Foata normal form. 0/12388 useless extension candidates. Maximal degree in co-relation 28357. Up to 14059 conditions per place. [2022-11-25 15:38:01,512 INFO L137 encePairwiseOnDemand]: 284/293 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 15:38:01,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2022-11-25 15:38:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:38:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:38:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 312 transitions. [2022-11-25 15:38:01,532 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5324232081911263 [2022-11-25 15:38:01,533 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 312 transitions. [2022-11-25 15:38:01,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 312 transitions. [2022-11-25 15:38:01,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:01,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 312 transitions. [2022-11-25 15:38:01,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:01,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:01,553 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:01,555 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 312 transitions. [2022-11-25 15:38:01,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2022-11-25 15:38:01,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:38:01,565 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-11-25 15:38:01,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-11-25 15:38:01,571 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-11-25 15:38:01,571 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-11-25 15:38:01,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:01,572 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:01,572 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:38:01,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:38:01,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 621144, now seen corresponding path program 1 times [2022-11-25 15:38:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:01,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569709630] [2022-11-25 15:38:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:01,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569709630] [2022-11-25 15:38:01,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569709630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:01,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:01,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:38:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717924402] [2022-11-25 15:38:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:01,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:38:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:38:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:38:01,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2022-11-25 15:38:01,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:01,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:01,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2022-11-25 15:38:01,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:03,875 INFO L130 PetriNetUnfolder]: 8247/11825 cut-off events. [2022-11-25 15:38:03,875 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:38:03,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23102 conditions, 11825 events. 8247/11825 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 72102 event pairs, 1527 based on Foata normal form. 0/11051 useless extension candidates. Maximal degree in co-relation 23099. Up to 8863 conditions per place. [2022-11-25 15:38:03,956 INFO L137 encePairwiseOnDemand]: 290/293 looper letters, 47 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2022-11-25 15:38:03,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2022-11-25 15:38:03,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:38:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:38:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2022-11-25 15:38:03,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5233219567690558 [2022-11-25 15:38:03,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2022-11-25 15:38:03,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2022-11-25 15:38:03,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:03,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2022-11-25 15:38:03,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:03,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:03,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:03,968 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 460 transitions. [2022-11-25 15:38:03,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2022-11-25 15:38:03,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:38:03,970 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-11-25 15:38:03,970 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-11-25 15:38:03,973 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 15:38:03,976 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-11-25 15:38:03,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:03,977 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:03,977 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:03,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:38:03,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash 975237454, now seen corresponding path program 1 times [2022-11-25 15:38:03,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:03,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216436337] [2022-11-25 15:38:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:04,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216436337] [2022-11-25 15:38:04,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216436337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:04,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:04,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:38:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252086016] [2022-11-25 15:38:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:04,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:38:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:38:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:38:05,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 293 [2022-11-25 15:38:05,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:05,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:05,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 293 [2022-11-25 15:38:05,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:06,610 INFO L130 PetriNetUnfolder]: 5879/7985 cut-off events. [2022-11-25 15:38:06,610 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2022-11-25 15:38:06,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16650 conditions, 7985 events. 5879/7985 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39732 event pairs, 288 based on Foata normal form. 0/7985 useless extension candidates. Maximal degree in co-relation 16646. Up to 5184 conditions per place. [2022-11-25 15:38:06,666 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 52 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2022-11-25 15:38:06,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 254 flow [2022-11-25 15:38:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:38:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 892 transitions. [2022-11-25 15:38:06,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4349098000975134 [2022-11-25 15:38:06,671 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 892 transitions. [2022-11-25 15:38:06,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 892 transitions. [2022-11-25 15:38:06,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:06,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 892 transitions. [2022-11-25 15:38:06,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:06,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:06,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:06,680 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 7 states and 892 transitions. [2022-11-25 15:38:06,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 254 flow [2022-11-25 15:38:06,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:38:06,682 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 76 flow [2022-11-25 15:38:06,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-11-25 15:38:06,684 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2022-11-25 15:38:06,684 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 76 flow [2022-11-25 15:38:06,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:06,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:06,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:06,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:38:06,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash 975237432, now seen corresponding path program 1 times [2022-11-25 15:38:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:06,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632839306] [2022-11-25 15:38:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:06,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:06,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632839306] [2022-11-25 15:38:06,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632839306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:06,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:06,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:38:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582908476] [2022-11-25 15:38:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:06,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:38:06,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:38:06,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:38:06,897 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2022-11-25 15:38:06,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:06,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:06,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2022-11-25 15:38:06,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:10,371 INFO L130 PetriNetUnfolder]: 21169/28724 cut-off events. [2022-11-25 15:38:10,372 INFO L131 PetriNetUnfolder]: For 1207/1207 co-relation queries the response was YES. [2022-11-25 15:38:10,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59298 conditions, 28724 events. 21169/28724 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 156103 event pairs, 6964 based on Foata normal form. 1188/29912 useless extension candidates. Maximal degree in co-relation 59294. Up to 16956 conditions per place. [2022-11-25 15:38:10,561 INFO L137 encePairwiseOnDemand]: 284/293 looper letters, 48 selfloop transitions, 7 changer transitions 35/90 dead transitions. [2022-11-25 15:38:10,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 90 transitions, 396 flow [2022-11-25 15:38:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:38:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:38:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-11-25 15:38:10,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.489419795221843 [2022-11-25 15:38:10,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2022-11-25 15:38:10,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2022-11-25 15:38:10,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:10,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2022-11-25 15:38:10,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:10,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:10,585 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:10,585 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 76 flow. Second operand 5 states and 717 transitions. [2022-11-25 15:38:10,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 90 transitions, 396 flow [2022-11-25 15:38:10,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 90 transitions, 378 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-25 15:38:10,600 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 138 flow [2022-11-25 15:38:10,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-11-25 15:38:10,602 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-11-25 15:38:10,602 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 138 flow [2022-11-25 15:38:10,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:10,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:10,603 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:10,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:38:10,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash 167600095, now seen corresponding path program 1 times [2022-11-25 15:38:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655385470] [2022-11-25 15:38:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:10,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655385470] [2022-11-25 15:38:10,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655385470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:10,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:10,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:38:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523919070] [2022-11-25 15:38:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:10,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:38:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:10,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:38:10,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:38:10,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 293 [2022-11-25 15:38:10,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:10,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:10,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 293 [2022-11-25 15:38:10,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:13,032 INFO L130 PetriNetUnfolder]: 14520/20538 cut-off events. [2022-11-25 15:38:13,033 INFO L131 PetriNetUnfolder]: For 9962/10275 co-relation queries the response was YES. [2022-11-25 15:38:13,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52018 conditions, 20538 events. 14520/20538 cut-off events. For 9962/10275 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 118570 event pairs, 4465 based on Foata normal form. 1066/21335 useless extension candidates. Maximal degree in co-relation 52011. Up to 12593 conditions per place. [2022-11-25 15:38:13,175 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 38 selfloop transitions, 3 changer transitions 28/75 dead transitions. [2022-11-25 15:38:13,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 400 flow [2022-11-25 15:38:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:38:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:38:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2022-11-25 15:38:13,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4969283276450512 [2022-11-25 15:38:13,179 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2022-11-25 15:38:13,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2022-11-25 15:38:13,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:13,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2022-11-25 15:38:13,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:13,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:13,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:13,187 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 138 flow. Second operand 5 states and 728 transitions. [2022-11-25 15:38:13,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 400 flow [2022-11-25 15:38:13,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:38:13,397 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 137 flow [2022-11-25 15:38:13,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2022-11-25 15:38:13,398 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2022-11-25 15:38:13,398 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 137 flow [2022-11-25 15:38:13,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:13,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:13,398 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:13,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:38:13,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash 805706351, now seen corresponding path program 1 times [2022-11-25 15:38:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:13,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240848142] [2022-11-25 15:38:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:13,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:13,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240848142] [2022-11-25 15:38:13,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240848142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:13,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:13,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:38:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630640750] [2022-11-25 15:38:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:13,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:38:13,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:13,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:38:13,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:38:13,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2022-11-25 15:38:13,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:13,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:13,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2022-11-25 15:38:13,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:16,396 INFO L130 PetriNetUnfolder]: 16915/23140 cut-off events. [2022-11-25 15:38:16,396 INFO L131 PetriNetUnfolder]: For 15450/15450 co-relation queries the response was YES. [2022-11-25 15:38:16,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60897 conditions, 23140 events. 16915/23140 cut-off events. For 15450/15450 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 123711 event pairs, 2533 based on Foata normal form. 794/23934 useless extension candidates. Maximal degree in co-relation 60887. Up to 13736 conditions per place. [2022-11-25 15:38:16,524 INFO L137 encePairwiseOnDemand]: 284/293 looper letters, 62 selfloop transitions, 11 changer transitions 39/112 dead transitions. [2022-11-25 15:38:16,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 112 transitions, 605 flow [2022-11-25 15:38:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:38:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2022-11-25 15:38:16,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4807411019015115 [2022-11-25 15:38:16,528 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2022-11-25 15:38:16,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2022-11-25 15:38:16,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:16,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2022-11-25 15:38:16,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:16,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:16,540 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:16,540 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 137 flow. Second operand 7 states and 986 transitions. [2022-11-25 15:38:16,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 112 transitions, 605 flow [2022-11-25 15:38:16,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 112 transitions, 585 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-25 15:38:16,637 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 202 flow [2022-11-25 15:38:16,637 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2022-11-25 15:38:16,640 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-11-25 15:38:16,640 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 202 flow [2022-11-25 15:38:16,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:16,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:16,641 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:16,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:38:16,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash -793905170, now seen corresponding path program 1 times [2022-11-25 15:38:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:16,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691220083] [2022-11-25 15:38:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:16,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:16,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691220083] [2022-11-25 15:38:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691220083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:16,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:16,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:38:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468085134] [2022-11-25 15:38:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:16,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:38:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:38:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:38:16,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 293 [2022-11-25 15:38:16,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:16,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:16,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 293 [2022-11-25 15:38:16,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:18,389 INFO L130 PetriNetUnfolder]: 9683/14142 cut-off events. [2022-11-25 15:38:18,390 INFO L131 PetriNetUnfolder]: For 11945/12441 co-relation queries the response was YES. [2022-11-25 15:38:18,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39189 conditions, 14142 events. 9683/14142 cut-off events. For 11945/12441 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 84936 event pairs, 1805 based on Foata normal form. 1139/15095 useless extension candidates. Maximal degree in co-relation 39177. Up to 6596 conditions per place. [2022-11-25 15:38:18,477 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 69 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2022-11-25 15:38:18,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 528 flow [2022-11-25 15:38:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:38:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:38:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-11-25 15:38:18,484 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4974402730375427 [2022-11-25 15:38:18,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2022-11-25 15:38:18,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2022-11-25 15:38:18,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:18,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2022-11-25 15:38:18,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:18,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:18,493 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:18,493 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 202 flow. Second operand 4 states and 583 transitions. [2022-11-25 15:38:18,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 528 flow [2022-11-25 15:38:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 516 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-25 15:38:18,619 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 240 flow [2022-11-25 15:38:18,620 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-11-25 15:38:18,620 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-11-25 15:38:18,621 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 240 flow [2022-11-25 15:38:18,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:18,622 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:18,622 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:18,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:38:18,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash -466443359, now seen corresponding path program 1 times [2022-11-25 15:38:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:18,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251297426] [2022-11-25 15:38:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251297426] [2022-11-25 15:38:18,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251297426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:18,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:18,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:38:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005341298] [2022-11-25 15:38:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:18,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:38:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:18,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:38:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:38:18,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 293 [2022-11-25 15:38:18,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:18,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:18,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 293 [2022-11-25 15:38:18,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:21,045 INFO L130 PetriNetUnfolder]: 14130/20728 cut-off events. [2022-11-25 15:38:21,046 INFO L131 PetriNetUnfolder]: For 19111/19347 co-relation queries the response was YES. [2022-11-25 15:38:21,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65304 conditions, 20728 events. 14130/20728 cut-off events. For 19111/19347 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 129806 event pairs, 5462 based on Foata normal form. 372/20843 useless extension candidates. Maximal degree in co-relation 65291. Up to 10529 conditions per place. [2022-11-25 15:38:21,165 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 58 selfloop transitions, 5 changer transitions 23/91 dead transitions. [2022-11-25 15:38:21,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 589 flow [2022-11-25 15:38:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:38:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:38:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2022-11-25 15:38:21,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49897610921501706 [2022-11-25 15:38:21,168 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2022-11-25 15:38:21,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2022-11-25 15:38:21,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:21,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2022-11-25 15:38:21,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:21,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:21,174 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:21,175 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 240 flow. Second operand 5 states and 731 transitions. [2022-11-25 15:38:21,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 589 flow [2022-11-25 15:38:21,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 584 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:38:21,207 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 257 flow [2022-11-25 15:38:21,208 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2022-11-25 15:38:21,208 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2022-11-25 15:38:21,209 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 257 flow [2022-11-25 15:38:21,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:21,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:21,209 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:21,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:38:21,210 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1867450758, now seen corresponding path program 1 times [2022-11-25 15:38:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:21,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625563524] [2022-11-25 15:38:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:21,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:21,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625563524] [2022-11-25 15:38:21,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625563524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:21,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:21,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:38:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992959456] [2022-11-25 15:38:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:21,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:38:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:38:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:38:21,440 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 293 [2022-11-25 15:38:21,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:21,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:21,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 293 [2022-11-25 15:38:21,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:24,599 INFO L130 PetriNetUnfolder]: 22158/31717 cut-off events. [2022-11-25 15:38:24,599 INFO L131 PetriNetUnfolder]: For 46766/46766 co-relation queries the response was YES. [2022-11-25 15:38:24,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104077 conditions, 31717 events. 22158/31717 cut-off events. For 46766/46766 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 197977 event pairs, 1222 based on Foata normal form. 562/32279 useless extension candidates. Maximal degree in co-relation 104062. Up to 14219 conditions per place. [2022-11-25 15:38:24,761 INFO L137 encePairwiseOnDemand]: 283/293 looper letters, 84 selfloop transitions, 21 changer transitions 38/143 dead transitions. [2022-11-25 15:38:24,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 143 transitions, 1000 flow [2022-11-25 15:38:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:38:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 973 transitions. [2022-11-25 15:38:25,015 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47440273037542663 [2022-11-25 15:38:25,015 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 973 transitions. [2022-11-25 15:38:25,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 973 transitions. [2022-11-25 15:38:25,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:25,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 973 transitions. [2022-11-25 15:38:25,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:25,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:25,024 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:25,024 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 257 flow. Second operand 7 states and 973 transitions. [2022-11-25 15:38:25,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 143 transitions, 1000 flow [2022-11-25 15:38:25,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 143 transitions, 975 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 15:38:25,178 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 428 flow [2022-11-25 15:38:25,178 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=428, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2022-11-25 15:38:25,178 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2022-11-25 15:38:25,179 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 428 flow [2022-11-25 15:38:25,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:25,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:25,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:25,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:38:25,180 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1807447944, now seen corresponding path program 2 times [2022-11-25 15:38:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:25,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890955764] [2022-11-25 15:38:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:25,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890955764] [2022-11-25 15:38:25,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890955764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:25,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:25,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:38:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523555187] [2022-11-25 15:38:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:25,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:38:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:38:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:38:25,447 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 293 [2022-11-25 15:38:25,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:25,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:25,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 293 [2022-11-25 15:38:25,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:27,329 INFO L130 PetriNetUnfolder]: 7761/12049 cut-off events. [2022-11-25 15:38:27,329 INFO L131 PetriNetUnfolder]: For 22379/22851 co-relation queries the response was YES. [2022-11-25 15:38:27,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41769 conditions, 12049 events. 7761/12049 cut-off events. For 22379/22851 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 77874 event pairs, 965 based on Foata normal form. 1248/13208 useless extension candidates. Maximal degree in co-relation 41751. Up to 4360 conditions per place. [2022-11-25 15:38:27,416 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 104 selfloop transitions, 10 changer transitions 0/128 dead transitions. [2022-11-25 15:38:27,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 128 transitions, 1121 flow [2022-11-25 15:38:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:38:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:38:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2022-11-25 15:38:27,423 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49897610921501706 [2022-11-25 15:38:27,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2022-11-25 15:38:27,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2022-11-25 15:38:27,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:27,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2022-11-25 15:38:27,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:27,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:27,432 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:27,432 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 428 flow. Second operand 5 states and 731 transitions. [2022-11-25 15:38:27,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 128 transitions, 1121 flow [2022-11-25 15:38:27,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 1086 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 15:38:27,483 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 472 flow [2022-11-25 15:38:27,483 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=472, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2022-11-25 15:38:27,484 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2022-11-25 15:38:27,484 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 472 flow [2022-11-25 15:38:27,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:27,485 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:27,485 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:27,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:38:27,486 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -677491272, now seen corresponding path program 1 times [2022-11-25 15:38:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:27,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942545123] [2022-11-25 15:38:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942545123] [2022-11-25 15:38:27,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942545123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:27,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:27,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:38:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613317000] [2022-11-25 15:38:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:27,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:38:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:38:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:38:27,888 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 293 [2022-11-25 15:38:27,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:27,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:27,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 293 [2022-11-25 15:38:27,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:29,657 INFO L130 PetriNetUnfolder]: 6713/10441 cut-off events. [2022-11-25 15:38:29,657 INFO L131 PetriNetUnfolder]: For 23689/24104 co-relation queries the response was YES. [2022-11-25 15:38:29,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40082 conditions, 10441 events. 6713/10441 cut-off events. For 23689/24104 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 66801 event pairs, 860 based on Foata normal form. 522/10877 useless extension candidates. Maximal degree in co-relation 40064. Up to 4360 conditions per place. [2022-11-25 15:38:29,724 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 115 selfloop transitions, 14 changer transitions 4/147 dead transitions. [2022-11-25 15:38:29,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 147 transitions, 1292 flow [2022-11-25 15:38:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:38:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:38:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 878 transitions. [2022-11-25 15:38:29,729 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49943117178612056 [2022-11-25 15:38:29,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 878 transitions. [2022-11-25 15:38:29,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 878 transitions. [2022-11-25 15:38:29,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:29,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 878 transitions. [2022-11-25 15:38:29,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:29,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:29,737 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:29,737 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 472 flow. Second operand 6 states and 878 transitions. [2022-11-25 15:38:29,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 147 transitions, 1292 flow [2022-11-25 15:38:29,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 147 transitions, 1263 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 15:38:29,770 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 530 flow [2022-11-25 15:38:29,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=530, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2022-11-25 15:38:29,771 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2022-11-25 15:38:29,771 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 530 flow [2022-11-25 15:38:29,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:29,772 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:29,772 INFO L209 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] [2022-11-25 15:38:29,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:38:29,773 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash -921261802, now seen corresponding path program 1 times [2022-11-25 15:38:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:29,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446526186] [2022-11-25 15:38:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446526186] [2022-11-25 15:38:30,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446526186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:30,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:30,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:38:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519015672] [2022-11-25 15:38:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:38:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:38:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:38:30,783 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 293 [2022-11-25 15:38:30,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 530 flow. Second operand has 8 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:30,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:30,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 293 [2022-11-25 15:38:30,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:33,533 INFO L130 PetriNetUnfolder]: 12221/19183 cut-off events. [2022-11-25 15:38:33,533 INFO L131 PetriNetUnfolder]: For 62258/63234 co-relation queries the response was YES. [2022-11-25 15:38:33,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78105 conditions, 19183 events. 12221/19183 cut-off events. For 62258/63234 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 139544 event pairs, 2526 based on Foata normal form. 227/19283 useless extension candidates. Maximal degree in co-relation 78086. Up to 9285 conditions per place. [2022-11-25 15:38:33,663 INFO L137 encePairwiseOnDemand]: 284/293 looper letters, 121 selfloop transitions, 12 changer transitions 59/206 dead transitions. [2022-11-25 15:38:33,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 206 transitions, 1967 flow [2022-11-25 15:38:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:38:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:38:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1133 transitions. [2022-11-25 15:38:33,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4833617747440273 [2022-11-25 15:38:33,668 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1133 transitions. [2022-11-25 15:38:33,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1133 transitions. [2022-11-25 15:38:33,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:33,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1133 transitions. [2022-11-25 15:38:33,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 141.625) internal successors, (1133), 8 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:33,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:33,677 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:33,677 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 530 flow. Second operand 8 states and 1133 transitions. [2022-11-25 15:38:33,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 206 transitions, 1967 flow [2022-11-25 15:38:34,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 206 transitions, 1832 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-11-25 15:38:34,481 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 620 flow [2022-11-25 15:38:34,481 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2022-11-25 15:38:34,482 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2022-11-25 15:38:34,482 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 620 flow [2022-11-25 15:38:34,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:34,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:34,483 INFO L209 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] [2022-11-25 15:38:34,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:38:34,483 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1986458012, now seen corresponding path program 2 times [2022-11-25 15:38:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:34,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645067362] [2022-11-25 15:38:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:34,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645067362] [2022-11-25 15:38:34,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645067362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:34,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:34,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:38:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519513144] [2022-11-25 15:38:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:34,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:38:34,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:34,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:38:34,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:38:34,825 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 293 [2022-11-25 15:38:34,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 620 flow. Second operand has 7 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:34,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:34,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 293 [2022-11-25 15:38:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:37,004 INFO L130 PetriNetUnfolder]: 9820/15331 cut-off events. [2022-11-25 15:38:37,004 INFO L131 PetriNetUnfolder]: For 44428/45227 co-relation queries the response was YES. [2022-11-25 15:38:37,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64684 conditions, 15331 events. 9820/15331 cut-off events. For 44428/45227 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 107911 event pairs, 873 based on Foata normal form. 298/15388 useless extension candidates. Maximal degree in co-relation 64662. Up to 6370 conditions per place. [2022-11-25 15:38:37,103 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 112 selfloop transitions, 18 changer transitions 16/157 dead transitions. [2022-11-25 15:38:37,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 157 transitions, 1500 flow [2022-11-25 15:38:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:38:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2022-11-25 15:38:37,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48512920526572406 [2022-11-25 15:38:37,107 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2022-11-25 15:38:37,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2022-11-25 15:38:37,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:37,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2022-11-25 15:38:37,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:37,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:37,115 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:37,115 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 620 flow. Second operand 7 states and 995 transitions. [2022-11-25 15:38:37,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 157 transitions, 1500 flow [2022-11-25 15:38:37,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 157 transitions, 1453 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-11-25 15:38:37,728 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 589 flow [2022-11-25 15:38:37,729 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=589, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2022-11-25 15:38:37,729 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2022-11-25 15:38:37,729 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 589 flow [2022-11-25 15:38:37,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:37,730 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:37,730 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:37,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:38:37,731 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1554106232, now seen corresponding path program 1 times [2022-11-25 15:38:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:37,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650977368] [2022-11-25 15:38:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:37,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650977368] [2022-11-25 15:38:39,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650977368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:39,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:39,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:38:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376576156] [2022-11-25 15:38:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:39,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:38:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:38:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:38:39,103 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 293 [2022-11-25 15:38:39,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 589 flow. Second operand has 9 states, 9 states have (on average 130.88888888888889) internal successors, (1178), 9 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:39,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:39,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 293 [2022-11-25 15:38:39,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:40,473 INFO L130 PetriNetUnfolder]: 5519/8778 cut-off events. [2022-11-25 15:38:40,473 INFO L131 PetriNetUnfolder]: For 34024/34415 co-relation queries the response was YES. [2022-11-25 15:38:40,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39989 conditions, 8778 events. 5519/8778 cut-off events. For 34024/34415 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 57410 event pairs, 1137 based on Foata normal form. 88/8776 useless extension candidates. Maximal degree in co-relation 39968. Up to 3241 conditions per place. [2022-11-25 15:38:40,524 INFO L137 encePairwiseOnDemand]: 285/293 looper letters, 105 selfloop transitions, 16 changer transitions 51/183 dead transitions. [2022-11-25 15:38:40,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 183 transitions, 1886 flow [2022-11-25 15:38:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:38:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:38:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1106 transitions. [2022-11-25 15:38:40,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4718430034129693 [2022-11-25 15:38:40,528 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1106 transitions. [2022-11-25 15:38:40,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1106 transitions. [2022-11-25 15:38:40,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:40,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1106 transitions. [2022-11-25 15:38:40,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.25) internal successors, (1106), 8 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:40,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:40,536 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:40,536 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 589 flow. Second operand 8 states and 1106 transitions. [2022-11-25 15:38:40,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 183 transitions, 1886 flow [2022-11-25 15:38:40,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 183 transitions, 1637 flow, removed 55 selfloop flow, removed 9 redundant places. [2022-11-25 15:38:40,802 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 637 flow [2022-11-25 15:38:40,802 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=637, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2022-11-25 15:38:40,802 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2022-11-25 15:38:40,802 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 637 flow [2022-11-25 15:38:40,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 130.88888888888889) internal successors, (1178), 9 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:40,803 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:40,803 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:40,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:38:40,804 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:40,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1742368810, now seen corresponding path program 2 times [2022-11-25 15:38:40,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:40,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916748481] [2022-11-25 15:38:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:40,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:41,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:41,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916748481] [2022-11-25 15:38:41,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916748481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:41,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:41,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:38:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099435560] [2022-11-25 15:38:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:41,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:38:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:38:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:38:41,120 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 293 [2022-11-25 15:38:41,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:41,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:41,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 293 [2022-11-25 15:38:41,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:43,060 INFO L130 PetriNetUnfolder]: 8882/13692 cut-off events. [2022-11-25 15:38:43,060 INFO L131 PetriNetUnfolder]: For 46485/46485 co-relation queries the response was YES. [2022-11-25 15:38:43,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60120 conditions, 13692 events. 8882/13692 cut-off events. For 46485/46485 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 86566 event pairs, 2023 based on Foata normal form. 1/13693 useless extension candidates. Maximal degree in co-relation 60098. Up to 7166 conditions per place. [2022-11-25 15:38:43,139 INFO L137 encePairwiseOnDemand]: 284/293 looper letters, 65 selfloop transitions, 10 changer transitions 119/194 dead transitions. [2022-11-25 15:38:43,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 194 transitions, 1879 flow [2022-11-25 15:38:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:38:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2022-11-25 15:38:43,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46562652364700147 [2022-11-25 15:38:43,143 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2022-11-25 15:38:43,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2022-11-25 15:38:43,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:43,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2022-11-25 15:38:43,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:43,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:43,153 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:43,154 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 637 flow. Second operand 7 states and 955 transitions. [2022-11-25 15:38:43,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 194 transitions, 1879 flow [2022-11-25 15:38:43,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 194 transitions, 1820 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-11-25 15:38:43,663 INFO L231 Difference]: Finished difference. Result has 84 places, 55 transitions, 420 flow [2022-11-25 15:38:43,663 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=84, PETRI_TRANSITIONS=55} [2022-11-25 15:38:43,664 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2022-11-25 15:38:43,664 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 55 transitions, 420 flow [2022-11-25 15:38:43,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:43,665 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:43,665 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:43,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:38:43,666 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:38:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 922662648, now seen corresponding path program 3 times [2022-11-25 15:38:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:43,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465657664] [2022-11-25 15:38:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:38:43,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:38:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:38:43,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:38:43,929 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:38:43,932 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 15:38:43,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 15:38:43,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 15:38:43,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 15:38:43,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 15:38:43,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 15:38:43,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 15:38:43,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 15:38:43,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 15:38:43,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 15:38:43,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 15:38:43,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 15:38:43,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 15:38:43,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 15:38:43,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 15:38:43,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 15:38:43,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:38:43,940 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:43,947 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:38:43,948 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:38:44,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:38:44 BasicIcfg [2022-11-25 15:38:44,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:38:44,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:38:44,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:38:44,110 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:38:44,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:51" (3/4) ... [2022-11-25 15:38:44,113 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:38:44,114 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:38:44,114 INFO L158 Benchmark]: Toolchain (without parser) took 54353.27ms. Allocated memory was 180.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 150.7MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 766.8MB. Max. memory is 16.1GB. [2022-11-25 15:38:44,115 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 65.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:38:44,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 774.57ms. Allocated memory is still 180.4MB. Free memory was 150.5MB in the beginning and 124.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-11-25 15:38:44,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.67ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 122.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:38:44,116 INFO L158 Benchmark]: Boogie Preprocessor took 42.33ms. Allocated memory is still 180.4MB. Free memory was 122.7MB in the beginning and 120.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:38:44,116 INFO L158 Benchmark]: RCFGBuilder took 1002.59ms. Allocated memory is still 180.4MB. Free memory was 120.6MB in the beginning and 138.0MB in the end (delta: -17.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 15:38:44,117 INFO L158 Benchmark]: TraceAbstraction took 52461.57ms. Allocated memory was 180.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 137.0MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 754.3MB. Max. memory is 16.1GB. [2022-11-25 15:38:44,117 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 5.3GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:38:44,119 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 65.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 774.57ms. Allocated memory is still 180.4MB. Free memory was 150.5MB in the beginning and 124.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.67ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 122.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.33ms. Allocated memory is still 180.4MB. Free memory was 122.7MB in the beginning and 120.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1002.59ms. Allocated memory is still 180.4MB. Free memory was 120.6MB in the beginning and 138.0MB in the end (delta: -17.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 52461.57ms. Allocated memory was 180.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 137.0MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 754.3MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 5.3GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 159 PlacesBefore, 53 PlacesAfterwards, 148 TransitionsBefore, 41 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 10417 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5832, independent: 5606, independent conditional: 0, independent unconditional: 5606, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2774, independent: 2706, independent conditional: 0, independent unconditional: 2706, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2774, independent: 2680, independent conditional: 0, independent unconditional: 2680, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 556, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 509, dependent conditional: 0, dependent unconditional: 509, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5832, independent: 2900, independent conditional: 0, independent unconditional: 2900, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 2774, unknown conditional: 0, unknown unconditional: 2774] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 372, Positive conditional cache size: 0, Positive unconditional cache size: 372, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-3, t1025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=-2, t1025={5:0}, t1026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=-1, t1025={5:0}, t1026={6:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 16 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: 52.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1349 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1218 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2821 IncrementalHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 50 mSDtfsCounter, 2821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=14, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 2045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:38:44,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --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 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:38:46,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:38:46,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:38:46,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:38:46,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:38:46,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:38:46,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:38:46,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:38:46,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:38:46,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:38:46,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:38:46,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:38:46,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:38:46,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:38:47,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:38:47,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:38:47,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:38:47,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:38:47,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:38:47,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:38:47,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:38:47,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:38:47,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:38:47,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:38:47,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:38:47,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:38:47,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:38:47,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:38:47,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:38:47,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:38:47,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:38:47,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:38:47,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:38:47,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:38:47,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:38:47,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:38:47,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:38:47,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:38:47,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:38:47,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:38:47,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:38:47,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 15:38:47,107 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:38:47,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:38:47,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:38:47,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:38:47,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:38:47,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:38:47,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:38:47,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:38:47,113 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:38:47,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:38:47,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:38:47,115 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:38:47,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:38:47,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:38:47,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:38:47,116 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:38:47,117 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:38:47,117 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:38:47,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:38:47,118 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:38:47,118 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:38:47,118 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:38:47,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:38:47,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:38:47,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:38:47,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:38:47,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:38:47,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:38:47,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:38:47,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:38:47,121 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:38:47,121 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:38:47,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:38:47,122 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:38:47,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:38:47,123 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:38:47,123 INFO L138 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_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2022-11-25 15:38:47,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:38:47,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:38:47,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:38:47,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:38:47,569 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:38:47,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-11-25 15:38:50,613 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:38:50,936 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:38:50,936 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-11-25 15:38:50,958 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data/fdbbb77fd/5c1d098544a94274931eb6d088e6cfe5/FLAG78f1b4811 [2022-11-25 15:38:50,978 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/data/fdbbb77fd/5c1d098544a94274931eb6d088e6cfe5 [2022-11-25 15:38:50,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:38:50,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:38:50,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:38:50,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:38:50,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:38:50,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:38:50" (1/1) ... [2022-11-25 15:38:50,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349e2449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:50, skipping insertion in model container [2022-11-25 15:38:50,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:38:50" (1/1) ... [2022-11-25 15:38:51,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:38:51,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:38:51,216 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-11-25 15:38:51,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:38:51,555 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:38:51,615 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-11-25 15:38:51,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:38:51,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:38:51,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:38:51,752 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:38:51,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51 WrapperNode [2022-11-25 15:38:51,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:38:51,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:38:51,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:38:51,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:38:51,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,820 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-25 15:38:51,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:38:51,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:38:51,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:38:51,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:38:51,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,884 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:38:51,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:38:51,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:38:51,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:38:51,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (1/1) ... [2022-11-25 15:38:51,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:38:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:38:51,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:38:51,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:38:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:38:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:38:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:38:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:38:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:38:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:38:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:38:52,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:38:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:38:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:38:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:38:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:38:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 15:38:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 15:38:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:38:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:38:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:38:52,007 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:38:52,280 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:38:52,282 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:38:52,769 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:38:52,917 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:38:52,917 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:38:52,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:38:52 BoogieIcfgContainer [2022-11-25 15:38:52,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:38:52,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:38:52,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:38:52,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:38:52,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:38:50" (1/3) ... [2022-11-25 15:38:52,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f61877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:38:52, skipping insertion in model container [2022-11-25 15:38:52,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:51" (2/3) ... [2022-11-25 15:38:52,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f61877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:38:52, skipping insertion in model container [2022-11-25 15:38:52,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:38:52" (3/3) ... [2022-11-25 15:38:52,930 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2022-11-25 15:38:52,947 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:38:52,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 15:38:52,948 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:38:53,048 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:38:53,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 153 transitions, 326 flow [2022-11-25 15:38:53,205 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-11-25 15:38:53,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:38:53,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 15:38:53,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 153 transitions, 326 flow [2022-11-25 15:38:53,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 149 transitions, 310 flow [2022-11-25 15:38:53,230 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:38:53,251 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 310 flow [2022-11-25 15:38:53,254 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 310 flow [2022-11-25 15:38:53,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 310 flow [2022-11-25 15:38:53,301 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-11-25 15:38:53,302 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:38:53,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 15:38:53,306 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-11-25 15:39:04,185 INFO L134 LiptonReduction]: Checked pairs total: 10459 [2022-11-25 15:39:04,185 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-11-25 15:39:04,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:39:04,221 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;@4ada49f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:39:04,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 15:39:04,225 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 15:39:04,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:04,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:04,226 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:39:04,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash 634, now seen corresponding path program 1 times [2022-11-25 15:39:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:04,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955105740] [2022-11-25 15:39:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:04,246 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 [2022-11-25 15:39:04,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:04,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:04,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:04,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:39:04,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:04,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:04,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:04,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955105740] [2022-11-25 15:39:04,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955105740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:04,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:04,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:39:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557345987] [2022-11-25 15:39:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:04,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:39:04,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:04,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:39:04,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:39:04,380 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 295 [2022-11-25 15:39:04,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:04,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:04,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 295 [2022-11-25 15:39:04,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:06,859 INFO L130 PetriNetUnfolder]: 10487/14093 cut-off events. [2022-11-25 15:39:06,859 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 15:39:06,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28369 conditions, 14093 events. 10487/14093 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 72207 event pairs, 10487 based on Foata normal form. 0/12388 useless extension candidates. Maximal degree in co-relation 28357. Up to 14059 conditions per place. [2022-11-25 15:39:06,966 INFO L137 encePairwiseOnDemand]: 286/295 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 15:39:06,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2022-11-25 15:39:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:39:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:39:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2022-11-25 15:39:06,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5322033898305085 [2022-11-25 15:39:06,988 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2022-11-25 15:39:06,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2022-11-25 15:39:06,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:06,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2022-11-25 15:39:07,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:07,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:07,008 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:07,010 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 314 transitions. [2022-11-25 15:39:07,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2022-11-25 15:39:07,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:07,018 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-11-25 15:39:07,021 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-11-25 15:39:07,027 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-11-25 15:39:07,028 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-11-25 15:39:07,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:07,028 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:07,028 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:39:07,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:07,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:07,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 626012, now seen corresponding path program 1 times [2022-11-25 15:39:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:07,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334954792] [2022-11-25 15:39:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:07,242 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 [2022-11-25 15:39:07,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:07,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:07,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:07,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:39:07,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:07,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:07,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334954792] [2022-11-25 15:39:07,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334954792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:07,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:07,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:39:07,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267429446] [2022-11-25 15:39:07,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:07,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:39:07,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:39:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:39:07,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 295 [2022-11-25 15:39:07,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:07,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:07,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 295 [2022-11-25 15:39:07,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:09,112 INFO L130 PetriNetUnfolder]: 8247/11293 cut-off events. [2022-11-25 15:39:09,112 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:09,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22570 conditions, 11293 events. 8247/11293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 58653 event pairs, 3119 based on Foata normal form. 0/10519 useless extension candidates. Maximal degree in co-relation 22567. Up to 8863 conditions per place. [2022-11-25 15:39:09,185 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 47 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2022-11-25 15:39:09,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2022-11-25 15:39:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:39:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:39:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-11-25 15:39:09,192 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5231638418079096 [2022-11-25 15:39:09,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2022-11-25 15:39:09,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2022-11-25 15:39:09,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:09,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2022-11-25 15:39:09,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:09,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:09,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:09,201 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 463 transitions. [2022-11-25 15:39:09,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2022-11-25 15:39:09,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:39:09,202 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-11-25 15:39:09,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-11-25 15:39:09,204 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 15:39:09,204 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-11-25 15:39:09,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:09,204 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:09,205 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:09,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:09,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:09,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2092643181, now seen corresponding path program 1 times [2022-11-25 15:39:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:09,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582633210] [2022-11-25 15:39:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:09,421 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 [2022-11-25 15:39:09,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:09,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:09,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:09,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:39:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:09,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:09,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:09,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582633210] [2022-11-25 15:39:09,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582633210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:09,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023102296] [2022-11-25 15:39:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:09,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:09,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:09,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 15:39:09,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:09,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:09,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 15:39:09,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:10,925 INFO L130 PetriNetUnfolder]: 5298/7502 cut-off events. [2022-11-25 15:39:10,925 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2022-11-25 15:39:10,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15646 conditions, 7502 events. 5298/7502 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 40605 event pairs, 792 based on Foata normal form. 384/7622 useless extension candidates. Maximal degree in co-relation 15642. Up to 4466 conditions per place. [2022-11-25 15:39:10,973 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 55 selfloop transitions, 6 changer transitions 1/65 dead transitions. [2022-11-25 15:39:10,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 276 flow [2022-11-25 15:39:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:39:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:39:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2022-11-25 15:39:10,977 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49830508474576274 [2022-11-25 15:39:10,977 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2022-11-25 15:39:10,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2022-11-25 15:39:10,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:10,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2022-11-25 15:39:10,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:10,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:10,983 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:10,983 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 4 states and 588 transitions. [2022-11-25 15:39:10,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 276 flow [2022-11-25 15:39:10,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:39:10,986 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 110 flow [2022-11-25 15:39:10,986 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-11-25 15:39:10,987 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2022-11-25 15:39:10,987 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 110 flow [2022-11-25 15:39:10,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:10,988 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:10,988 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:11,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:11,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:11,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:11,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1508648769, now seen corresponding path program 1 times [2022-11-25 15:39:11,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:11,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998312738] [2022-11-25 15:39:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:11,202 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 [2022-11-25 15:39:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:11,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:11,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:11,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:39:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:11,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:11,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:11,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998312738] [2022-11-25 15:39:11,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998312738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:11,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:11,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547169706] [2022-11-25 15:39:11,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:11,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:11,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:11,478 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 15:39:11,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:11,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:11,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 15:39:11,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:12,393 INFO L130 PetriNetUnfolder]: 2490/3749 cut-off events. [2022-11-25 15:39:12,394 INFO L131 PetriNetUnfolder]: For 1094/1094 co-relation queries the response was YES. [2022-11-25 15:39:12,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 3749 events. 2490/3749 cut-off events. For 1094/1094 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 19574 event pairs, 382 based on Foata normal form. 249/3896 useless extension candidates. Maximal degree in co-relation 9435. Up to 1226 conditions per place. [2022-11-25 15:39:12,412 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 69 selfloop transitions, 10 changer transitions 1/83 dead transitions. [2022-11-25 15:39:12,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 397 flow [2022-11-25 15:39:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2022-11-25 15:39:12,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49966101694915255 [2022-11-25 15:39:12,415 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2022-11-25 15:39:12,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2022-11-25 15:39:12,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:12,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2022-11-25 15:39:12,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:12,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:12,422 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:12,423 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 110 flow. Second operand 5 states and 737 transitions. [2022-11-25 15:39:12,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 397 flow [2022-11-25 15:39:12,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 386 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:39:12,428 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 162 flow [2022-11-25 15:39:12,429 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-11-25 15:39:12,429 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-11-25 15:39:12,430 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 162 flow [2022-11-25 15:39:12,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:12,430 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:12,431 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:12,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:12,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:12,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1742494971, now seen corresponding path program 1 times [2022-11-25 15:39:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:12,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730417038] [2022-11-25 15:39:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:12,643 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 [2022-11-25 15:39:12,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:12,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:12,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:12,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:39:12,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:12,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:12,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:12,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730417038] [2022-11-25 15:39:12,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730417038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:12,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:12,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:39:12,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249565287] [2022-11-25 15:39:12,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:12,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:12,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:12,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:12,910 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 15:39:12,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:12,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:12,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 15:39:12,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:13,480 INFO L130 PetriNetUnfolder]: 1356/2093 cut-off events. [2022-11-25 15:39:13,481 INFO L131 PetriNetUnfolder]: For 1810/1810 co-relation queries the response was YES. [2022-11-25 15:39:13,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 2093 events. 1356/2093 cut-off events. For 1810/1810 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10189 event pairs, 380 based on Foata normal form. 87/2150 useless extension candidates. Maximal degree in co-relation 6033. Up to 720 conditions per place. [2022-11-25 15:39:13,492 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 81 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2022-11-25 15:39:13,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 99 transitions, 524 flow [2022-11-25 15:39:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:39:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:39:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 884 transitions. [2022-11-25 15:39:13,496 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4994350282485876 [2022-11-25 15:39:13,496 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 884 transitions. [2022-11-25 15:39:13,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 884 transitions. [2022-11-25 15:39:13,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:13,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 884 transitions. [2022-11-25 15:39:13,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:13,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:13,504 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:13,504 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 162 flow. Second operand 6 states and 884 transitions. [2022-11-25 15:39:13,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 99 transitions, 524 flow [2022-11-25 15:39:13,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 494 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:13,525 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 212 flow [2022-11-25 15:39:13,525 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-11-25 15:39:13,526 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 15:39:13,526 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 212 flow [2022-11-25 15:39:13,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:13,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:13,527 INFO L209 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] [2022-11-25 15:39:13,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:13,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:13,740 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2143583093, now seen corresponding path program 1 times [2022-11-25 15:39:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:13,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596700448] [2022-11-25 15:39:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:13,741 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 [2022-11-25 15:39:13,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:13,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:13,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:13,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:39:13,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:14,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:14,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:14,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596700448] [2022-11-25 15:39:14,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596700448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:14,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:14,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:14,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129990511] [2022-11-25 15:39:14,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:14,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:39:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:14,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:39:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:39:14,022 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 15:39:14,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:14,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:14,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 15:39:14,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:14,668 INFO L130 PetriNetUnfolder]: 1156/1751 cut-off events. [2022-11-25 15:39:14,668 INFO L131 PetriNetUnfolder]: For 1648/1648 co-relation queries the response was YES. [2022-11-25 15:39:14,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5152 conditions, 1751 events. 1156/1751 cut-off events. For 1648/1648 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8301 event pairs, 380 based on Foata normal form. 15/1750 useless extension candidates. Maximal degree in co-relation 5144. Up to 720 conditions per place. [2022-11-25 15:39:14,680 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 63 selfloop transitions, 18 changer transitions 1/85 dead transitions. [2022-11-25 15:39:14,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 478 flow [2022-11-25 15:39:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:39:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1001 transitions. [2022-11-25 15:39:14,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4847457627118644 [2022-11-25 15:39:14,685 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1001 transitions. [2022-11-25 15:39:14,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1001 transitions. [2022-11-25 15:39:14,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:14,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1001 transitions. [2022-11-25 15:39:14,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.0) internal successors, (1001), 7 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:14,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:14,693 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:14,693 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 212 flow. Second operand 7 states and 1001 transitions. [2022-11-25 15:39:14,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 478 flow [2022-11-25 15:39:14,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 432 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-25 15:39:14,716 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2022-11-25 15:39:14,716 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-11-25 15:39:14,720 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-11-25 15:39:14,720 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 222 flow [2022-11-25 15:39:14,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:14,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:14,723 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:14,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:14,936 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:14,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash 966787393, now seen corresponding path program 1 times [2022-11-25 15:39:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:14,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233755093] [2022-11-25 15:39:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:14,938 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 [2022-11-25 15:39:14,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:14,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:14,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:15,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 15:39:15,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:15,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:15,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:15,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233755093] [2022-11-25 15:39:15,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233755093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:15,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:15,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742475923] [2022-11-25 15:39:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:15,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:15,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:16,378 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 295 [2022-11-25 15:39:16,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:16,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:16,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 295 [2022-11-25 15:39:16,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:17,061 INFO L130 PetriNetUnfolder]: 1143/1717 cut-off events. [2022-11-25 15:39:17,061 INFO L131 PetriNetUnfolder]: For 2233/2233 co-relation queries the response was YES. [2022-11-25 15:39:17,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 1717 events. 1143/1717 cut-off events. For 2233/2233 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8061 event pairs, 28 based on Foata normal form. 0/1717 useless extension candidates. Maximal degree in co-relation 5002. Up to 1460 conditions per place. [2022-11-25 15:39:17,072 INFO L137 encePairwiseOnDemand]: 290/295 looper letters, 60 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2022-11-25 15:39:17,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 484 flow [2022-11-25 15:39:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:39:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:39:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 753 transitions. [2022-11-25 15:39:17,075 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42542372881355933 [2022-11-25 15:39:17,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 753 transitions. [2022-11-25 15:39:17,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 753 transitions. [2022-11-25 15:39:17,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:17,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 753 transitions. [2022-11-25 15:39:17,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:17,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:17,082 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:17,082 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 222 flow. Second operand 6 states and 753 transitions. [2022-11-25 15:39:17,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 484 flow [2022-11-25 15:39:17,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 330 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-25 15:39:17,091 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 130 flow [2022-11-25 15:39:17,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-11-25 15:39:17,092 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-11-25 15:39:17,092 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 130 flow [2022-11-25 15:39:17,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:17,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:17,093 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:17,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:17,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:17,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1349436230, now seen corresponding path program 1 times [2022-11-25 15:39:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:17,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453206959] [2022-11-25 15:39:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:17,308 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 [2022-11-25 15:39:17,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:17,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:17,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:17,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 15:39:17,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:18,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:18,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:18,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453206959] [2022-11-25 15:39:18,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453206959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:18,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:18,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:39:18,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605918105] [2022-11-25 15:39:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:18,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:39:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:39:18,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:39:18,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 15:39:18,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 130 flow. Second operand has 9 states, 9 states have (on average 132.88888888888889) internal successors, (1196), 9 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:18,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:18,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 15:39:18,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:18,832 INFO L130 PetriNetUnfolder]: 1303/2104 cut-off events. [2022-11-25 15:39:18,832 INFO L131 PetriNetUnfolder]: For 348/348 co-relation queries the response was YES. [2022-11-25 15:39:18,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4853 conditions, 2104 events. 1303/2104 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11464 event pairs, 168 based on Foata normal form. 1/2099 useless extension candidates. Maximal degree in co-relation 4849. Up to 885 conditions per place. [2022-11-25 15:39:18,840 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 71 selfloop transitions, 4 changer transitions 33/111 dead transitions. [2022-11-25 15:39:18,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 111 transitions, 576 flow [2022-11-25 15:39:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:39:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:39:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1113 transitions. [2022-11-25 15:39:18,844 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4716101694915254 [2022-11-25 15:39:18,844 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1113 transitions. [2022-11-25 15:39:18,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1113 transitions. [2022-11-25 15:39:18,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:18,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1113 transitions. [2022-11-25 15:39:18,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.125) internal successors, (1113), 8 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:18,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:18,853 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:18,853 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 130 flow. Second operand 8 states and 1113 transitions. [2022-11-25 15:39:18,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 111 transitions, 576 flow [2022-11-25 15:39:18,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 111 transitions, 559 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:18,857 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 139 flow [2022-11-25 15:39:18,857 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=139, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2022-11-25 15:39:18,858 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-11-25 15:39:18,858 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 139 flow [2022-11-25 15:39:18,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 132.88888888888889) internal successors, (1196), 9 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:18,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:18,859 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:18,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:19,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:19,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash 175720778, now seen corresponding path program 2 times [2022-11-25 15:39:19,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:19,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771478163] [2022-11-25 15:39:19,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:39:19,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:39:19,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:19,077 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:19,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:19,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:39:19,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:39:19,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:39:19,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:19,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:19,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:19,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771478163] [2022-11-25 15:39:19,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771478163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:19,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:19,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:19,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957857821] [2022-11-25 15:39:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:19,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:19,356 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2022-11-25 15:39:19,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:19,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:19,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2022-11-25 15:39:19,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:19,906 INFO L130 PetriNetUnfolder]: 1995/3099 cut-off events. [2022-11-25 15:39:19,906 INFO L131 PetriNetUnfolder]: For 1009/1009 co-relation queries the response was YES. [2022-11-25 15:39:19,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7714 conditions, 3099 events. 1995/3099 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16575 event pairs, 341 based on Foata normal form. 1/3095 useless extension candidates. Maximal degree in co-relation 7707. Up to 1606 conditions per place. [2022-11-25 15:39:19,917 INFO L137 encePairwiseOnDemand]: 291/295 looper letters, 58 selfloop transitions, 1 changer transitions 33/94 dead transitions. [2022-11-25 15:39:19,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 504 flow [2022-11-25 15:39:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-11-25 15:39:19,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4901694915254237 [2022-11-25 15:39:19,920 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2022-11-25 15:39:19,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2022-11-25 15:39:19,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:19,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2022-11-25 15:39:19,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:19,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:19,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:19,926 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 139 flow. Second operand 5 states and 723 transitions. [2022-11-25 15:39:19,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 504 flow [2022-11-25 15:39:19,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 482 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-25 15:39:19,941 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 136 flow [2022-11-25 15:39:19,941 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-25 15:39:19,942 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 15:39:19,942 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 136 flow [2022-11-25 15:39:19,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:19,942 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:19,943 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:19,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:20,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:20,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:20,157 INFO L85 PathProgramCache]: Analyzing trace with hash 6519882, now seen corresponding path program 3 times [2022-11-25 15:39:20,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:20,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953833905] [2022-11-25 15:39:20,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:39:20,158 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 [2022-11-25 15:39:20,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:20,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:20,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:20,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 15:39:20,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:39:20,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:39:20,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:20,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:20,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:20,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953833905] [2022-11-25 15:39:20,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953833905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:20,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:20,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598960434] [2022-11-25 15:39:20,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:20,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:20,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:20,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 295 [2022-11-25 15:39:20,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:20,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:20,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 295 [2022-11-25 15:39:20,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:20,897 INFO L130 PetriNetUnfolder]: 2270/3498 cut-off events. [2022-11-25 15:39:20,897 INFO L131 PetriNetUnfolder]: For 1255/1255 co-relation queries the response was YES. [2022-11-25 15:39:20,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8555 conditions, 3498 events. 2270/3498 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18944 event pairs, 963 based on Foata normal form. 1/3440 useless extension candidates. Maximal degree in co-relation 8547. Up to 1978 conditions per place. [2022-11-25 15:39:20,909 INFO L137 encePairwiseOnDemand]: 291/295 looper letters, 56 selfloop transitions, 2 changer transitions 13/73 dead transitions. [2022-11-25 15:39:20,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 384 flow [2022-11-25 15:39:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:39:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:39:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 580 transitions. [2022-11-25 15:39:20,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4915254237288136 [2022-11-25 15:39:20,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 580 transitions. [2022-11-25 15:39:20,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 580 transitions. [2022-11-25 15:39:20,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:20,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 580 transitions. [2022-11-25 15:39:20,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:20,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:20,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:20,918 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 136 flow. Second operand 4 states and 580 transitions. [2022-11-25 15:39:20,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 384 flow [2022-11-25 15:39:20,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 377 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:20,921 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 141 flow [2022-11-25 15:39:20,922 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-25 15:39:20,923 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 15:39:20,924 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 141 flow [2022-11-25 15:39:20,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:20,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:20,924 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:20,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:21,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:21,141 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 697315800, now seen corresponding path program 4 times [2022-11-25 15:39:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:21,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024773341] [2022-11-25 15:39:21,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:39:21,143 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 [2022-11-25 15:39:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:21,144 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:21,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:21,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:39:21,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:39:21,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:39:21,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:21,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:21,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024773341] [2022-11-25 15:39:21,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024773341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:21,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:21,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775880373] [2022-11-25 15:39:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:21,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:21,378 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2022-11-25 15:39:21,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:21,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:21,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2022-11-25 15:39:21,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:21,827 INFO L130 PetriNetUnfolder]: 1626/2546 cut-off events. [2022-11-25 15:39:21,827 INFO L131 PetriNetUnfolder]: For 764/769 co-relation queries the response was YES. [2022-11-25 15:39:21,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6463 conditions, 2546 events. 1626/2546 cut-off events. For 764/769 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12184 event pairs, 481 based on Foata normal form. 1/2530 useless extension candidates. Maximal degree in co-relation 6455. Up to 1107 conditions per place. [2022-11-25 15:39:21,836 INFO L137 encePairwiseOnDemand]: 291/295 looper letters, 44 selfloop transitions, 1 changer transitions 36/83 dead transitions. [2022-11-25 15:39:21,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 449 flow [2022-11-25 15:39:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-11-25 15:39:21,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48271186440677966 [2022-11-25 15:39:21,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-11-25 15:39:21,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-11-25 15:39:21,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:21,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-11-25 15:39:21,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:21,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:21,846 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:21,846 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 141 flow. Second operand 5 states and 712 transitions. [2022-11-25 15:39:21,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 449 flow [2022-11-25 15:39:21,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 437 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:21,850 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 142 flow [2022-11-25 15:39:21,850 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-11-25 15:39:21,851 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-11-25 15:39:21,851 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 142 flow [2022-11-25 15:39:21,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:21,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:21,852 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:21,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:22,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:22,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:39:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1447877686, now seen corresponding path program 5 times [2022-11-25 15:39:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:22,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722453012] [2022-11-25 15:39:22,068 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:39:22,068 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 [2022-11-25 15:39:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:22,070 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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) [2022-11-25 15:39:22,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 (13)] Waiting until timeout for monitored process [2022-11-25 15:39:22,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:39:22,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 15:39:22,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:39:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:39:22,455 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 15:39:22,455 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:39:22,456 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 15:39:22,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 15:39:22,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 15:39:22,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 15:39:22,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 15:39:22,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 15:39:22,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 15:39:22,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 15:39:22,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 15:39:22,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 15:39:22,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 15:39:22,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 15:39:22,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 15:39:22,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 15:39:22,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 15:39:22,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 15:39:22,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/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 [2022-11-25 15:39:22,675 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:22,680 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:39:22,680 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:39:22,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:39:22 BasicIcfg [2022-11-25 15:39:22,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:39:22,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:39:22,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:39:22,773 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:39:22,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:38:52" (3/4) ... [2022-11-25 15:39:22,776 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:39:22,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:39:22,777 INFO L158 Benchmark]: Toolchain (without parser) took 31794.86ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 57.0MB in the beginning and 650.4MB in the end (delta: -593.4MB). Peak memory consumption was 418.6MB. Max. memory is 16.1GB. [2022-11-25 15:39:22,777 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 62.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:39:22,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.16ms. Allocated memory is still 79.7MB. Free memory was 56.8MB in the beginning and 48.1MB in the end (delta: 8.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-11-25 15:39:22,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.83ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 45.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:39:22,778 INFO L158 Benchmark]: Boogie Preprocessor took 76.57ms. Allocated memory is still 79.7MB. Free memory was 45.5MB in the beginning and 43.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:39:22,779 INFO L158 Benchmark]: RCFGBuilder took 1018.75ms. Allocated memory is still 79.7MB. Free memory was 43.1MB in the beginning and 43.9MB in the end (delta: -816.3kB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-11-25 15:39:22,779 INFO L158 Benchmark]: TraceAbstraction took 29849.78ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 43.4MB in the beginning and 650.4MB in the end (delta: -607.0MB). Peak memory consumption was 403.1MB. Max. memory is 16.1GB. [2022-11-25 15:39:22,780 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 1.1GB. Free memory is still 650.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:39:22,781 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 62.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 767.16ms. Allocated memory is still 79.7MB. Free memory was 56.8MB in the beginning and 48.1MB in the end (delta: 8.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.83ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 45.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.57ms. Allocated memory is still 79.7MB. Free memory was 45.5MB in the beginning and 43.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.75ms. Allocated memory is still 79.7MB. Free memory was 43.1MB in the beginning and 43.9MB in the end (delta: -816.3kB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29849.78ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 43.4MB in the beginning and 650.4MB in the end (delta: -607.0MB). Peak memory consumption was 403.1MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 1.1GB. Free memory is still 650.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9s, 160 PlacesBefore, 53 PlacesAfterwards, 149 TransitionsBefore, 41 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 10459 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5895, independent: 5671, independent conditional: 0, independent unconditional: 5671, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2782, independent: 2715, independent conditional: 0, independent unconditional: 2715, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2782, independent: 2689, independent conditional: 0, independent unconditional: 2689, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 517, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 474, dependent conditional: 0, dependent unconditional: 474, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5895, independent: 2956, independent conditional: 0, independent unconditional: 2956, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 2782, unknown conditional: 0, unknown unconditional: 2782] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 369, Positive conditional cache size: 0, Positive unconditional cache size: 369, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-1, t1025={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=0, t1025={3:0}, t1026={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=1, t1025={3:0}, t1026={7:0}, t1027={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L877] 0 pthread_t t1028; [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=2, t1025={3:0}, t1026={7:0}, t1027={11:0}, t1028={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={3:0}, t1026={7:0}, t1027={11:0}, t1028={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={3:0}, t1026={7:0}, t1027={11:0}, t1028={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 locations, 16 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: 29.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 767 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 686 mSDsluCounter, 284 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2085 IncrementalHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 15 mSDtfsCounter, 2085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 55, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 16 QuantifiedInterpolants, 1951 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1753 ConjunctsInSsa, 84 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 [2022-11-25 15:39:22,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f68d1a77-f84e-4db5-b588-3e9450019423/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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