./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8 --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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- 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-2329fc7 [2022-12-13 22:20:48,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:20:48,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:20:48,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:20:48,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:20:48,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:20:48,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:20:48,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:20:48,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:20:48,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:20:48,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:20:48,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:20:48,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:20:48,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:20:48,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:20:48,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:20:48,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:20:48,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:20:48,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:20:48,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:20:48,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:20:48,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:20:48,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:20:48,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:20:48,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:20:48,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:20:48,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:20:48,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:20:48,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:20:48,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:20:48,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:20:48,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:20:48,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:20:48,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:20:48,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:20:48,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:20:48,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:20:48,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:20:48,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:20:48,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:20:48,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:20:48,285 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 22:20:48,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:20:48,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:20:48,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:20:48,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:20:48,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:20:48,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:20:48,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:20:48,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:20:48,302 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:20:48,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:20:48,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:20:48,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:20:48,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:20:48,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:20:48,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:20:48,303 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 22:20:48,303 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 22:20:48,304 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 22:20:48,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:20:48,304 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 22:20:48,304 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:20:48,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:20:48,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:20:48,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:20:48,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:20:48,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:20:48,305 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:20:48,306 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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2022-12-13 22:20:48,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:20:48,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:20:48,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:20:48,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:20:48,486 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:20:48,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:20:51,078 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:20:51,236 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:20:51,236 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:20:51,246 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data/fb977477a/d86c544a1b4941f08d71644e61522ab3/FLAG5bb801c6b [2022-12-13 22:20:51,256 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data/fb977477a/d86c544a1b4941f08d71644e61522ab3 [2022-12-13 22:20:51,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:20:51,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:20:51,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:20:51,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:20:51,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:20:51,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4575e9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51, skipping insertion in model container [2022-12-13 22:20:51,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:20:51,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:20:51,409 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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:20:51,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:20:51,546 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:20:51,555 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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:20:51,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:20:51,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:20:51,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:20:51,617 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:20:51,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51 WrapperNode [2022-12-13 22:20:51,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:20:51,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:20:51,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:20:51,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:20:51,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,662 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 22:20:51,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:20:51,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:20:51,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:20:51,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:20:51,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,680 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:20:51,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:20:51,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:20:51,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:20:51,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (1/1) ... [2022-12-13 22:20:51,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:20:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:20:51,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:20:51,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:20:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:20:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:20:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:20:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 22:20:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:20:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:20:51,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:20:51,740 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 22:20:51,855 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:20:51,856 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:20:52,124 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:20:52,233 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:20:52,233 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:20:52,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:52 BoogieIcfgContainer [2022-12-13 22:20:52,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:20:52,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:20:52,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:20:52,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:20:52,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:20:51" (1/3) ... [2022-12-13 22:20:52,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3e6f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:20:52, skipping insertion in model container [2022-12-13 22:20:52,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:51" (2/3) ... [2022-12-13 22:20:52,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3e6f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:20:52, skipping insertion in model container [2022-12-13 22:20:52,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:52" (3/3) ... [2022-12-13 22:20:52,245 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:20:52,264 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:20:52,264 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 22:20:52,264 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:20:52,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:20:52,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-12-13 22:20:52,373 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 22:20:52,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:20:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 22:20:52,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 129 transitions, 273 flow [2022-12-13 22:20:52,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 126 transitions, 261 flow [2022-12-13 22:20:52,383 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:20:52,391 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 261 flow [2022-12-13 22:20:52,393 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 261 flow [2022-12-13 22:20:52,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 261 flow [2022-12-13 22:20:52,413 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 22:20:52,413 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:20:52,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 22:20:52,415 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-12-13 22:20:55,288 INFO L134 LiptonReduction]: Checked pairs total: 6455 [2022-12-13 22:20:55,288 INFO L136 LiptonReduction]: Total number of compositions: 128 [2022-12-13 22:20:55,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:20:55,303 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;@67084a3d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:20:55,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 22:20:55,305 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 22:20:55,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:20:55,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:55,305 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 22:20:55,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:55,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash 554, now seen corresponding path program 1 times [2022-12-13 22:20:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:55,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148594549] [2022-12-13 22:20:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:55,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148594549] [2022-12-13 22:20:55,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148594549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:55,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:55,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 22:20:55,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136415453] [2022-12-13 22:20:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:55,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 22:20:55,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:55,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 22:20:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 22:20:55,462 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2022-12-13 22:20:55,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 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-12-13 22:20:55,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:55,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2022-12-13 22:20:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:55,752 INFO L130 PetriNetUnfolder]: 1616/2402 cut-off events. [2022-12-13 22:20:55,752 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 22:20:55,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 2402 events. 1616/2402 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11537 event pairs, 1616 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 4815. Up to 2368 conditions per place. [2022-12-13 22:20:55,768 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-12-13 22:20:55,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2022-12-13 22:20:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 22:20:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 22:20:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 262 transitions. [2022-12-13 22:20:55,779 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5097276264591439 [2022-12-13 22:20:55,780 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 262 transitions. [2022-12-13 22:20:55,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 262 transitions. [2022-12-13 22:20:55,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:55,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 262 transitions. [2022-12-13 22:20:55,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 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-12-13 22:20:55,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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-12-13 22:20:55,791 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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-12-13 22:20:55,792 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 262 transitions. [2022-12-13 22:20:55,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2022-12-13 22:20:55,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:20:55,796 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-12-13 22:20:55,798 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-13 22:20:55,800 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-12-13 22:20:55,800 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-12-13 22:20:55,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 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-12-13 22:20:55,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:55,801 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 22:20:55,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:20:55,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash 547026, now seen corresponding path program 1 times [2022-12-13 22:20:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:55,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978640511] [2022-12-13 22:20:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:56,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978640511] [2022-12-13 22:20:56,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978640511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:56,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:56,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:20:56,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180871168] [2022-12-13 22:20:56,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:20:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:20:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:20:56,041 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2022-12-13 22:20:56,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-12-13 22:20:56,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:56,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2022-12-13 22:20:56,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:56,314 INFO L130 PetriNetUnfolder]: 1263/1905 cut-off events. [2022-12-13 22:20:56,314 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:20:56,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 1905 events. 1263/1905 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8951 event pairs, 562 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 3811. Up to 1510 conditions per place. [2022-12-13 22:20:56,321 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-12-13 22:20:56,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2022-12-13 22:20:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:20:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:20:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-12-13 22:20:56,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4993514915693904 [2022-12-13 22:20:56,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-12-13 22:20:56,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-12-13 22:20:56,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:56,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-12-13 22:20:56,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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-12-13 22:20:56,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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-12-13 22:20:56,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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-12-13 22:20:56,329 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 385 transitions. [2022-12-13 22:20:56,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2022-12-13 22:20:56,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:20:56,330 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-12-13 22:20:56,330 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-13 22:20:56,331 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-12-13 22:20:56,331 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-12-13 22:20:56,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-12-13 22:20:56,331 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:56,331 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:56,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:20:56,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1764835552, now seen corresponding path program 1 times [2022-12-13 22:20:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:56,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550138119] [2022-12-13 22:20:56,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:56,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:56,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550138119] [2022-12-13 22:20:56,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550138119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:56,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:56,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:20:56,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215307739] [2022-12-13 22:20:56,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:56,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:20:56,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:56,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:20:56,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:20:56,546 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2022-12-13 22:20:56,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-12-13 22:20:56,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:56,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2022-12-13 22:20:56,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:57,000 INFO L130 PetriNetUnfolder]: 3349/4940 cut-off events. [2022-12-13 22:20:57,000 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-13 22:20:57,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10217 conditions, 4940 events. 3349/4940 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 25307 event pairs, 1101 based on Foata normal form. 0/4800 useless extension candidates. Maximal degree in co-relation 10213. Up to 3018 conditions per place. [2022-12-13 22:20:57,025 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 36 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-13 22:20:57,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 186 flow [2022-12-13 22:20:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:20:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:20:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2022-12-13 22:20:57,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4773022049286641 [2022-12-13 22:20:57,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2022-12-13 22:20:57,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2022-12-13 22:20:57,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:57,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2022-12-13 22:20:57,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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-12-13 22:20:57,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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-12-13 22:20:57,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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-12-13 22:20:57,031 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 3 states and 368 transitions. [2022-12-13 22:20:57,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 186 flow [2022-12-13 22:20:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:20:57,033 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 108 flow [2022-12-13 22:20:57,033 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 22:20:57,033 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2022-12-13 22:20:57,033 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 108 flow [2022-12-13 22:20:57,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-12-13 22:20:57,034 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:57,034 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:57,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:20:57,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1124671047, now seen corresponding path program 1 times [2022-12-13 22:20:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:57,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422569539] [2022-12-13 22:20:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:57,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:57,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422569539] [2022-12-13 22:20:57,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422569539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:57,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:57,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:20:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200545726] [2022-12-13 22:20:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:57,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:57,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:57,152 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2022-12-13 22:20:57,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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-12-13 22:20:57,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:57,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2022-12-13 22:20:57,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:57,649 INFO L130 PetriNetUnfolder]: 3213/4740 cut-off events. [2022-12-13 22:20:57,649 INFO L131 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2022-12-13 22:20:57,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11985 conditions, 4740 events. 3213/4740 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23210 event pairs, 851 based on Foata normal form. 40/4780 useless extension candidates. Maximal degree in co-relation 11980. Up to 2178 conditions per place. [2022-12-13 22:20:57,668 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2022-12-13 22:20:57,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 290 flow [2022-12-13 22:20:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:20:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:20:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2022-12-13 22:20:57,680 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4708171206225681 [2022-12-13 22:20:57,680 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2022-12-13 22:20:57,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2022-12-13 22:20:57,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:57,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2022-12-13 22:20:57,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:57,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 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-12-13 22:20:57,683 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 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-12-13 22:20:57,683 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 108 flow. Second operand 4 states and 484 transitions. [2022-12-13 22:20:57,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 290 flow [2022-12-13 22:20:57,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:20:57,690 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 152 flow [2022-12-13 22:20:57,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2022-12-13 22:20:57,690 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-13 22:20:57,691 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 152 flow [2022-12-13 22:20:57,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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-12-13 22:20:57,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:57,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:57,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:20:57,691 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1124673396, now seen corresponding path program 1 times [2022-12-13 22:20:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:57,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372555565] [2022-12-13 22:20:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:57,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372555565] [2022-12-13 22:20:57,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372555565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:57,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:57,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168746355] [2022-12-13 22:20:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:57,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:20:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:57,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:20:57,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:20:58,075 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 257 [2022-12-13 22:20:58,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 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-12-13 22:20:58,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:58,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 257 [2022-12-13 22:20:58,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:58,529 INFO L130 PetriNetUnfolder]: 2015/3124 cut-off events. [2022-12-13 22:20:58,529 INFO L131 PetriNetUnfolder]: For 2202/2318 co-relation queries the response was YES. [2022-12-13 22:20:58,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8289 conditions, 3124 events. 2015/3124 cut-off events. For 2202/2318 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16743 event pairs, 521 based on Foata normal form. 245/3275 useless extension candidates. Maximal degree in co-relation 8282. Up to 2045 conditions per place. [2022-12-13 22:20:58,541 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 28 selfloop transitions, 3 changer transitions 16/55 dead transitions. [2022-12-13 22:20:58,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 312 flow [2022-12-13 22:20:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:20:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:20:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2022-12-13 22:20:58,544 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42282749675745784 [2022-12-13 22:20:58,544 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 652 transitions. [2022-12-13 22:20:58,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 652 transitions. [2022-12-13 22:20:58,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:58,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 652 transitions. [2022-12-13 22:20:58,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 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-12-13 22:20:58,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 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-12-13 22:20:58,550 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 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-12-13 22:20:58,550 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 152 flow. Second operand 6 states and 652 transitions. [2022-12-13 22:20:58,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 312 flow [2022-12-13 22:20:58,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:20:58,558 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 135 flow [2022-12-13 22:20:58,559 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 22:20:58,559 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-13 22:20:58,559 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 135 flow [2022-12-13 22:20:58,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 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-12-13 22:20:58,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:58,560 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:58,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:20:58,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1556145750, now seen corresponding path program 1 times [2022-12-13 22:20:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:58,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922985612] [2022-12-13 22:20:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:58,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922985612] [2022-12-13 22:20:58,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922985612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:58,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:58,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:20:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926425740] [2022-12-13 22:20:58,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:58,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:58,689 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-12-13 22:20:58,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 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-12-13 22:20:58,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:58,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-12-13 22:20:58,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:58,977 INFO L130 PetriNetUnfolder]: 1055/1800 cut-off events. [2022-12-13 22:20:58,977 INFO L131 PetriNetUnfolder]: For 831/855 co-relation queries the response was YES. [2022-12-13 22:20:58,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 1800 events. 1055/1800 cut-off events. For 831/855 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9973 event pairs, 190 based on Foata normal form. 190/1957 useless extension candidates. Maximal degree in co-relation 4382. Up to 1004 conditions per place. [2022-12-13 22:20:58,983 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2022-12-13 22:20:58,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 423 flow [2022-12-13 22:20:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:20:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-12-13 22:20:58,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4754863813229572 [2022-12-13 22:20:58,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2022-12-13 22:20:58,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2022-12-13 22:20:58,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:58,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2022-12-13 22:20:58,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 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-12-13 22:20:58,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 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-12-13 22:20:58,987 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 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-12-13 22:20:58,987 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 135 flow. Second operand 5 states and 611 transitions. [2022-12-13 22:20:58,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 423 flow [2022-12-13 22:20:58,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 74 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:20:58,989 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 190 flow [2022-12-13 22:20:58,989 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-13 22:20:58,990 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-13 22:20:58,990 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 190 flow [2022-12-13 22:20:58,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 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-12-13 22:20:58,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:58,990 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:58,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:20:58,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash -67543650, now seen corresponding path program 1 times [2022-12-13 22:20:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:58,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024766753] [2022-12-13 22:20:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:59,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:59,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024766753] [2022-12-13 22:20:59,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024766753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:59,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:59,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:20:59,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530579414] [2022-12-13 22:20:59,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:59,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:59,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:59,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2022-12-13 22:20:59,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 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-12-13 22:20:59,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:59,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2022-12-13 22:20:59,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:59,387 INFO L130 PetriNetUnfolder]: 1397/2257 cut-off events. [2022-12-13 22:20:59,387 INFO L131 PetriNetUnfolder]: For 2594/2594 co-relation queries the response was YES. [2022-12-13 22:20:59,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7565 conditions, 2257 events. 1397/2257 cut-off events. For 2594/2594 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11381 event pairs, 300 based on Foata normal form. 2/2259 useless extension candidates. Maximal degree in co-relation 7554. Up to 1463 conditions per place. [2022-12-13 22:20:59,393 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 49 selfloop transitions, 13 changer transitions 10/72 dead transitions. [2022-12-13 22:20:59,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 491 flow [2022-12-13 22:20:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:20:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:20:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2022-12-13 22:20:59,395 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4708171206225681 [2022-12-13 22:20:59,395 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2022-12-13 22:20:59,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2022-12-13 22:20:59,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:59,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2022-12-13 22:20:59,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:59,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 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-12-13 22:20:59,397 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 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-12-13 22:20:59,397 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 190 flow. Second operand 4 states and 484 transitions. [2022-12-13 22:20:59,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 491 flow [2022-12-13 22:20:59,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:20:59,401 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 234 flow [2022-12-13 22:20:59,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 22:20:59,402 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2022-12-13 22:20:59,402 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 234 flow [2022-12-13 22:20:59,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 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-12-13 22:20:59,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:59,402 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:59,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:20:59,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash 545460419, now seen corresponding path program 1 times [2022-12-13 22:20:59,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:59,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915727877] [2022-12-13 22:20:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:59,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:59,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915727877] [2022-12-13 22:20:59,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915727877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:59,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:59,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:20:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756050995] [2022-12-13 22:20:59,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:59,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:59,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2022-12-13 22:20:59,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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-12-13 22:20:59,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:59,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2022-12-13 22:20:59,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:20:59,780 INFO L130 PetriNetUnfolder]: 1195/1994 cut-off events. [2022-12-13 22:20:59,780 INFO L131 PetriNetUnfolder]: For 3093/3093 co-relation queries the response was YES. [2022-12-13 22:20:59,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6898 conditions, 1994 events. 1195/1994 cut-off events. For 3093/3093 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10025 event pairs, 389 based on Foata normal form. 36/2030 useless extension candidates. Maximal degree in co-relation 6885. Up to 1091 conditions per place. [2022-12-13 22:20:59,785 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 46 selfloop transitions, 9 changer transitions 5/60 dead transitions. [2022-12-13 22:20:59,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 441 flow [2022-12-13 22:20:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:20:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:20:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2022-12-13 22:20:59,787 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4659533073929961 [2022-12-13 22:20:59,787 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2022-12-13 22:20:59,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2022-12-13 22:20:59,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:20:59,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2022-12-13 22:20:59,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 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-12-13 22:20:59,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 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-12-13 22:20:59,789 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 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-12-13 22:20:59,789 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 234 flow. Second operand 4 states and 479 transitions. [2022-12-13 22:20:59,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 441 flow [2022-12-13 22:20:59,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 435 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 22:20:59,795 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 238 flow [2022-12-13 22:20:59,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-13 22:20:59,796 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-13 22:20:59,796 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 238 flow [2022-12-13 22:20:59,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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-12-13 22:20:59,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:20:59,796 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:59,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:20:59,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:20:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2124987066, now seen corresponding path program 1 times [2022-12-13 22:20:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:59,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704534913] [2022-12-13 22:20:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:59,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:59,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704534913] [2022-12-13 22:20:59,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704534913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:59,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:59,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472249618] [2022-12-13 22:20:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:59,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:59,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:59,919 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 257 [2022-12-13 22:20:59,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:59,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:20:59,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 257 [2022-12-13 22:20:59,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:00,269 INFO L130 PetriNetUnfolder]: 1427/2439 cut-off events. [2022-12-13 22:21:00,270 INFO L131 PetriNetUnfolder]: For 4734/4734 co-relation queries the response was YES. [2022-12-13 22:21:00,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8287 conditions, 2439 events. 1427/2439 cut-off events. For 4734/4734 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13698 event pairs, 147 based on Foata normal form. 36/2475 useless extension candidates. Maximal degree in co-relation 8273. Up to 959 conditions per place. [2022-12-13 22:21:00,274 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 61 selfloop transitions, 15 changer transitions 8/84 dead transitions. [2022-12-13 22:21:00,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 629 flow [2022-12-13 22:21:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:21:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:21:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions. [2022-12-13 22:21:00,276 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45590142671854733 [2022-12-13 22:21:00,276 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 703 transitions. [2022-12-13 22:21:00,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions. [2022-12-13 22:21:00,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:00,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions. [2022-12-13 22:21:00,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 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-12-13 22:21:00,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 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-12-13 22:21:00,279 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 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-12-13 22:21:00,279 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 238 flow. Second operand 6 states and 703 transitions. [2022-12-13 22:21:00,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 629 flow [2022-12-13 22:21:00,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 583 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 22:21:00,283 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 288 flow [2022-12-13 22:21:00,284 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2022-12-13 22:21:00,284 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-13 22:21:00,284 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 288 flow [2022-12-13 22:21:00,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:00,284 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:00,285 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:00,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:21:00,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2040073148, now seen corresponding path program 2 times [2022-12-13 22:21:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792317359] [2022-12-13 22:21:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:00,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:00,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792317359] [2022-12-13 22:21:00,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792317359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:00,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:00,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:21:00,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14045727] [2022-12-13 22:21:00,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:00,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:21:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:21:00,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:21:00,390 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-12-13 22:21:00,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 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-12-13 22:21:00,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:00,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-12-13 22:21:00,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:00,662 INFO L130 PetriNetUnfolder]: 787/1513 cut-off events. [2022-12-13 22:21:00,663 INFO L131 PetriNetUnfolder]: For 1558/1577 co-relation queries the response was YES. [2022-12-13 22:21:00,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4858 conditions, 1513 events. 787/1513 cut-off events. For 1558/1577 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9137 event pairs, 140 based on Foata normal form. 199/1693 useless extension candidates. Maximal degree in co-relation 4842. Up to 623 conditions per place. [2022-12-13 22:21:00,666 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 51 selfloop transitions, 8 changer transitions 33/100 dead transitions. [2022-12-13 22:21:00,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 100 transitions, 814 flow [2022-12-13 22:21:00,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:21:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:21:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2022-12-13 22:21:00,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47600518806744485 [2022-12-13 22:21:00,668 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2022-12-13 22:21:00,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2022-12-13 22:21:00,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:00,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2022-12-13 22:21:00,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:00,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 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-12-13 22:21:00,671 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 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-12-13 22:21:00,671 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 288 flow. Second operand 6 states and 734 transitions. [2022-12-13 22:21:00,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 100 transitions, 814 flow [2022-12-13 22:21:00,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 798 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 22:21:00,675 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 302 flow [2022-12-13 22:21:00,675 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2022-12-13 22:21:00,675 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-12-13 22:21:00,675 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 302 flow [2022-12-13 22:21:00,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 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-12-13 22:21:00,676 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:00,676 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:00,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:21:00,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1134892799, now seen corresponding path program 1 times [2022-12-13 22:21:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826342335] [2022-12-13 22:21:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:00,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826342335] [2022-12-13 22:21:00,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826342335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:00,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:00,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:21:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998767183] [2022-12-13 22:21:00,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:00,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:21:00,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:21:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:21:00,825 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-12-13 22:21:00,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 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-12-13 22:21:00,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:00,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-12-13 22:21:00,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:01,074 INFO L130 PetriNetUnfolder]: 554/1100 cut-off events. [2022-12-13 22:21:01,074 INFO L131 PetriNetUnfolder]: For 1930/1946 co-relation queries the response was YES. [2022-12-13 22:21:01,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4109 conditions, 1100 events. 554/1100 cut-off events. For 1930/1946 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6389 event pairs, 121 based on Foata normal form. 53/1139 useless extension candidates. Maximal degree in co-relation 4090. Up to 423 conditions per place. [2022-12-13 22:21:01,078 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 32 selfloop transitions, 10 changer transitions 47/92 dead transitions. [2022-12-13 22:21:01,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 776 flow [2022-12-13 22:21:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 22:21:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 22:21:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 954 transitions. [2022-12-13 22:21:01,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46400778210116733 [2022-12-13 22:21:01,081 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 954 transitions. [2022-12-13 22:21:01,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 954 transitions. [2022-12-13 22:21:01,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:01,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 954 transitions. [2022-12-13 22:21:01,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.25) internal successors, (954), 8 states have internal predecessors, (954), 0 states have call successors, (0), 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-12-13 22:21:01,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 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-12-13 22:21:01,087 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 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-12-13 22:21:01,087 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 302 flow. Second operand 8 states and 954 transitions. [2022-12-13 22:21:01,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 776 flow [2022-12-13 22:21:01,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 746 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 22:21:01,106 INFO L231 Difference]: Finished difference. Result has 66 places, 28 transitions, 186 flow [2022-12-13 22:21:01,106 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=28} [2022-12-13 22:21:01,107 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2022-12-13 22:21:01,107 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 28 transitions, 186 flow [2022-12-13 22:21:01,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 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-12-13 22:21:01,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:01,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:01,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:21:01,108 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash -935339749, now seen corresponding path program 1 times [2022-12-13 22:21:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:01,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739252263] [2022-12-13 22:21:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:01,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:01,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739252263] [2022-12-13 22:21:01,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739252263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:01,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:01,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:21:01,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994420616] [2022-12-13 22:21:01,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:01,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:21:01,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:01,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:21:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:21:01,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2022-12-13 22:21:01,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 28 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 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-12-13 22:21:01,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:01,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2022-12-13 22:21:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:01,822 INFO L130 PetriNetUnfolder]: 120/256 cut-off events. [2022-12-13 22:21:01,822 INFO L131 PetriNetUnfolder]: For 455/460 co-relation queries the response was YES. [2022-12-13 22:21:01,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 256 events. 120/256 cut-off events. For 455/460 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 987 event pairs, 7 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 914. Up to 139 conditions per place. [2022-12-13 22:21:01,823 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 31 selfloop transitions, 4 changer transitions 20/58 dead transitions. [2022-12-13 22:21:01,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 481 flow [2022-12-13 22:21:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:21:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:21:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2022-12-13 22:21:01,825 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45136186770428016 [2022-12-13 22:21:01,825 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2022-12-13 22:21:01,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2022-12-13 22:21:01,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:01,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2022-12-13 22:21:01,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 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-12-13 22:21:01,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 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-12-13 22:21:01,828 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 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-12-13 22:21:01,828 INFO L175 Difference]: Start difference. First operand has 66 places, 28 transitions, 186 flow. Second operand 7 states and 812 transitions. [2022-12-13 22:21:01,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 481 flow [2022-12-13 22:21:01,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 352 flow, removed 38 selfloop flow, removed 16 redundant places. [2022-12-13 22:21:01,830 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 128 flow [2022-12-13 22:21:01,830 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2022-12-13 22:21:01,830 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-13 22:21:01,831 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 128 flow [2022-12-13 22:21:01,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 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-12-13 22:21:01,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:01,831 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:01,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:21:01,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1296150081, now seen corresponding path program 2 times [2022-12-13 22:21:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:01,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744514468] [2022-12-13 22:21:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:21:01,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:21:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:21:01,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:21:01,911 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:21:01,912 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 22:21:01,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 22:21:01,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 22:21:01,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 22:21:01,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 22:21:01,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 22:21:01,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:21:01,915 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:01,920 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:21:01,920 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:21:01,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:21:01 BasicIcfg [2022-12-13 22:21:01,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:21:01,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:21:01,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:21:01,967 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:21:01,968 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:52" (3/4) ... [2022-12-13 22:21:01,970 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 22:21:01,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:21:01,971 INFO L158 Benchmark]: Toolchain (without parser) took 10711.54ms. Allocated memory was 123.7MB in the beginning and 339.7MB in the end (delta: 216.0MB). Free memory was 86.2MB in the beginning and 164.3MB in the end (delta: -78.2MB). Peak memory consumption was 139.2MB. Max. memory is 16.1GB. [2022-12-13 22:21:01,971 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:21:01,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.21ms. Allocated memory is still 123.7MB. Free memory was 86.2MB in the beginning and 59.3MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 22:21:01,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.67ms. Allocated memory was 123.7MB in the beginning and 182.5MB in the end (delta: 58.7MB). Free memory was 59.3MB in the beginning and 151.6MB in the end (delta: -92.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-12-13 22:21:01,972 INFO L158 Benchmark]: Boogie Preprocessor took 20.05ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:21:01,972 INFO L158 Benchmark]: RCFGBuilder took 551.70ms. Allocated memory is still 182.5MB. Free memory was 149.5MB in the beginning and 114.9MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-12-13 22:21:01,973 INFO L158 Benchmark]: TraceAbstraction took 9728.55ms. Allocated memory was 182.5MB in the beginning and 339.7MB in the end (delta: 157.3MB). Free memory was 113.9MB in the beginning and 165.4MB in the end (delta: -51.5MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2022-12-13 22:21:01,973 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 339.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:21:01,975 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.13ms. Allocated memory is still 123.7MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.21ms. Allocated memory is still 123.7MB. Free memory was 86.2MB in the beginning and 59.3MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.67ms. Allocated memory was 123.7MB in the beginning and 182.5MB in the end (delta: 58.7MB). Free memory was 59.3MB in the beginning and 151.6MB in the end (delta: -92.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.05ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 551.70ms. Allocated memory is still 182.5MB. Free memory was 149.5MB in the beginning and 114.9MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9728.55ms. Allocated memory was 182.5MB in the beginning and 339.7MB in the end (delta: 157.3MB). Free memory was 113.9MB in the beginning and 165.4MB in the end (delta: -51.5MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 339.7MB. Free memory is still 164.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: 2.9s, 134 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 33 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 128 TotalNumberOfCompositions, 6455 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2930, independent: 2760, independent conditional: 0, independent unconditional: 2760, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1396, independent: 1351, independent conditional: 0, independent unconditional: 1351, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2930, independent: 1409, independent conditional: 0, independent unconditional: 1409, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1396, unknown conditional: 0, unknown unconditional: 1396] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-1, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=0, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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 7 procedures, 158 locations, 13 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: 9.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 483 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1388 IncrementalHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 74 mSDtfsCounter, 1388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=10, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-12-13 22:21:01,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8 --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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- 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-2329fc7 [2022-12-13 22:21:03,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:21:03,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:21:03,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:21:03,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:21:03,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:21:03,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:21:03,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:21:03,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:21:03,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:21:03,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:21:03,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:21:03,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:21:03,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:21:03,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:21:03,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:21:03,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:21:03,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:21:03,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:21:03,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:21:03,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:21:03,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:21:03,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:21:03,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:21:03,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:21:03,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:21:03,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:21:03,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:21:03,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:21:03,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:21:03,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:21:03,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:21:03,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:21:03,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:21:03,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:21:03,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:21:03,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:21:03,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:21:03,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:21:03,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:21:03,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:21:03,664 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 22:21:03,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:21:03,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:21:03,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:21:03,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:21:03,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:21:03,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:21:03,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:21:03,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:21:03,689 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:21:03,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:21:03,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:21:03,689 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:21:03,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:21:03,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:21:03,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:21:03,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 22:21:03,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 22:21:03,690 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 22:21:03,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:21:03,690 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 22:21:03,691 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 22:21:03,691 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 22:21:03,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:21:03,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:21:03,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:21:03,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:21:03,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:21:03,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:21:03,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:21:03,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:21:03,693 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 22:21:03,693 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 22:21:03,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:21:03,693 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:21:03,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:21:03,693 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 22:21:03,694 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:21:03,694 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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2022-12-13 22:21:03,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:21:03,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:21:03,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:21:03,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:21:03,967 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:21:03,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:21:06,511 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:21:06,726 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:21:06,727 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:21:06,740 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data/61bf64ae3/afb8b1e971904ea3bfde590420388e8c/FLAG99df6cb07 [2022-12-13 22:21:06,752 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/data/61bf64ae3/afb8b1e971904ea3bfde590420388e8c [2022-12-13 22:21:06,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:21:06,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:21:06,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:21:06,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:21:06,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:21:06,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:21:06" (1/1) ... [2022-12-13 22:21:06,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ffe5643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:06, skipping insertion in model container [2022-12-13 22:21:06,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:21:06" (1/1) ... [2022-12-13 22:21:06,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:21:06,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:21:06,936 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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:21:07,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:21:07,138 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:21:07,154 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_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:21:07,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:21:07,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:21:07,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:21:07,206 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:21:07,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07 WrapperNode [2022-12-13 22:21:07,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:21:07,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:21:07,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:21:07,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:21:07,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,240 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-13 22:21:07,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:21:07,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:21:07,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:21:07,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:21:07,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,258 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:21:07,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:21:07,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:21:07,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:21:07,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (1/1) ... [2022-12-13 22:21:07,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:21:07,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:21:07,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:21:07,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:21:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:21:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:21:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:21:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:21:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 22:21:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 22:21:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:21:07,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:21:07,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:21:07,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:21:07,320 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 22:21:07,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 22:21:07,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:21:07,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:21:07,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:21:07,322 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 22:21:07,452 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:21:07,454 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:21:07,732 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:21:07,878 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:21:07,878 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:21:07,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:21:07 BoogieIcfgContainer [2022-12-13 22:21:07,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:21:07,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:21:07,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:21:07,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:21:07,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:21:06" (1/3) ... [2022-12-13 22:21:07,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74125b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:21:07, skipping insertion in model container [2022-12-13 22:21:07,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:07" (2/3) ... [2022-12-13 22:21:07,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74125b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:21:07, skipping insertion in model container [2022-12-13 22:21:07,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:21:07" (3/3) ... [2022-12-13 22:21:07,889 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:21:07,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:21:07,909 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 22:21:07,909 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:21:07,972 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:21:08,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-12-13 22:21:08,064 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 22:21:08,064 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:21:08,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 22:21:08,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 130 transitions, 275 flow [2022-12-13 22:21:08,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 127 transitions, 263 flow [2022-12-13 22:21:08,077 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:21:08,087 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 127 transitions, 263 flow [2022-12-13 22:21:08,090 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 127 transitions, 263 flow [2022-12-13 22:21:08,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 263 flow [2022-12-13 22:21:08,114 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 22:21:08,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:21:08,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 22:21:08,116 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-12-13 22:21:13,927 INFO L134 LiptonReduction]: Checked pairs total: 7064 [2022-12-13 22:21:13,927 INFO L136 LiptonReduction]: Total number of compositions: 126 [2022-12-13 22:21:13,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:21:13,941 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;@3809c7e7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:21:13,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 22:21:13,942 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 22:21:13,942 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:21:13,943 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:13,943 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 22:21:13,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2022-12-13 22:21:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:13,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811970851] [2022-12-13 22:21:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:13,956 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-12-13 22:21:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:13,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:13,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:14,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 22:21:14,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:14,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:14,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:14,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811970851] [2022-12-13 22:21:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811970851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:14,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:14,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 22:21:14,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893323257] [2022-12-13 22:21:14,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:14,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 22:21:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:14,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 22:21:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 22:21:14,053 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 256 [2022-12-13 22:21:14,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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-12-13 22:21:14,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:14,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 256 [2022-12-13 22:21:14,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:14,491 INFO L130 PetriNetUnfolder]: 1616/2402 cut-off events. [2022-12-13 22:21:14,492 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 22:21:14,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 2402 events. 1616/2402 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11602 event pairs, 1616 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 4815. Up to 2368 conditions per place. [2022-12-13 22:21:14,508 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-12-13 22:21:14,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2022-12-13 22:21:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 22:21:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 22:21:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 264 transitions. [2022-12-13 22:21:14,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-13 22:21:14,521 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 264 transitions. [2022-12-13 22:21:14,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 264 transitions. [2022-12-13 22:21:14,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:14,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 264 transitions. [2022-12-13 22:21:14,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:14,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 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-12-13 22:21:14,533 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 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-12-13 22:21:14,535 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 264 transitions. [2022-12-13 22:21:14,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2022-12-13 22:21:14,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:21:14,540 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-12-13 22:21:14,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-13 22:21:14,545 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-12-13 22:21:14,545 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-12-13 22:21:14,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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-12-13 22:21:14,545 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:14,545 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 22:21:14,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:14,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:14,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 548051, now seen corresponding path program 1 times [2022-12-13 22:21:14,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:14,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387339245] [2022-12-13 22:21:14,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:14,750 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-12-13 22:21:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:14,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:14,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:14,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:21:14,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:14,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-12-13 22:21:14,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:14,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:14,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387339245] [2022-12-13 22:21:14,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387339245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:14,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:14,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:21:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70809040] [2022-12-13 22:21:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:14,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:14,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:14,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:14,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-12-13 22:21:14,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-12-13 22:21:14,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:14,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-12-13 22:21:14,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:15,275 INFO L130 PetriNetUnfolder]: 1263/2021 cut-off events. [2022-12-13 22:21:15,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:21:15,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 2021 events. 1263/2021 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11315 event pairs, 204 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 3927. Up to 1510 conditions per place. [2022-12-13 22:21:15,285 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-12-13 22:21:15,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2022-12-13 22:21:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-12-13 22:21:15,288 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2022-12-13 22:21:15,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-12-13 22:21:15,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-12-13 22:21:15,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:15,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-12-13 22:21:15,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-12-13 22:21:15,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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-12-13 22:21:15,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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-12-13 22:21:15,293 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 388 transitions. [2022-12-13 22:21:15,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2022-12-13 22:21:15,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:21:15,295 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-12-13 22:21:15,295 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-13 22:21:15,296 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-12-13 22:21:15,296 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-12-13 22:21:15,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-12-13 22:21:15,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:15,296 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:15,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:15,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:15,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1945070644, now seen corresponding path program 1 times [2022-12-13 22:21:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:15,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797722435] [2022-12-13 22:21:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:15,499 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-12-13 22:21:15,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:15,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:15,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:15,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:21:15,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:15,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:15,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:15,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797722435] [2022-12-13 22:21:15,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797722435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:15,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:15,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:21:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668127633] [2022-12-13 22:21:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:15,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:21:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:15,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:21:15,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:21:15,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-12-13 22:21:15,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 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-12-13 22:21:15,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:15,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-12-13 22:21:15,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:15,883 INFO L130 PetriNetUnfolder]: 679/1122 cut-off events. [2022-12-13 22:21:15,888 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 22:21:15,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2359 conditions, 1122 events. 679/1122 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5568 event pairs, 145 based on Foata normal form. 80/1152 useless extension candidates. Maximal degree in co-relation 2355. Up to 601 conditions per place. [2022-12-13 22:21:15,893 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 40 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2022-12-13 22:21:15,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 208 flow [2022-12-13 22:21:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:21:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:21:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-12-13 22:21:15,895 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2022-12-13 22:21:15,895 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2022-12-13 22:21:15,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2022-12-13 22:21:15,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:15,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2022-12-13 22:21:15,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 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-12-13 22:21:15,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 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-12-13 22:21:15,899 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 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-12-13 22:21:15,899 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 4 states and 492 transitions. [2022-12-13 22:21:15,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 208 flow [2022-12-13 22:21:15,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:21:15,900 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 88 flow [2022-12-13 22:21:15,900 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-13 22:21:15,900 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2022-12-13 22:21:15,900 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 88 flow [2022-12-13 22:21:15,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 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-12-13 22:21:15,901 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:15,901 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:15,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 22:21:16,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:16,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash 385582947, now seen corresponding path program 1 times [2022-12-13 22:21:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:16,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608747721] [2022-12-13 22:21:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:16,102 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-12-13 22:21:16,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:16,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:16,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:16,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 22:21:16,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:16,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:16,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:16,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608747721] [2022-12-13 22:21:16,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608747721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:16,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:16,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:21:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039402263] [2022-12-13 22:21:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:16,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:21:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:21:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:21:16,235 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-12-13 22:21:16,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 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-12-13 22:21:16,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:16,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-12-13 22:21:16,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:16,435 INFO L130 PetriNetUnfolder]: 274/507 cut-off events. [2022-12-13 22:21:16,436 INFO L131 PetriNetUnfolder]: For 169/169 co-relation queries the response was YES. [2022-12-13 22:21:16,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 507 events. 274/507 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2221 event pairs, 68 based on Foata normal form. 44/535 useless extension candidates. Maximal degree in co-relation 1313. Up to 194 conditions per place. [2022-12-13 22:21:16,438 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 49 selfloop transitions, 8 changer transitions 1/61 dead transitions. [2022-12-13 22:21:16,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 293 flow [2022-12-13 22:21:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:21:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:21:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-12-13 22:21:16,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2022-12-13 22:21:16,440 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 615 transitions. [2022-12-13 22:21:16,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 615 transitions. [2022-12-13 22:21:16,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:16,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 615 transitions. [2022-12-13 22:21:16,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 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-12-13 22:21:16,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 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-12-13 22:21:16,444 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 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-12-13 22:21:16,444 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 88 flow. Second operand 5 states and 615 transitions. [2022-12-13 22:21:16,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 61 transitions, 293 flow [2022-12-13 22:21:16,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 283 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 22:21:16,445 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 128 flow [2022-12-13 22:21:16,445 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-13 22:21:16,446 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2022-12-13 22:21:16,446 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 128 flow [2022-12-13 22:21:16,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 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-12-13 22:21:16,446 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:16,446 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:16,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 22:21:16,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:16,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:16,648 INFO L85 PathProgramCache]: Analyzing trace with hash 641346900, now seen corresponding path program 1 times [2022-12-13 22:21:16,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:16,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573155829] [2022-12-13 22:21:16,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:16,649 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-12-13 22:21:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:16,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:16,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:16,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 22:21:16,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:16,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:16,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573155829] [2022-12-13 22:21:16,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573155829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:16,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:16,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:21:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403880569] [2022-12-13 22:21:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:16,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:21:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:21:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:21:16,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-12-13 22:21:16,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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-12-13 22:21:16,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:16,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-12-13 22:21:16,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:17,048 INFO L130 PetriNetUnfolder]: 168/318 cut-off events. [2022-12-13 22:21:17,048 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-12-13 22:21:17,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 318 events. 168/318 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1250 event pairs, 68 based on Foata normal form. 11/323 useless extension candidates. Maximal degree in co-relation 917. Up to 129 conditions per place. [2022-12-13 22:21:17,049 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 36 selfloop transitions, 11 changer transitions 1/51 dead transitions. [2022-12-13 22:21:17,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 276 flow [2022-12-13 22:21:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:21:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:21:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 716 transitions. [2022-12-13 22:21:17,051 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4661458333333333 [2022-12-13 22:21:17,051 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 716 transitions. [2022-12-13 22:21:17,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 716 transitions. [2022-12-13 22:21:17,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:17,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 716 transitions. [2022-12-13 22:21:17,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 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-12-13 22:21:17,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 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-12-13 22:21:17,055 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 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-12-13 22:21:17,055 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 128 flow. Second operand 6 states and 716 transitions. [2022-12-13 22:21:17,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 276 flow [2022-12-13 22:21:17,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 251 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 22:21:17,058 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 142 flow [2022-12-13 22:21:17,058 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 22:21:17,059 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 22:21:17,059 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 142 flow [2022-12-13 22:21:17,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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-12-13 22:21:17,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:17,060 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:17,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 22:21:17,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:17,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2135994578, now seen corresponding path program 1 times [2022-12-13 22:21:17,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:17,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103235939] [2022-12-13 22:21:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:17,262 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-12-13 22:21:17,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:17,263 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:17,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:17,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 22:21:17,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:17,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:17,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:17,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103235939] [2022-12-13 22:21:17,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103235939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:17,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:17,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:21:17,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520324342] [2022-12-13 22:21:17,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:17,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:21:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:17,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:21:17,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:21:17,576 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-12-13 22:21:17,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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-12-13 22:21:17,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:17,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-12-13 22:21:17,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:17,829 INFO L130 PetriNetUnfolder]: 181/349 cut-off events. [2022-12-13 22:21:17,829 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-13 22:21:17,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 349 events. 181/349 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1371 event pairs, 22 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 1046. Up to 147 conditions per place. [2022-12-13 22:21:17,831 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 63 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2022-12-13 22:21:17,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 492 flow [2022-12-13 22:21:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:21:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:21:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-12-13 22:21:17,833 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46372767857142855 [2022-12-13 22:21:17,833 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-12-13 22:21:17,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-12-13 22:21:17,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:17,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-12-13 22:21:17,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 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-12-13 22:21:17,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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-12-13 22:21:17,837 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 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-12-13 22:21:17,837 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 142 flow. Second operand 7 states and 831 transitions. [2022-12-13 22:21:17,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 492 flow [2022-12-13 22:21:17,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 346 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-12-13 22:21:17,839 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 108 flow [2022-12-13 22:21:17,839 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 22:21:17,840 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-13 22:21:17,840 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 108 flow [2022-12-13 22:21:17,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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-12-13 22:21:17,840 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:17,840 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:17,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 22:21:18,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:18,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1186804402, now seen corresponding path program 2 times [2022-12-13 22:21:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:18,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090089602] [2022-12-13 22:21:18,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 22:21:18,044 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-12-13 22:21:18,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:18,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:18,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:18,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 22:21:18,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:21:18,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 22:21:18,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:18,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:18,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:18,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090089602] [2022-12-13 22:21:18,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090089602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:18,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:18,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:21:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648774106] [2022-12-13 22:21:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:18,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:21:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:21:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:21:18,239 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-12-13 22:21:18,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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-12-13 22:21:18,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:18,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-12-13 22:21:18,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:18,413 INFO L130 PetriNetUnfolder]: 304/587 cut-off events. [2022-12-13 22:21:18,413 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-13 22:21:18,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 587 events. 304/587 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2683 event pairs, 92 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 1515. Up to 250 conditions per place. [2022-12-13 22:21:18,415 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 57 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 22:21:18,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 331 flow [2022-12-13 22:21:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:21:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:21:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-12-13 22:21:18,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.482421875 [2022-12-13 22:21:18,416 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2022-12-13 22:21:18,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2022-12-13 22:21:18,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:18,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2022-12-13 22:21:18,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 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-12-13 22:21:18,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 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-12-13 22:21:18,418 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 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-12-13 22:21:18,418 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 108 flow. Second operand 4 states and 494 transitions. [2022-12-13 22:21:18,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 331 flow [2022-12-13 22:21:18,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:21:18,420 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 115 flow [2022-12-13 22:21:18,420 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-13 22:21:18,420 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-13 22:21:18,420 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 115 flow [2022-12-13 22:21:18,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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-12-13 22:21:18,421 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:18,421 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:18,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 22:21:18,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:18,622 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash 701848894, now seen corresponding path program 3 times [2022-12-13 22:21:18,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:18,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440523003] [2022-12-13 22:21:18,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 22:21:18,626 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-12-13 22:21:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:18,629 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:18,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 22:21:18,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 22:21:18,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:21:18,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:21:18,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:18,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:18,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:21:18,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440523003] [2022-12-13 22:21:18,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440523003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:18,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:18,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:21:18,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114359958] [2022-12-13 22:21:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:18,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:21:18,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:18,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:18,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 256 [2022-12-13 22:21:18,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 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-12-13 22:21:18,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:18,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 256 [2022-12-13 22:21:18,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:19,019 INFO L130 PetriNetUnfolder]: 468/921 cut-off events. [2022-12-13 22:21:19,019 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-13 22:21:19,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 921 events. 468/921 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5037 event pairs, 182 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 2383. Up to 501 conditions per place. [2022-12-13 22:21:19,024 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 53 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2022-12-13 22:21:19,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 311 flow [2022-12-13 22:21:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-12-13 22:21:19,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2022-12-13 22:21:19,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-12-13 22:21:19,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-12-13 22:21:19,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:19,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-12-13 22:21:19,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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-12-13 22:21:19,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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-12-13 22:21:19,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 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-12-13 22:21:19,029 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 115 flow. Second operand 3 states and 382 transitions. [2022-12-13 22:21:19,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 311 flow [2022-12-13 22:21:19,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:21:19,031 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 126 flow [2022-12-13 22:21:19,031 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-13 22:21:19,032 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-13 22:21:19,032 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 126 flow [2022-12-13 22:21:19,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 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-12-13 22:21:19,033 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:19,033 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:19,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 22:21:19,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:19,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 22:21:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 71622268, now seen corresponding path program 4 times [2022-12-13 22:21:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:21:19,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553745406] [2022-12-13 22:21:19,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 22:21:19,235 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-12-13 22:21:19,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:21:19,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:19,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 22:21:19,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 22:21:19,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 22:21:19,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:21:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:21:19,495 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 22:21:19,495 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:21:19,496 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 22:21:19,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 22:21:19,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 22:21:19,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 22:21:19,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 22:21:19,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 22:21:19,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 22:21:19,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 22:21:19,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 22:21:19,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 22:21:19,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 22:21:19,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 22:21:19,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 22:21:19,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-13 22:21:19,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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-12-13 22:21:19,700 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-12-13 22:21:19,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:21:19,714 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:21:19,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:21:19 BasicIcfg [2022-12-13 22:21:19,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:21:19,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:21:19,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:21:19,839 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:21:19,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:21:07" (3/4) ... [2022-12-13 22:21:19,843 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 22:21:19,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:21:19,843 INFO L158 Benchmark]: Toolchain (without parser) took 13087.76ms. Allocated memory was 71.3MB in the beginning and 151.0MB in the end (delta: 79.7MB). Free memory was 48.7MB in the beginning and 33.0MB in the end (delta: 15.7MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2022-12-13 22:21:19,844 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:21:19,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.75ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 39.7MB in the end (delta: 8.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-12-13 22:21:19,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:21:19,844 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:21:19,845 INFO L158 Benchmark]: RCFGBuilder took 618.94ms. Allocated memory is still 71.3MB. Free memory was 34.9MB in the beginning and 34.5MB in the end (delta: 422.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 22:21:19,845 INFO L158 Benchmark]: TraceAbstraction took 11955.40ms. Allocated memory was 71.3MB in the beginning and 151.0MB in the end (delta: 79.7MB). Free memory was 33.7MB in the beginning and 33.0MB in the end (delta: 764.7kB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2022-12-13 22:21:19,845 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 151.0MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:21:19,847 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.15ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.75ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 39.7MB in the end (delta: 8.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 618.94ms. Allocated memory is still 71.3MB. Free memory was 34.9MB in the beginning and 34.5MB in the end (delta: 422.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11955.40ms. Allocated memory was 71.3MB in the beginning and 151.0MB in the end (delta: 79.7MB). Free memory was 33.7MB in the beginning and 33.0MB in the end (delta: 764.7kB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 151.0MB. Free memory is still 33.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: 5.8s, 135 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 7064 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3118, independent: 2919, independent conditional: 0, independent unconditional: 2919, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1385, independent: 1347, independent conditional: 0, independent unconditional: 1347, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3118, independent: 1572, independent conditional: 0, independent unconditional: 1572, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 1385, unknown conditional: 0, unknown unconditional: 1385] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-1, t1001={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=0, t1001={-6:0}, t1002={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=1, t1001={-6:0}, t1002={-10:0}, t1003={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={-6:0}, t1002={-10:0}, t1003={-2:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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 7 procedures, 159 locations, 13 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: 11.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 782 IncrementalHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 5 mSDtfsCounter, 782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 431 SizeOfPredicates, 13 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-12-13 22:21:19,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3eb7925-ebd1-48b4-ba9b-d5dd27808b2c/bin/uautomizer-uyxdKDjOR8/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