./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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_38dce622-6fe5-4398-b8ad-1810a734eeed/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 118e824ffe62f75982c48ce1aa2c212500faccc3e6f3ef4066b7e12455b17249 --- 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:41:30,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:41:30,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:41:31,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:41:31,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:41:31,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:41:31,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:41:31,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:41:31,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:41:31,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:41:31,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:41:31,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:41:31,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:41:31,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:41:31,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:41:31,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:41:31,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:41:31,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:41:31,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:41:31,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:41:31,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:41:31,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:41:31,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:41:31,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:41:31,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:41:31,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:41:31,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:41:31,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:41:31,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:41:31,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:41:31,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:41:31,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:41:31,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:41:31,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:41:31,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:41:31,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:41:31,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:41:31,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:41:31,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:41:31,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:41:31,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:41:31,118 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:41:31,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:41:31,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:41:31,169 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:41:31,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:41:31,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:41:31,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:41:31,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:41:31,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:41:31,173 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:41:31,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:41:31,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:41:31,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:41:31,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:41:31,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:41:31,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:41:31,176 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:41:31,177 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:41:31,177 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:41:31,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:41:31,178 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:41:31,178 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:41:31,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:41:31,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:41:31,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:41:31,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:41:31,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:41:31,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:41:31,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:41:31,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:41:31,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:41:31,181 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:41:31,181 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:41:31,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:41:31,182 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_38dce622-6fe5-4398-b8ad-1810a734eeed/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_38dce622-6fe5-4398-b8ad-1810a734eeed/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 -> 118e824ffe62f75982c48ce1aa2c212500faccc3e6f3ef4066b7e12455b17249 [2022-11-25 15:41:31,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:41:31,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:41:31,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:41:31,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:41:31,575 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:41:31,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-11-25 15:41:35,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:41:35,391 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:41:35,391 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-11-25 15:41:35,421 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data/919ffaa19/32c5ae27c8dc42c8981c8493befb9901/FLAG978385a1f [2022-11-25 15:41:35,438 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data/919ffaa19/32c5ae27c8dc42c8981c8493befb9901 [2022-11-25 15:41:35,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:41:35,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:41:35,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:41:35,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:41:35,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:41:35,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:41:35" (1/1) ... [2022-11-25 15:41:35,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1eda3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:35, skipping insertion in model container [2022-11-25 15:41:35,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:41:35" (1/1) ... [2022-11-25 15:41:35,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:41:35,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:41:35,815 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_38dce622-6fe5-4398-b8ad-1810a734eeed/sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i[999,1012] [2022-11-25 15:41:36,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:41:36,231 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:41:36,250 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_38dce622-6fe5-4398-b8ad-1810a734eeed/sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i[999,1012] [2022-11-25 15:41:36,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:36,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:36,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:41:36,409 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:41:36,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36 WrapperNode [2022-11-25 15:41:36,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:41:36,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:41:36,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:41:36,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:41:36,418 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:41:36" (1/1) ... [2022-11-25 15:41:36,438 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:41:36" (1/1) ... [2022-11-25 15:41:36,471 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-25 15:41:36,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:41:36,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:41:36,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:41:36,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:41:36,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,508 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:41:36,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:41:36,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:41:36,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:41:36,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (1/1) ... [2022-11-25 15:41:36,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:41:36,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:41:36,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:41:36,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:41:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:41:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:41:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:41:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:41:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:41:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:41:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:41:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:41:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:41:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:41:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:41:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:41:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:41:36,634 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:41:36,864 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:41:36,866 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:41:37,389 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:41:37,610 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:41:37,610 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:41:37,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:41:37 BoogieIcfgContainer [2022-11-25 15:41:37,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:41:37,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:41:37,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:41:37,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:41:37,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:41:35" (1/3) ... [2022-11-25 15:41:37,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e6ec02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:41:37, skipping insertion in model container [2022-11-25 15:41:37,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:36" (2/3) ... [2022-11-25 15:41:37,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e6ec02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:41:37, skipping insertion in model container [2022-11-25 15:41:37,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:41:37" (3/3) ... [2022-11-25 15:41:37,624 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2022-11-25 15:41:37,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:41:37,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-25 15:41:37,646 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:41:37,704 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:41:37,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 218 flow [2022-11-25 15:41:37,807 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-11-25 15:41:37,807 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:41:37,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2022-11-25 15:41:37,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 104 transitions, 218 flow [2022-11-25 15:41:37,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 102 transitions, 210 flow [2022-11-25 15:41:37,823 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:41:37,849 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 102 transitions, 210 flow [2022-11-25 15:41:37,852 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 102 transitions, 210 flow [2022-11-25 15:41:37,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 102 transitions, 210 flow [2022-11-25 15:41:37,910 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-11-25 15:41:37,910 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:41:37,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2022-11-25 15:41:37,913 INFO L119 LiptonReduction]: Number of co-enabled transitions 1236 [2022-11-25 15:41:44,030 INFO L134 LiptonReduction]: Checked pairs total: 2884 [2022-11-25 15:41:44,030 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-11-25 15:41:44,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:41:44,059 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;@1dc83aba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:41:44,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-25 15:41:44,061 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 15:41:44,062 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:41:44,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:44,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:41:44,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:44,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:44,070 INFO L85 PathProgramCache]: Analyzing trace with hash 488, now seen corresponding path program 1 times [2022-11-25 15:41:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:44,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842127086] [2022-11-25 15:41:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:44,242 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:41:44,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:44,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842127086] [2022-11-25 15:41:44,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842127086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:44,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:44,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:41:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161805817] [2022-11-25 15:41:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:44,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:41:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:44,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:41:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:41:44,311 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2022-11-25 15:41:44,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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:41:44,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:44,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2022-11-25 15:41:44,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:44,583 INFO L130 PetriNetUnfolder]: 249/438 cut-off events. [2022-11-25 15:41:44,583 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 15:41:44,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 438 events. 249/438 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1712 event pairs, 249 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 868. Up to 427 conditions per place. [2022-11-25 15:41:44,592 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 18 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-11-25 15:41:44,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 80 flow [2022-11-25 15:41:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:41:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:41:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 209 transitions. [2022-11-25 15:41:44,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49292452830188677 [2022-11-25 15:41:44,611 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 209 transitions. [2022-11-25 15:41:44,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 209 transitions. [2022-11-25 15:41:44,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:44,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 209 transitions. [2022-11-25 15:41:44,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 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:41:44,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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:41:44,628 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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:41:44,630 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 209 transitions. [2022-11-25 15:41:44,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 80 flow [2022-11-25 15:41:44,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:41:44,637 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2022-11-25 15:41:44,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-11-25 15:41:44,644 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2022-11-25 15:41:44,644 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2022-11-25 15:41:44,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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:41:44,645 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:44,645 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:41:44,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:41:44,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash 462397350, now seen corresponding path program 1 times [2022-11-25 15:41:44,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:44,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069796660] [2022-11-25 15:41:44,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:45,155 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:41:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:45,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069796660] [2022-11-25 15:41:45,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069796660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:45,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:45,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:41:45,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444227528] [2022-11-25 15:41:45,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:45,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:41:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:45,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:41:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:41:45,169 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 212 [2022-11-25 15:41:45,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:41:45,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:45,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 212 [2022-11-25 15:41:45,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:45,331 INFO L130 PetriNetUnfolder]: 204/381 cut-off events. [2022-11-25 15:41:45,331 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:41:45,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 381 events. 204/381 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1548 event pairs, 24 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 744. Up to 293 conditions per place. [2022-11-25 15:41:45,335 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-11-25 15:41:45,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 110 flow [2022-11-25 15:41:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:41:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:41:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-11-25 15:41:45,339 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47641509433962265 [2022-11-25 15:41:45,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2022-11-25 15:41:45,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2022-11-25 15:41:45,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:45,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2022-11-25 15:41:45,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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:41:45,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 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:41:45,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 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:41:45,346 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 303 transitions. [2022-11-25 15:41:45,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 110 flow [2022-11-25 15:41:45,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:41:45,348 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2022-11-25 15:41:45,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-11-25 15:41:45,349 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2022-11-25 15:41:45,350 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2022-11-25 15:41:45,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:41:45,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:45,351 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:45,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:41:45,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1320306050, now seen corresponding path program 1 times [2022-11-25 15:41:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:45,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650403903] [2022-11-25 15:41:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:45,715 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:41:45,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:45,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650403903] [2022-11-25 15:41:45,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650403903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:45,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:45,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:41:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650074175] [2022-11-25 15:41:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:45,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:41:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:41:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:41:45,744 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2022-11-25 15:41:45,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 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:41:45,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:45,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2022-11-25 15:41:45,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:45,979 INFO L130 PetriNetUnfolder]: 243/432 cut-off events. [2022-11-25 15:41:45,979 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-11-25 15:41:45,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 432 events. 243/432 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1639 event pairs, 91 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 901. Up to 301 conditions per place. [2022-11-25 15:41:45,983 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 34 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2022-11-25 15:41:45,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 176 flow [2022-11-25 15:41:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:41:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:41:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2022-11-25 15:41:45,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4547169811320755 [2022-11-25 15:41:45,988 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2022-11-25 15:41:45,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2022-11-25 15:41:45,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:45,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2022-11-25 15:41:45,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 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:41:45,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:45,996 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:45,996 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 482 transitions. [2022-11-25 15:41:45,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 176 flow [2022-11-25 15:41:45,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:41:45,998 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 83 flow [2022-11-25 15:41:45,998 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-11-25 15:41:45,999 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-11-25 15:41:46,000 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 83 flow [2022-11-25 15:41:46,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 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:41:46,000 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:46,001 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:46,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:41:46,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:46,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:46,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1320306084, now seen corresponding path program 1 times [2022-11-25 15:41:46,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:46,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121853159] [2022-11-25 15:41:46,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:46,379 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:41:46,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121853159] [2022-11-25 15:41:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121853159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:46,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:46,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:41:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498412669] [2022-11-25 15:41:46,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:46,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:41:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:41:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:41:46,461 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 212 [2022-11-25 15:41:46,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:41:46,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:46,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 212 [2022-11-25 15:41:46,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:46,580 INFO L130 PetriNetUnfolder]: 141/278 cut-off events. [2022-11-25 15:41:46,580 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-11-25 15:41:46,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 278 events. 141/278 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1068 event pairs, 63 based on Foata normal form. 36/314 useless extension candidates. Maximal degree in co-relation 703. Up to 257 conditions per place. [2022-11-25 15:41:46,583 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 18 selfloop transitions, 2 changer transitions 3/24 dead transitions. [2022-11-25 15:41:46,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 136 flow [2022-11-25 15:41:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:41:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:41:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2022-11-25 15:41:46,585 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4091981132075472 [2022-11-25 15:41:46,585 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2022-11-25 15:41:46,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2022-11-25 15:41:46,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:46,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2022-11-25 15:41:46,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 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:41:46,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 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:41:46,591 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 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:41:46,591 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 83 flow. Second operand 4 states and 347 transitions. [2022-11-25 15:41:46,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 136 flow [2022-11-25 15:41:46,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:41:46,594 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 64 flow [2022-11-25 15:41:46,594 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2022-11-25 15:41:46,595 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-11-25 15:41:46,595 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 64 flow [2022-11-25 15:41:46,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:41:46,596 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:46,596 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:46,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:41:46,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1684779636, now seen corresponding path program 1 times [2022-11-25 15:41:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:46,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932305232] [2022-11-25 15:41:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:46,908 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:41:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:46,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932305232] [2022-11-25 15:41:46,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932305232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:46,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:46,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:41:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17415214] [2022-11-25 15:41:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:46,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:41:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:41:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:41:46,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2022-11-25 15:41:46,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 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:41:46,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:46,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2022-11-25 15:41:46,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:47,101 INFO L130 PetriNetUnfolder]: 153/278 cut-off events. [2022-11-25 15:41:47,101 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-11-25 15:41:47,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 278 events. 153/278 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 893 event pairs, 53 based on Foata normal form. 12/290 useless extension candidates. Maximal degree in co-relation 694. Up to 197 conditions per place. [2022-11-25 15:41:47,104 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 19 selfloop transitions, 3 changer transitions 8/30 dead transitions. [2022-11-25 15:41:47,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 154 flow [2022-11-25 15:41:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:41:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:41:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-11-25 15:41:47,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44433962264150945 [2022-11-25 15:41:47,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 471 transitions. [2022-11-25 15:41:47,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 471 transitions. [2022-11-25 15:41:47,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:47,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 471 transitions. [2022-11-25 15:41:47,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 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:41:47,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:47,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:47,114 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 64 flow. Second operand 5 states and 471 transitions. [2022-11-25 15:41:47,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 154 flow [2022-11-25 15:41:47,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 145 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 15:41:47,117 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 72 flow [2022-11-25 15:41:47,118 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2022-11-25 15:41:47,119 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-11-25 15:41:47,119 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 72 flow [2022-11-25 15:41:47,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 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:41:47,120 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:47,120 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:47,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:41:47,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1755025521, now seen corresponding path program 1 times [2022-11-25 15:41:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:47,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206293513] [2022-11-25 15:41:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:47,374 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:41:47,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:47,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206293513] [2022-11-25 15:41:47,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206293513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:47,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:47,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:41:47,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012940685] [2022-11-25 15:41:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:47,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:41:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:47,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:41:47,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:41:47,388 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2022-11-25 15:41:47,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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:41:47,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:47,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2022-11-25 15:41:47,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:47,502 INFO L130 PetriNetUnfolder]: 65/148 cut-off events. [2022-11-25 15:41:47,503 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-25 15:41:47,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 148 events. 65/148 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 23 based on Foata normal form. 20/168 useless extension candidates. Maximal degree in co-relation 392. Up to 58 conditions per place. [2022-11-25 15:41:47,504 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 29 selfloop transitions, 4 changer transitions 1/35 dead transitions. [2022-11-25 15:41:47,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 195 flow [2022-11-25 15:41:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:41:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:41:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2022-11-25 15:41:47,507 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.455188679245283 [2022-11-25 15:41:47,507 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 386 transitions. [2022-11-25 15:41:47,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 386 transitions. [2022-11-25 15:41:47,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:47,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 386 transitions. [2022-11-25 15:41:47,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 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:41:47,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 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:41:47,512 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 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:41:47,512 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 72 flow. Second operand 4 states and 386 transitions. [2022-11-25 15:41:47,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 195 flow [2022-11-25 15:41:47,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 181 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 15:41:47,516 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 88 flow [2022-11-25 15:41:47,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-11-25 15:41:47,520 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-11-25 15:41:47,520 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 88 flow [2022-11-25 15:41:47,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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:41:47,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:47,521 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:47,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:41:47,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash -376818769, now seen corresponding path program 1 times [2022-11-25 15:41:47,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:47,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063556537] [2022-11-25 15:41:47,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:47,894 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:41:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:47,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063556537] [2022-11-25 15:41:47,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063556537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:47,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:47,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:41:47,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604722449] [2022-11-25 15:41:47,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:41:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:47,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:41:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:41:47,915 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2022-11-25 15:41:47,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 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:41:47,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:47,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2022-11-25 15:41:47,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:48,032 INFO L130 PetriNetUnfolder]: 24/68 cut-off events. [2022-11-25 15:41:48,037 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-25 15:41:48,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 68 events. 24/68 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 8 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 214. Up to 29 conditions per place. [2022-11-25 15:41:48,038 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 20 selfloop transitions, 6 changer transitions 1/28 dead transitions. [2022-11-25 15:41:48,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 171 flow [2022-11-25 15:41:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:41:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:41:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-11-25 15:41:48,041 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44056603773584907 [2022-11-25 15:41:48,041 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 467 transitions. [2022-11-25 15:41:48,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 467 transitions. [2022-11-25 15:41:48,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:48,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 467 transitions. [2022-11-25 15:41:48,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 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:41:48,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:48,047 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:48,047 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 88 flow. Second operand 5 states and 467 transitions. [2022-11-25 15:41:48,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 171 flow [2022-11-25 15:41:48,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 148 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-25 15:41:48,053 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 93 flow [2022-11-25 15:41:48,053 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2022-11-25 15:41:48,054 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2022-11-25 15:41:48,054 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 93 flow [2022-11-25 15:41:48,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 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:41:48,055 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:48,055 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:41:48,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:41:48,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1165405801, now seen corresponding path program 1 times [2022-11-25 15:41:48,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:48,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642627619] [2022-11-25 15:41:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:48,461 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:41:48,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:48,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642627619] [2022-11-25 15:41:48,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642627619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:48,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:48,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:41:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316609654] [2022-11-25 15:41:48,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:48,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:41:48,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:48,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:41:48,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:41:48,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2022-11-25 15:41:48,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 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:41:48,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:48,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2022-11-25 15:41:48,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:48,640 INFO L130 PetriNetUnfolder]: 24/73 cut-off events. [2022-11-25 15:41:48,641 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 15:41:48,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 73 events. 24/73 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 182 event pairs, 1 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 242. Up to 46 conditions per place. [2022-11-25 15:41:48,642 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 19 selfloop transitions, 1 changer transitions 16/36 dead transitions. [2022-11-25 15:41:48,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 244 flow [2022-11-25 15:41:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:41:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:41:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-11-25 15:41:48,645 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44433962264150945 [2022-11-25 15:41:48,646 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 471 transitions. [2022-11-25 15:41:48,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 471 transitions. [2022-11-25 15:41:48,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:48,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 471 transitions. [2022-11-25 15:41:48,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 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:41:48,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:48,652 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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:41:48,652 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 93 flow. Second operand 5 states and 471 transitions. [2022-11-25 15:41:48,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 244 flow [2022-11-25 15:41:48,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 183 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-11-25 15:41:48,655 INFO L231 Difference]: Finished difference. Result has 34 places, 18 transitions, 64 flow [2022-11-25 15:41:48,655 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=18} [2022-11-25 15:41:48,656 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2022-11-25 15:41:48,656 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 64 flow [2022-11-25 15:41:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 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:41:48,657 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:48,658 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:41:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:41:48,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1294472285, now seen corresponding path program 2 times [2022-11-25 15:41:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:48,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184954339] [2022-11-25 15:41:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:50,329 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:41:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:50,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184954339] [2022-11-25 15:41:50,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184954339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:50,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:50,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747723518] [2022-11-25 15:41:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:50,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:41:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:41:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:41:50,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 212 [2022-11-25 15:41:50,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 64 flow. Second operand has 8 states, 8 states have (on average 88.875) internal successors, (711), 8 states have internal predecessors, (711), 0 states have call successors, (0), 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:41:50,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:50,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 212 [2022-11-25 15:41:50,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:41:50,643 INFO L130 PetriNetUnfolder]: 10/46 cut-off events. [2022-11-25 15:41:50,643 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-25 15:41:50,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 46 events. 10/46 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 2 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 129. Up to 13 conditions per place. [2022-11-25 15:41:50,643 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 13 selfloop transitions, 5 changer transitions 11/30 dead transitions. [2022-11-25 15:41:50,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 169 flow [2022-11-25 15:41:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:41:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:41:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 809 transitions. [2022-11-25 15:41:50,647 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4240041928721174 [2022-11-25 15:41:50,647 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 809 transitions. [2022-11-25 15:41:50,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 809 transitions. [2022-11-25 15:41:50,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:41:50,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 809 transitions. [2022-11-25 15:41:50,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.88888888888889) internal successors, (809), 9 states have internal predecessors, (809), 0 states have call successors, (0), 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:41:50,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 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:41:50,654 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 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:41:50,655 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 64 flow. Second operand 9 states and 809 transitions. [2022-11-25 15:41:50,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 169 flow [2022-11-25 15:41:50,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 157 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-25 15:41:50,656 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 75 flow [2022-11-25 15:41:50,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=75, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2022-11-25 15:41:50,657 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-11-25 15:41:50,658 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 75 flow [2022-11-25 15:41:50,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.875) internal successors, (711), 8 states have internal predecessors, (711), 0 states have call successors, (0), 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:41:50,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:41:50,659 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:41:50,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:41:50,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:41:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1245238309, now seen corresponding path program 3 times [2022-11-25 15:41:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924597646] [2022-11-25 15:41:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:41:50,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:41:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:41:50,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:41:50,778 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:41:50,779 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-25 15:41:50,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-25 15:41:50,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-25 15:41:50,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-25 15:41:50,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-25 15:41:50,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-25 15:41:50,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-25 15:41:50,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-25 15:41:50,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-25 15:41:50,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-25 15:41:50,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:41:50,784 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:50,790 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:41:50,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:41:50,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:41:50 BasicIcfg [2022-11-25 15:41:50,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:41:50,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:41:50,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:41:50,850 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:41:50,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:41:37" (3/4) ... [2022-11-25 15:41:50,859 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:41:50,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:41:50,860 INFO L158 Benchmark]: Toolchain (without parser) took 15417.24ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 158.8MB in the beginning and 179.1MB in the end (delta: -20.3MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2022-11-25 15:41:50,861 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory was 64.6MB in the beginning and 64.4MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:41:50,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 965.91ms. Allocated memory is still 192.9MB. Free memory was 158.8MB in the beginning and 132.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:41:50,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.25ms. Allocated memory is still 192.9MB. Free memory was 132.5MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:41:50,862 INFO L158 Benchmark]: Boogie Preprocessor took 42.40ms. Allocated memory is still 192.9MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:41:50,862 INFO L158 Benchmark]: RCFGBuilder took 1098.21ms. Allocated memory is still 192.9MB. Free memory was 128.4MB in the beginning and 91.7MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-25 15:41:50,863 INFO L158 Benchmark]: TraceAbstraction took 13233.22ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 91.7MB in the beginning and 180.2MB in the end (delta: -88.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2022-11-25 15:41:50,863 INFO L158 Benchmark]: Witness Printer took 9.30ms. Allocated memory is still 281.0MB. Free memory was 180.2MB in the beginning and 179.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:41:50,866 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.34ms. Allocated memory is still 123.7MB. Free memory was 64.6MB in the beginning and 64.4MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 965.91ms. Allocated memory is still 192.9MB. Free memory was 158.8MB in the beginning and 132.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.25ms. Allocated memory is still 192.9MB. Free memory was 132.5MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.40ms. Allocated memory is still 192.9MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1098.21ms. Allocated memory is still 192.9MB. Free memory was 128.4MB in the beginning and 91.7MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13233.22ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 91.7MB in the beginning and 180.2MB in the end (delta: -88.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Witness Printer took 9.30ms. Allocated memory is still 281.0MB. Free memory was 180.2MB in the beginning and 179.1MB 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: 6.2s, 107 PlacesBefore, 30 PlacesAfterwards, 102 TransitionsBefore, 24 TransitionsAfterwards, 1236 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 2884 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1515, independent: 1408, independent conditional: 0, independent unconditional: 1408, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 896, independent: 857, independent conditional: 0, independent unconditional: 857, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 896, independent: 848, independent conditional: 0, independent unconditional: 848, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 571, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 549, dependent conditional: 0, dependent unconditional: 549, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1515, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 896, unknown conditional: 0, unknown unconditional: 896] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L821] 0 pthread_t t311; [L822] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t311, ((void *)0), P0, ((void *)0))=-1, t311={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] 0 pthread_t t312; [L824] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t312, ((void *)0), P1, ((void *)0))=0, t311={5:0}, t312={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 1 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 x$flush_delayed = weak$$choice2 [L783] 2 x$mem_tmp = x [L784] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L785] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L786] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L787] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L788] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L790] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EAX = x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 1 x$flush_delayed = weak$$choice2 [L747] 1 x$mem_tmp = x [L748] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 __unbuffered_p0_EAX = x [L756] 1 x = x$flush_delayed ? x$mem_tmp : x [L757] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L799] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L828] RET 0 assume_abort_if_not(main$tmp_guard0) [L830] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L839] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: 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: 819]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 822]: 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: 824]: 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 5 procedures, 122 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 13 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:41:50,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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_38dce622-6fe5-4398-b8ad-1810a734eeed/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 118e824ffe62f75982c48ce1aa2c212500faccc3e6f3ef4066b7e12455b17249 --- 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:41:53,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:41:53,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:41:53,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:41:53,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:41:53,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:41:53,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:41:53,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:41:53,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:41:53,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:41:53,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:41:53,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:41:53,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:41:53,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:41:53,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:41:53,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:41:53,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:41:53,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:41:53,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:41:53,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:41:53,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:41:53,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:41:53,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:41:53,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:41:53,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:41:53,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:41:53,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:41:53,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:41:53,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:41:53,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:41:53,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:41:53,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:41:53,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:41:53,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:41:53,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:41:53,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:41:53,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:41:53,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:41:53,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:41:53,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:41:53,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:41:53,607 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 15:41:53,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:41:53,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:41:53,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:41:53,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:41:53,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:41:53,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:41:53,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:41:53,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:41:53,661 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:41:53,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:41:53,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:41:53,663 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:41:53,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:41:53,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:41:53,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:41:53,664 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:41:53,664 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:41:53,664 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:41:53,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:41:53,664 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:41:53,665 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:41:53,665 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:41:53,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:41:53,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:41:53,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:41:53,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:41:53,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:41:53,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:41:53,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:41:53,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:41:53,667 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:41:53,667 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:41:53,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:41:53,668 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:41:53,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:41:53,669 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:41:53,669 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_38dce622-6fe5-4398-b8ad-1810a734eeed/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_38dce622-6fe5-4398-b8ad-1810a734eeed/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 -> 118e824ffe62f75982c48ce1aa2c212500faccc3e6f3ef4066b7e12455b17249 [2022-11-25 15:41:54,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:41:54,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:41:54,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:41:54,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:41:54,165 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:41:54,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-11-25 15:41:57,511 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:41:57,811 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:41:57,812 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-11-25 15:41:57,829 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data/91c73b755/0d9bd6e32d154a26b6a893c1d9c3b4da/FLAGfa48700f3 [2022-11-25 15:41:57,859 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/data/91c73b755/0d9bd6e32d154a26b6a893c1d9c3b4da [2022-11-25 15:41:57,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:41:57,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:41:57,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:41:57,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:41:57,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:41:57,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:41:57" (1/1) ... [2022-11-25 15:41:57,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fe1234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:57, skipping insertion in model container [2022-11-25 15:41:57,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:41:57" (1/1) ... [2022-11-25 15:41:57,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:41:57,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:41:58,135 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_38dce622-6fe5-4398-b8ad-1810a734eeed/sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i[999,1012] [2022-11-25 15:41:58,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:41:58,556 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:41:58,574 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_38dce622-6fe5-4398-b8ad-1810a734eeed/sv-benchmarks/c/pthread-wmm/mix012_pso.opt_tso.opt.i[999,1012] [2022-11-25 15:41:58,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:41:58,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:41:58,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:41:58,757 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:41:58,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58 WrapperNode [2022-11-25 15:41:58,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:41:58,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:41:58,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:41:58,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:41:58,771 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:41:58" (1/1) ... [2022-11-25 15:41:58,807 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:41:58" (1/1) ... [2022-11-25 15:41:58,874 INFO L138 Inliner]: procedures = 178, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-25 15:41:58,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:41:58,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:41:58,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:41:58,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:41:58,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,944 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:41:58,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:41:58,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:41:58,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:41:58,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (1/1) ... [2022-11-25 15:41:58,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:41:59,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:41:59,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:41:59,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:41:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:41:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:41:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:41:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:41:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:41:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:41:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:41:59,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:41:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:41:59,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:41:59,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:41:59,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:41:59,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:41:59,085 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:41:59,389 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:41:59,392 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:41:59,875 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:42:00,146 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:42:00,147 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:42:00,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:42:00 BoogieIcfgContainer [2022-11-25 15:42:00,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:42:00,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:42:00,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:42:00,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:42:00,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:41:57" (1/3) ... [2022-11-25 15:42:00,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14babaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:42:00, skipping insertion in model container [2022-11-25 15:42:00,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:41:58" (2/3) ... [2022-11-25 15:42:00,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14babaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:42:00, skipping insertion in model container [2022-11-25 15:42:00,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:42:00" (3/3) ... [2022-11-25 15:42:00,166 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2022-11-25 15:42:00,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:42:00,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-25 15:42:00,189 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:42:00,252 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:42:00,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 220 flow [2022-11-25 15:42:00,399 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-11-25 15:42:00,399 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:42:00,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2022-11-25 15:42:00,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 105 transitions, 220 flow [2022-11-25 15:42:00,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 103 transitions, 212 flow [2022-11-25 15:42:00,423 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:42:00,452 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 103 transitions, 212 flow [2022-11-25 15:42:00,461 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 103 transitions, 212 flow [2022-11-25 15:42:00,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 212 flow [2022-11-25 15:42:00,513 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-11-25 15:42:00,514 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:42:00,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2022-11-25 15:42:00,516 INFO L119 LiptonReduction]: Number of co-enabled transitions 1236 [2022-11-25 15:42:09,235 INFO L134 LiptonReduction]: Checked pairs total: 3136 [2022-11-25 15:42:09,235 INFO L136 LiptonReduction]: Total number of compositions: 111 [2022-11-25 15:42:09,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:42:09,261 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;@608c96c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:42:09,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-25 15:42:09,264 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 15:42:09,264 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:42:09,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:09,265 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:42:09,266 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:42:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 492, now seen corresponding path program 1 times [2022-11-25 15:42:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:09,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731437127] [2022-11-25 15:42:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:09,290 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:42:09,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:09,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:09,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:09,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:42:09,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:09,426 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:42:09,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:09,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731437127] [2022-11-25 15:42:09,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731437127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:09,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:09,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:42:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020408132] [2022-11-25 15:42:09,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:09,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:42:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:09,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:42:09,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:42:09,487 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 216 [2022-11-25 15:42:09,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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:42:09,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:42:09,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 216 [2022-11-25 15:42:09,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:09,814 INFO L130 PetriNetUnfolder]: 249/434 cut-off events. [2022-11-25 15:42:09,814 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 15:42:09,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 434 events. 249/434 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1696 event pairs, 249 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 864. Up to 427 conditions per place. [2022-11-25 15:42:09,825 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 18 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-11-25 15:42:09,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 80 flow [2022-11-25 15:42:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:42:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:42:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 211 transitions. [2022-11-25 15:42:09,847 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48842592592592593 [2022-11-25 15:42:09,849 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 211 transitions. [2022-11-25 15:42:09,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 211 transitions. [2022-11-25 15:42:09,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:09,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 211 transitions. [2022-11-25 15:42:09,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 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:42:09,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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:42:09,884 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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:42:09,886 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 211 transitions. [2022-11-25 15:42:09,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 80 flow [2022-11-25 15:42:09,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:42:09,892 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2022-11-25 15:42:09,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-11-25 15:42:09,898 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2022-11-25 15:42:09,899 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2022-11-25 15:42:09,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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:42:09,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:09,900 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:42:09,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:10,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:10,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:42:10,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash 464299233, now seen corresponding path program 1 times [2022-11-25 15:42:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:10,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036966502] [2022-11-25 15:42:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:10,122 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:42:10,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:10,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:10,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:10,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:42:10,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:10,300 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:42:10,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:10,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:10,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036966502] [2022-11-25 15:42:10,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036966502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:10,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:10,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:42:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942856055] [2022-11-25 15:42:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:10,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:42:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:42:10,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:42:10,309 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 216 [2022-11-25 15:42:10,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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:42:10,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:42:10,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 216 [2022-11-25 15:42:10,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:10,500 INFO L130 PetriNetUnfolder]: 204/381 cut-off events. [2022-11-25 15:42:10,500 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:42:10,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 381 events. 204/381 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1575 event pairs, 24 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 744. Up to 293 conditions per place. [2022-11-25 15:42:10,504 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-11-25 15:42:10,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 110 flow [2022-11-25 15:42:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:42:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:42:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-11-25 15:42:10,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-11-25 15:42:10,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2022-11-25 15:42:10,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2022-11-25 15:42:10,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:10,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2022-11-25 15:42:10,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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:42:10,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 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:42:10,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 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:42:10,514 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 306 transitions. [2022-11-25 15:42:10,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 110 flow [2022-11-25 15:42:10,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:42:10,516 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2022-11-25 15:42:10,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-11-25 15:42:10,517 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2022-11-25 15:42:10,517 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2022-11-25 15:42:10,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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:42:10,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:10,518 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:10,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:10,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:10,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:42:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash -484977456, now seen corresponding path program 1 times [2022-11-25 15:42:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:10,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38358357] [2022-11-25 15:42:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:10,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:42:10,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:10,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:10,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:10,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:42:10,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:10,949 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:42:10,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:10,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:10,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38358357] [2022-11-25 15:42:10,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38358357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:10,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:10,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:42:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404190696] [2022-11-25 15:42:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:10,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:42:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:42:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:42:11,001 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 216 [2022-11-25 15:42:11,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 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:42:11,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:42:11,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 216 [2022-11-25 15:42:11,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:11,235 INFO L130 PetriNetUnfolder]: 76/168 cut-off events. [2022-11-25 15:42:11,235 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-25 15:42:11,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 168 events. 76/168 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 575 event pairs, 15 based on Foata normal form. 20/180 useless extension candidates. Maximal degree in co-relation 357. Up to 94 conditions per place. [2022-11-25 15:42:11,240 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 22 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2022-11-25 15:42:11,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 178 flow [2022-11-25 15:42:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:42:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:42:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-11-25 15:42:11,251 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-11-25 15:42:11,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2022-11-25 15:42:11,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2022-11-25 15:42:11,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:11,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2022-11-25 15:42:11,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 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:42:11,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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:42:11,262 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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:42:11,263 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 477 transitions. [2022-11-25 15:42:11,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 178 flow [2022-11-25 15:42:11,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:42:11,265 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 65 flow [2022-11-25 15:42:11,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-11-25 15:42:11,267 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-11-25 15:42:11,267 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 65 flow [2022-11-25 15:42:11,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 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:42:11,268 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:11,268 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:11,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:11,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:11,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:42:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1432925695, now seen corresponding path program 1 times [2022-11-25 15:42:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:11,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88497195] [2022-11-25 15:42:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:11,491 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:42:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:11,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:11,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:11,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:42:11,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:11,682 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:42:11,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:11,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:11,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88497195] [2022-11-25 15:42:11,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88497195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:11,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:11,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:42:11,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984145091] [2022-11-25 15:42:11,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:11,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:42:11,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:11,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:42:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:42:11,730 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 216 [2022-11-25 15:42:11,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 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:42:11,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:42:11,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 216 [2022-11-25 15:42:11,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:11,944 INFO L130 PetriNetUnfolder]: 24/69 cut-off events. [2022-11-25 15:42:11,944 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 15:42:11,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 69 events. 24/69 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 151 event pairs, 10 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 182. Up to 29 conditions per place. [2022-11-25 15:42:11,945 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 20 selfloop transitions, 5 changer transitions 8/34 dead transitions. [2022-11-25 15:42:11,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 173 flow [2022-11-25 15:42:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:42:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:42:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2022-11-25 15:42:11,948 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42978395061728397 [2022-11-25 15:42:11,971 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 557 transitions. [2022-11-25 15:42:11,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 557 transitions. [2022-11-25 15:42:11,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:11,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 557 transitions. [2022-11-25 15:42:11,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 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:42:11,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:42:11,981 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:42:11,981 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 65 flow. Second operand 6 states and 557 transitions. [2022-11-25 15:42:11,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 173 flow [2022-11-25 15:42:11,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 160 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-25 15:42:11,983 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 76 flow [2022-11-25 15:42:11,984 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2022-11-25 15:42:11,985 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2022-11-25 15:42:11,985 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 76 flow [2022-11-25 15:42:11,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 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:42:11,986 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:11,986 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:12,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:12,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:12,207 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:42:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1700891415, now seen corresponding path program 1 times [2022-11-25 15:42:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:12,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839819862] [2022-11-25 15:42:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:12,208 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:42:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:12,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:12,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:12,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:42:12,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:12,415 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:42:12,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:12,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839819862] [2022-11-25 15:42:12,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839819862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:12,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:12,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:42:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374081328] [2022-11-25 15:42:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:12,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:42:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:42:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:42:12,441 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2022-11-25 15:42:12,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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:42:12,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:42:12,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2022-11-25 15:42:12,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:12,601 INFO L130 PetriNetUnfolder]: 24/75 cut-off events. [2022-11-25 15:42:12,601 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-25 15:42:12,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 75 events. 24/75 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 190 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 212. Up to 47 conditions per place. [2022-11-25 15:42:12,602 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 34 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-11-25 15:42:12,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 219 flow [2022-11-25 15:42:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:42:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:42:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2022-11-25 15:42:12,605 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4548611111111111 [2022-11-25 15:42:12,605 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2022-11-25 15:42:12,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2022-11-25 15:42:12,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:12,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2022-11-25 15:42:12,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 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:42:12,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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:42:12,611 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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:42:12,611 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 76 flow. Second operand 4 states and 393 transitions. [2022-11-25 15:42:12,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 219 flow [2022-11-25 15:42:12,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 188 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-25 15:42:12,615 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 73 flow [2022-11-25 15:42:12,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-11-25 15:42:12,618 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-11-25 15:42:12,618 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 73 flow [2022-11-25 15:42:12,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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:42:12,619 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:12,619 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:12,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:12,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:12,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:42:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -588349323, now seen corresponding path program 2 times [2022-11-25 15:42:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:12,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656944723] [2022-11-25 15:42:12,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:42:12,833 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:42:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:12,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:12,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:12,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:42:12,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:42:12,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 15:42:12,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:13,955 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:42:13,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:42:13,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:13,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656944723] [2022-11-25 15:42:13,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656944723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:13,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:13,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:42:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786245491] [2022-11-25 15:42:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:13,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:42:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:13,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:42:13,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:42:14,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 216 [2022-11-25 15:42:14,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 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:42:14,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:42:14,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 216 [2022-11-25 15:42:14,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:14,512 INFO L130 PetriNetUnfolder]: 22/89 cut-off events. [2022-11-25 15:42:14,512 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-11-25 15:42:14,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 89 events. 22/89 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 6 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 251. Up to 22 conditions per place. [2022-11-25 15:42:14,513 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 28 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2022-11-25 15:42:14,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 214 flow [2022-11-25 15:42:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:42:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:42:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 736 transitions. [2022-11-25 15:42:14,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-11-25 15:42:14,518 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 736 transitions. [2022-11-25 15:42:14,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 736 transitions. [2022-11-25 15:42:14,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:14,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 736 transitions. [2022-11-25 15:42:14,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 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:42:14,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 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:42:14,526 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 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:42:14,527 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 73 flow. Second operand 8 states and 736 transitions. [2022-11-25 15:42:14,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 214 flow [2022-11-25 15:42:14,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:42:14,529 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 98 flow [2022-11-25 15:42:14,530 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=98, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-11-25 15:42:14,530 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-11-25 15:42:14,531 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 98 flow [2022-11-25 15:42:14,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 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:42:14,531 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:14,532 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:14,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:14,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:14,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-25 15:42:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1712734805, now seen corresponding path program 3 times [2022-11-25 15:42:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:14,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180461716] [2022-11-25 15:42:14,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:42:14,754 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:42:14,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:14,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:14,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:14,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 15:42:14,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 15:42:14,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:42:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:42:15,066 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 15:42:15,066 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:42:15,067 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-25 15:42:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-25 15:42:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-25 15:42:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-25 15:42:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-25 15:42:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-25 15:42:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-25 15:42:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-25 15:42:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-25 15:42:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-25 15:42:15,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:15,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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:42:15,283 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-25 15:42:15,290 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:42:15,291 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:42:15,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:42:15 BasicIcfg [2022-11-25 15:42:15,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:42:15,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:42:15,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:42:15,350 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:42:15,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:42:00" (3/4) ... [2022-11-25 15:42:15,354 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:42:15,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:42:15,355 INFO L158 Benchmark]: Toolchain (without parser) took 17491.33ms. Allocated memory was 71.3MB in the beginning and 144.7MB in the end (delta: 73.4MB). Free memory was 46.1MB in the beginning and 88.3MB in the end (delta: -42.2MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-11-25 15:42:15,356 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 71.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:42:15,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 894.31ms. Allocated memory is still 71.3MB. Free memory was 45.8MB in the beginning and 40.0MB in the end (delta: 5.9MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-11-25 15:42:15,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.49ms. Allocated memory is still 71.3MB. Free memory was 40.0MB in the beginning and 37.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:42:15,357 INFO L158 Benchmark]: Boogie Preprocessor took 89.35ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 35.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:42:15,358 INFO L158 Benchmark]: RCFGBuilder took 1184.22ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 35.1MB in the beginning and 75.2MB in the end (delta: -40.1MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-11-25 15:42:15,359 INFO L158 Benchmark]: TraceAbstraction took 15193.94ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 74.5MB in the beginning and 88.3MB in the end (delta: -13.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-11-25 15:42:15,359 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 144.7MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:42:15,362 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.96ms. Allocated memory is still 71.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 894.31ms. Allocated memory is still 71.3MB. Free memory was 45.8MB in the beginning and 40.0MB in the end (delta: 5.9MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.49ms. Allocated memory is still 71.3MB. Free memory was 40.0MB in the beginning and 37.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.35ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 35.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1184.22ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 35.1MB in the beginning and 75.2MB in the end (delta: -40.1MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15193.94ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 74.5MB in the beginning and 88.3MB in the end (delta: -13.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 144.7MB. Free memory is still 88.3MB. 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: 8.8s, 108 PlacesBefore, 30 PlacesAfterwards, 103 TransitionsBefore, 24 TransitionsAfterwards, 1236 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 3136 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1620, independent: 1487, independent conditional: 0, independent unconditional: 1487, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 917, independent: 875, independent conditional: 0, independent unconditional: 875, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 917, independent: 861, independent conditional: 0, independent unconditional: 861, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 502, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 465, dependent conditional: 0, dependent unconditional: 465, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1620, independent: 612, independent conditional: 0, independent unconditional: 612, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 917, unknown conditional: 0, unknown unconditional: 917] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L821] 0 pthread_t t311; [L822] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t311, ((void *)0), P0, ((void *)0))=-1, t311={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] 0 pthread_t t312; [L824] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t312, ((void *)0), P1, ((void *)0))=0, t311={3:0}, t312={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 1 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 x$flush_delayed = weak$$choice2 [L783] 2 x$mem_tmp = x [L784] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L785] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L786] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L787] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L788] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L790] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EAX = x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 1 x$flush_delayed = weak$$choice2 [L747] 1 x$mem_tmp = x [L748] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 __unbuffered_p0_EAX = x [L756] 1 x = x$flush_delayed ? x$mem_tmp : x [L757] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L799] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L828] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L828] RET 0 assume_abort_if_not(main$tmp_guard0) [L830] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={3:0}, t312={7:0}, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L839] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: 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: 819]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 822]: 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: 824]: 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 5 procedures, 123 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 26 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=6, InterpolantAutomatonStates: 28, 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.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 9 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:42:15,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38dce622-6fe5-4398-b8ad-1810a734eeed/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