./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- 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 12:51:35,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:51:35,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:51:35,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:51:35,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:51:35,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:51:35,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:51:35,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:51:35,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:51:35,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:51:35,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:51:35,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:51:35,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:51:35,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:51:35,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:51:35,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:51:35,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:51:35,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:51:35,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:51:35,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:51:35,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:51:35,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:51:35,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:51:35,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:51:35,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:51:35,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:51:35,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:51:35,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:51:35,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:51:35,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:51:35,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:51:35,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:51:35,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:51:35,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:51:35,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:51:35,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:51:35,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:51:35,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:51:35,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:51:35,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:51:35,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:51:35,123 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 12:51:35,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:51:35,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:51:35,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:51:35,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:51:35,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:51:35,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:51:35,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:51:35,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:51:35,155 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:51:35,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:51:35,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:51:35,155 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:51:35,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:51:35,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:51:35,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:51:35,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:51:35,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:51:35,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:51:35,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:51:35,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:51:35,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:51:35,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:51:35,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:51:35,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:51:35,158 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:51:35,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:51:35,158 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:51:35,158 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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2022-12-13 12:51:35,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:51:35,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:51:35,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:51:35,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:51:35,352 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:51:35,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:51:37,942 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:51:38,139 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:51:38,140 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:51:38,151 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data/e38f62b51/4e31f3ea031c45f9a088ebd50df72a91/FLAG0f4fb9997 [2022-12-13 12:51:38,166 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data/e38f62b51/4e31f3ea031c45f9a088ebd50df72a91 [2022-12-13 12:51:38,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:51:38,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:51:38,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:51:38,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:51:38,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:51:38,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cebce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38, skipping insertion in model container [2022-12-13 12:51:38,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:51:38,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:51:38,322 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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 12:51:38,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:51:38,484 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:51:38,493 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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 12:51:38,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:51:38,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:51:38,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:51:38,556 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:51:38,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38 WrapperNode [2022-12-13 12:51:38,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:51:38,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:51:38,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:51:38,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:51:38,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,591 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 12:51:38,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:51:38,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:51:38,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:51:38,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:51:38,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,610 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:51:38,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:51:38,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:51:38,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:51:38,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (1/1) ... [2022-12-13 12:51:38,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:51:38,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:51:38,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:51:38,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:51:38,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:51:38,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:51:38,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:51:38,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:51:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:51:38,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:51:38,681 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 12:51:38,784 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:51:38,785 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:51:39,125 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:51:39,249 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:51:39,250 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:51:39,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:51:39 BoogieIcfgContainer [2022-12-13 12:51:39,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:51:39,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:51:39,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:51:39,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:51:39,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:51:38" (1/3) ... [2022-12-13 12:51:39,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404c03c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:51:39, skipping insertion in model container [2022-12-13 12:51:39,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:38" (2/3) ... [2022-12-13 12:51:39,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404c03c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:51:39, skipping insertion in model container [2022-12-13 12:51:39,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:51:39" (3/3) ... [2022-12-13 12:51:39,257 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:51:39,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:51:39,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 12:51:39,272 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:51:39,312 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:51:39,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 12:51:39,374 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 12:51:39,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:51:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 12:51:39,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 12:51:39,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-13 12:51:39,384 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:51:39,392 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 12:51:39,394 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 12:51:39,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-13 12:51:39,413 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 12:51:39,413 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:51:39,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 12:51:39,414 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-12-13 12:51:42,594 INFO L134 LiptonReduction]: Checked pairs total: 6276 [2022-12-13 12:51:42,594 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-12-13 12:51:42,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:51:42,608 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;@6c411d32, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:51:42,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 12:51:42,609 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 12:51:42,609 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:51:42,609 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:42,610 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:51:42,610 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 12:51:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash 598, now seen corresponding path program 1 times [2022-12-13 12:51:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:42,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57749743] [2022-12-13 12:51:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:42,698 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 12:51:42,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:42,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57749743] [2022-12-13 12:51:42,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57749743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:42,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:42,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:51:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780999207] [2022-12-13 12:51:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:42,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:51:42,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:51:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:51:42,723 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2022-12-13 12:51:42,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 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 12:51:42,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:42,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2022-12-13 12:51:42,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:43,117 INFO L130 PetriNetUnfolder]: 1616/2376 cut-off events. [2022-12-13 12:51:43,118 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 12:51:43,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4800 conditions, 2376 events. 1616/2376 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11025 event pairs, 1616 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 4789. Up to 2368 conditions per place. [2022-12-13 12:51:43,129 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-13 12:51:43,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2022-12-13 12:51:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:51:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:51:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2022-12-13 12:51:43,142 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2022-12-13 12:51:43,143 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2022-12-13 12:51:43,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2022-12-13 12:51:43,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:43,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2022-12-13 12:51:43,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 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 12:51:43,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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 12:51:43,154 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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 12:51:43,156 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 250 transitions. [2022-12-13 12:51:43,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2022-12-13 12:51:43,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:51:43,160 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-12-13 12:51:43,162 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 12:51:43,166 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-12-13 12:51:43,166 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-12-13 12:51:43,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 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 12:51:43,167 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:43,167 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:51:43,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:51:43,167 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 12:51:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash 587969, now seen corresponding path program 1 times [2022-12-13 12:51:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:43,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105350639] [2022-12-13 12:51:43,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:43,375 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 12:51:43,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:43,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105350639] [2022-12-13 12:51:43,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105350639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:43,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:43,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:51:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450197110] [2022-12-13 12:51:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:43,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:51:43,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:43,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:51:43,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:51:43,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2022-12-13 12:51:43,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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 12:51:43,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:43,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2022-12-13 12:51:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:43,655 INFO L130 PetriNetUnfolder]: 1263/1942 cut-off events. [2022-12-13 12:51:43,655 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:51:43,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1942 events. 1263/1942 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9525 event pairs, 352 based on Foata normal form. 0/1781 useless extension candidates. Maximal degree in co-relation 3848. Up to 1510 conditions per place. [2022-12-13 12:51:43,662 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2022-12-13 12:51:43,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2022-12-13 12:51:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:51:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:51:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-12-13 12:51:43,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4993197278911565 [2022-12-13 12:51:43,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-12-13 12:51:43,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-12-13 12:51:43,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:43,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-12-13 12:51:43,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 12:51:43,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 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 12:51:43,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 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 12:51:43,671 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 367 transitions. [2022-12-13 12:51:43,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2022-12-13 12:51:43,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:51:43,672 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-12-13 12:51:43,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 12:51:43,672 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 12:51:43,673 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-12-13 12:51:43,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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 12:51:43,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:43,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:43,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:51:43,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:51:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -688923436, now seen corresponding path program 1 times [2022-12-13 12:51:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:43,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619418133] [2022-12-13 12:51:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:44,150 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 12:51:44,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:44,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619418133] [2022-12-13 12:51:44,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619418133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:44,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:44,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:51:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212209558] [2022-12-13 12:51:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:44,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:51:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:51:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:51:44,262 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 245 [2022-12-13 12:51:44,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 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 12:51:44,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:44,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 245 [2022-12-13 12:51:44,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:44,547 INFO L130 PetriNetUnfolder]: 895/1340 cut-off events. [2022-12-13 12:51:44,547 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-13 12:51:44,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1340 events. 895/1340 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6088 event pairs, 8 based on Foata normal form. 0/1340 useless extension candidates. Maximal degree in co-relation 2829. Up to 1056 conditions per place. [2022-12-13 12:51:44,553 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 35 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-13 12:51:44,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 176 flow [2022-12-13 12:51:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:51:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:51:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2022-12-13 12:51:44,555 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4197278911564626 [2022-12-13 12:51:44,555 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 617 transitions. [2022-12-13 12:51:44,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 617 transitions. [2022-12-13 12:51:44,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:44,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 617 transitions. [2022-12-13 12:51:44,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 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 12:51:44,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:44,559 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:44,559 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 6 states and 617 transitions. [2022-12-13 12:51:44,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 176 flow [2022-12-13 12:51:44,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:51:44,560 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 58 flow [2022-12-13 12:51:44,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-13 12:51:44,560 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2022-12-13 12:51:44,560 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 58 flow [2022-12-13 12:51:44,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 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 12:51:44,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:44,561 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:44,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:51:44,561 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 12:51:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash -688923477, now seen corresponding path program 1 times [2022-12-13 12:51:44,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:44,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132440744] [2022-12-13 12:51:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:45,056 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 12:51:45,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:45,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132440744] [2022-12-13 12:51:45,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132440744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:45,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:45,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:51:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973526094] [2022-12-13 12:51:45,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:45,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:51:45,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:45,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:51:45,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:51:45,099 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 245 [2022-12-13 12:51:45,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 12:51:45,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:45,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 245 [2022-12-13 12:51:45,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:45,410 INFO L130 PetriNetUnfolder]: 917/1487 cut-off events. [2022-12-13 12:51:45,410 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-13 12:51:45,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 1487 events. 917/1487 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7488 event pairs, 166 based on Foata normal form. 80/1566 useless extension candidates. Maximal degree in co-relation 3036. Up to 1032 conditions per place. [2022-12-13 12:51:45,415 INFO L137 encePairwiseOnDemand]: 241/245 looper letters, 29 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2022-12-13 12:51:45,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 224 flow [2022-12-13 12:51:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:51:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:51:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2022-12-13 12:51:45,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45387755102040817 [2022-12-13 12:51:45,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2022-12-13 12:51:45,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2022-12-13 12:51:45,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:45,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2022-12-13 12:51:45,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 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 12:51:45,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:45,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:45,419 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 58 flow. Second operand 5 states and 556 transitions. [2022-12-13 12:51:45,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 224 flow [2022-12-13 12:51:45,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:51:45,420 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 63 flow [2022-12-13 12:51:45,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2022-12-13 12:51:45,421 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 12:51:45,421 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 63 flow [2022-12-13 12:51:45,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 12:51:45,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:45,422 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:45,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:51:45,422 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 12:51:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 118195265, now seen corresponding path program 1 times [2022-12-13 12:51:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:45,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778482498] [2022-12-13 12:51:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:45,884 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 12:51:45,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:45,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778482498] [2022-12-13 12:51:45,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778482498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:45,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:45,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:51:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155909663] [2022-12-13 12:51:45,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:45,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:51:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:51:45,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:51:45,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2022-12-13 12:51:45,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 12:51:45,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:45,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2022-12-13 12:51:45,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:46,553 INFO L130 PetriNetUnfolder]: 1264/1925 cut-off events. [2022-12-13 12:51:46,553 INFO L131 PetriNetUnfolder]: For 560/560 co-relation queries the response was YES. [2022-12-13 12:51:46,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4414 conditions, 1925 events. 1264/1925 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9492 event pairs, 169 based on Foata normal form. 89/2012 useless extension candidates. Maximal degree in co-relation 4407. Up to 1018 conditions per place. [2022-12-13 12:51:46,560 INFO L137 encePairwiseOnDemand]: 233/245 looper letters, 44 selfloop transitions, 16 changer transitions 31/92 dead transitions. [2022-12-13 12:51:46,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 92 transitions, 418 flow [2022-12-13 12:51:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:51:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:51:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 986 transitions. [2022-12-13 12:51:46,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4471655328798186 [2022-12-13 12:51:46,563 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 986 transitions. [2022-12-13 12:51:46,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 986 transitions. [2022-12-13 12:51:46,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:46,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 986 transitions. [2022-12-13 12:51:46,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.55555555555556) internal successors, (986), 9 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:51:46,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 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 12:51:46,567 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 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 12:51:46,567 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 63 flow. Second operand 9 states and 986 transitions. [2022-12-13 12:51:46,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 92 transitions, 418 flow [2022-12-13 12:51:46,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 92 transitions, 402 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 12:51:46,570 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 200 flow [2022-12-13 12:51:46,570 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=200, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-12-13 12:51:46,571 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-12-13 12:51:46,571 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 200 flow [2022-12-13 12:51:46,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 12:51:46,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:46,571 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:46,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:51:46,571 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 12:51:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 507303209, now seen corresponding path program 2 times [2022-12-13 12:51:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:46,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440049431] [2022-12-13 12:51:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:47,025 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 12:51:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:47,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440049431] [2022-12-13 12:51:47,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440049431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:47,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:47,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:51:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941984781] [2022-12-13 12:51:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:47,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:51:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:51:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:51:47,076 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2022-12-13 12:51:47,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 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 12:51:47,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:47,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2022-12-13 12:51:47,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:47,484 INFO L130 PetriNetUnfolder]: 1418/2209 cut-off events. [2022-12-13 12:51:47,484 INFO L131 PetriNetUnfolder]: For 5212/5217 co-relation queries the response was YES. [2022-12-13 12:51:47,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 2209 events. 1418/2209 cut-off events. For 5212/5217 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11347 event pairs, 206 based on Foata normal form. 75/2282 useless extension candidates. Maximal degree in co-relation 8701. Up to 1021 conditions per place. [2022-12-13 12:51:47,491 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 41 selfloop transitions, 3 changer transitions 34/79 dead transitions. [2022-12-13 12:51:47,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 618 flow [2022-12-13 12:51:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:51:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:51:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions. [2022-12-13 12:51:47,494 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2022-12-13 12:51:47,494 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 660 transitions. [2022-12-13 12:51:47,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions. [2022-12-13 12:51:47,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:47,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions. [2022-12-13 12:51:47,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 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 12:51:47,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:47,499 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:47,499 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 200 flow. Second operand 6 states and 660 transitions. [2022-12-13 12:51:47,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 618 flow [2022-12-13 12:51:47,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 605 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 12:51:47,507 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 150 flow [2022-12-13 12:51:47,508 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2022-12-13 12:51:47,508 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-12-13 12:51:47,508 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 150 flow [2022-12-13 12:51:47,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 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 12:51:47,509 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:47,509 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:47,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:51:47,509 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 12:51:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1529108694, now seen corresponding path program 1 times [2022-12-13 12:51:47,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:47,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110366381] [2022-12-13 12:51:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:47,934 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 12:51:47,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:47,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110366381] [2022-12-13 12:51:47,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110366381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:47,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:47,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:51:47,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860476252] [2022-12-13 12:51:47,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:47,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:51:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:51:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:51:47,977 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 245 [2022-12-13 12:51:47,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 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 12:51:47,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:47,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 245 [2022-12-13 12:51:47,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:48,205 INFO L130 PetriNetUnfolder]: 614/966 cut-off events. [2022-12-13 12:51:48,205 INFO L131 PetriNetUnfolder]: For 1914/1914 co-relation queries the response was YES. [2022-12-13 12:51:48,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4065 conditions, 966 events. 614/966 cut-off events. For 1914/1914 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4189 event pairs, 140 based on Foata normal form. 45/1006 useless extension candidates. Maximal degree in co-relation 4051. Up to 699 conditions per place. [2022-12-13 12:51:48,212 INFO L137 encePairwiseOnDemand]: 241/245 looper letters, 28 selfloop transitions, 3 changer transitions 13/46 dead transitions. [2022-12-13 12:51:48,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 365 flow [2022-12-13 12:51:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:51:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:51:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-12-13 12:51:48,214 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4473469387755102 [2022-12-13 12:51:48,215 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2022-12-13 12:51:48,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2022-12-13 12:51:48,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:48,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2022-12-13 12:51:48,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 12:51:48,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:48,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:48,218 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 150 flow. Second operand 5 states and 548 transitions. [2022-12-13 12:51:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 365 flow [2022-12-13 12:51:48,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 331 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-13 12:51:48,226 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 139 flow [2022-12-13 12:51:48,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2022-12-13 12:51:48,226 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-12-13 12:51:48,226 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 139 flow [2022-12-13 12:51:48,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 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 12:51:48,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:48,227 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:48,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:51:48,227 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 12:51:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1687029408, now seen corresponding path program 1 times [2022-12-13 12:51:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:48,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944118481] [2022-12-13 12:51:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:48,649 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 12:51:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:48,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944118481] [2022-12-13 12:51:48,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944118481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:48,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:48,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:51:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911455804] [2022-12-13 12:51:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:51:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:51:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:51:48,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 245 [2022-12-13 12:51:48,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 25 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 12:51:48,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:48,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 245 [2022-12-13 12:51:48,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:48,881 INFO L130 PetriNetUnfolder]: 560/886 cut-off events. [2022-12-13 12:51:48,882 INFO L131 PetriNetUnfolder]: For 1778/1779 co-relation queries the response was YES. [2022-12-13 12:51:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 886 events. 560/886 cut-off events. For 1778/1779 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3725 event pairs, 195 based on Foata normal form. 36/917 useless extension candidates. Maximal degree in co-relation 3517. Up to 520 conditions per place. [2022-12-13 12:51:48,885 INFO L137 encePairwiseOnDemand]: 241/245 looper letters, 29 selfloop transitions, 2 changer transitions 12/45 dead transitions. [2022-12-13 12:51:48,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 335 flow [2022-12-13 12:51:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:51:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:51:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2022-12-13 12:51:48,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.446530612244898 [2022-12-13 12:51:48,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2022-12-13 12:51:48,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2022-12-13 12:51:48,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:48,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2022-12-13 12:51:48,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 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 12:51:48,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:48,889 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:48,889 INFO L175 Difference]: Start difference. First operand has 45 places, 25 transitions, 139 flow. Second operand 5 states and 547 transitions. [2022-12-13 12:51:48,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 335 flow [2022-12-13 12:51:48,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 325 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 12:51:48,891 INFO L231 Difference]: Finished difference. Result has 46 places, 25 transitions, 141 flow [2022-12-13 12:51:48,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=5, PETRI_FLOW=141, PETRI_PLACES=46, PETRI_TRANSITIONS=25} [2022-12-13 12:51:48,892 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-12-13 12:51:48,892 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 25 transitions, 141 flow [2022-12-13 12:51:48,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 12:51:48,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:48,893 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:48,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:51:48,893 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 12:51:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1057263476, now seen corresponding path program 1 times [2022-12-13 12:51:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:48,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591086918] [2022-12-13 12:51:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:49,447 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 12:51:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:49,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591086918] [2022-12-13 12:51:49,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591086918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:49,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:49,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:51:49,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535951388] [2022-12-13 12:51:49,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:49,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:51:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:49,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:51:49,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:51:49,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2022-12-13 12:51:49,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 25 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 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 12:51:49,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:49,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2022-12-13 12:51:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:49,824 INFO L130 PetriNetUnfolder]: 1051/1625 cut-off events. [2022-12-13 12:51:49,824 INFO L131 PetriNetUnfolder]: For 2823/2823 co-relation queries the response was YES. [2022-12-13 12:51:49,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 1625 events. 1051/1625 cut-off events. For 2823/2823 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7191 event pairs, 164 based on Foata normal form. 36/1661 useless extension candidates. Maximal degree in co-relation 6350. Up to 764 conditions per place. [2022-12-13 12:51:49,830 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 38 selfloop transitions, 7 changer transitions 22/68 dead transitions. [2022-12-13 12:51:49,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 518 flow [2022-12-13 12:51:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:51:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:51:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 659 transitions. [2022-12-13 12:51:49,832 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44829931972789117 [2022-12-13 12:51:49,832 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 659 transitions. [2022-12-13 12:51:49,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 659 transitions. [2022-12-13 12:51:49,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:49,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 659 transitions. [2022-12-13 12:51:49,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 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 12:51:49,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:49,835 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:49,835 INFO L175 Difference]: Start difference. First operand has 46 places, 25 transitions, 141 flow. Second operand 6 states and 659 transitions. [2022-12-13 12:51:49,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 518 flow [2022-12-13 12:51:49,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 493 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-13 12:51:49,841 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 172 flow [2022-12-13 12:51:49,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2022-12-13 12:51:49,841 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-12-13 12:51:49,841 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 172 flow [2022-12-13 12:51:49,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 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 12:51:49,842 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:49,842 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:49,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:51:49,842 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 12:51:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 747583512, now seen corresponding path program 2 times [2022-12-13 12:51:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:49,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398265948] [2022-12-13 12:51:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:50,162 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 12:51:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:50,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398265948] [2022-12-13 12:51:50,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398265948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:50,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:50,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:51:50,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952564783] [2022-12-13 12:51:50,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:50,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:51:50,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:50,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:51:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:51:50,198 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2022-12-13 12:51:50,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 12:51:50,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:50,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2022-12-13 12:51:50,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:50,544 INFO L130 PetriNetUnfolder]: 712/1128 cut-off events. [2022-12-13 12:51:50,544 INFO L131 PetriNetUnfolder]: For 2752/2752 co-relation queries the response was YES. [2022-12-13 12:51:50,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 1128 events. 712/1128 cut-off events. For 2752/2752 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4606 event pairs, 86 based on Foata normal form. 36/1164 useless extension candidates. Maximal degree in co-relation 4788. Up to 677 conditions per place. [2022-12-13 12:51:50,549 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 39 selfloop transitions, 8 changer transitions 20/68 dead transitions. [2022-12-13 12:51:50,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 540 flow [2022-12-13 12:51:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:51:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:51:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 808 transitions. [2022-12-13 12:51:50,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47113702623906706 [2022-12-13 12:51:50,550 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 808 transitions. [2022-12-13 12:51:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 808 transitions. [2022-12-13 12:51:50,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:50,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 808 transitions. [2022-12-13 12:51:50,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 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 12:51:50,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 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 12:51:50,557 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 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 12:51:50,557 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 172 flow. Second operand 7 states and 808 transitions. [2022-12-13 12:51:50,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 540 flow [2022-12-13 12:51:50,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 511 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 12:51:50,560 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 204 flow [2022-12-13 12:51:50,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2022-12-13 12:51:50,561 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-13 12:51:50,561 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 204 flow [2022-12-13 12:51:50,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 12:51:50,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:50,561 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:50,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:51:50,561 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 12:51:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1592701533, now seen corresponding path program 1 times [2022-12-13 12:51:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:50,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697330733] [2022-12-13 12:51:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:51,714 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 12:51:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:51,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697330733] [2022-12-13 12:51:51,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697330733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:51,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:51,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:51:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056703533] [2022-12-13 12:51:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:51,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:51:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:51:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:51:51,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 245 [2022-12-13 12:51:51,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 204 flow. Second operand has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 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 12:51:51,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:51,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 245 [2022-12-13 12:51:51,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:52,679 INFO L130 PetriNetUnfolder]: 959/1514 cut-off events. [2022-12-13 12:51:52,679 INFO L131 PetriNetUnfolder]: For 5518/5518 co-relation queries the response was YES. [2022-12-13 12:51:52,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6798 conditions, 1514 events. 959/1514 cut-off events. For 5518/5518 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6664 event pairs, 161 based on Foata normal form. 61/1575 useless extension candidates. Maximal degree in co-relation 6783. Up to 699 conditions per place. [2022-12-13 12:51:52,687 INFO L137 encePairwiseOnDemand]: 233/245 looper letters, 58 selfloop transitions, 25 changer transitions 27/111 dead transitions. [2022-12-13 12:51:52,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 983 flow [2022-12-13 12:51:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:51:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:51:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1331 transitions. [2022-12-13 12:51:52,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41789638932496076 [2022-12-13 12:51:52,690 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1331 transitions. [2022-12-13 12:51:52,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1331 transitions. [2022-12-13 12:51:52,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:52,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1331 transitions. [2022-12-13 12:51:52,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 0 states have call successors, (0), 0 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 12:51:52,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 245.0) internal successors, (3430), 14 states have internal predecessors, (3430), 0 states have call successors, (0), 0 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 12:51:52,694 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 245.0) internal successors, (3430), 14 states have internal predecessors, (3430), 0 states have call successors, (0), 0 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 12:51:52,694 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 204 flow. Second operand 13 states and 1331 transitions. [2022-12-13 12:51:52,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 983 flow [2022-12-13 12:51:52,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 868 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-13 12:51:52,701 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 424 flow [2022-12-13 12:51:52,701 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=424, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2022-12-13 12:51:52,702 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-12-13 12:51:52,702 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 424 flow [2022-12-13 12:51:52,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 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 12:51:52,702 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:52,702 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:52,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:51:52,702 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 12:51:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash 610307261, now seen corresponding path program 2 times [2022-12-13 12:51:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:52,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311061319] [2022-12-13 12:51:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:52,933 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 12:51:52,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:52,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311061319] [2022-12-13 12:51:52,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311061319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:52,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:52,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:51:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893528946] [2022-12-13 12:51:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:52,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:51:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:52,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:51:52,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:51:52,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 245 [2022-12-13 12:51:52,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:51:52,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:52,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 245 [2022-12-13 12:51:52,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:53,354 INFO L130 PetriNetUnfolder]: 1191/1900 cut-off events. [2022-12-13 12:51:53,354 INFO L131 PetriNetUnfolder]: For 9228/9228 co-relation queries the response was YES. [2022-12-13 12:51:53,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9586 conditions, 1900 events. 1191/1900 cut-off events. For 9228/9228 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9023 event pairs, 335 based on Foata normal form. 32/1932 useless extension candidates. Maximal degree in co-relation 9565. Up to 1014 conditions per place. [2022-12-13 12:51:53,361 INFO L137 encePairwiseOnDemand]: 236/245 looper letters, 53 selfloop transitions, 12 changer transitions 41/107 dead transitions. [2022-12-13 12:51:53,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 1166 flow [2022-12-13 12:51:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:51:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:51:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 898 transitions. [2022-12-13 12:51:53,363 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45816326530612245 [2022-12-13 12:51:53,363 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 898 transitions. [2022-12-13 12:51:53,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 898 transitions. [2022-12-13 12:51:53,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:53,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 898 transitions. [2022-12-13 12:51:53,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 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 12:51:53,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 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 12:51:53,369 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 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 12:51:53,369 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 424 flow. Second operand 8 states and 898 transitions. [2022-12-13 12:51:53,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 1166 flow [2022-12-13 12:51:53,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 107 transitions, 1101 flow, removed 32 selfloop flow, removed 6 redundant places. [2022-12-13 12:51:53,401 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 546 flow [2022-12-13 12:51:53,402 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=546, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2022-12-13 12:51:53,402 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2022-12-13 12:51:53,402 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 546 flow [2022-12-13 12:51:53,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:51:53,403 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:53,403 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:53,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:51:53,403 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 12:51:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1927932815, now seen corresponding path program 3 times [2022-12-13 12:51:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:53,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949598288] [2022-12-13 12:51:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:53,915 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 12:51:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:53,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949598288] [2022-12-13 12:51:53,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949598288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:53,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:53,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:51:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294701550] [2022-12-13 12:51:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:53,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:51:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:51:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:51:53,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 245 [2022-12-13 12:51:53,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 105.875) internal successors, (847), 8 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 12:51:53,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:53,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 245 [2022-12-13 12:51:53,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:54,342 INFO L130 PetriNetUnfolder]: 715/1168 cut-off events. [2022-12-13 12:51:54,342 INFO L131 PetriNetUnfolder]: For 6983/6983 co-relation queries the response was YES. [2022-12-13 12:51:54,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6268 conditions, 1168 events. 715/1168 cut-off events. For 6983/6983 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5011 event pairs, 136 based on Foata normal form. 30/1198 useless extension candidates. Maximal degree in co-relation 6246. Up to 726 conditions per place. [2022-12-13 12:51:54,347 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 58 selfloop transitions, 11 changer transitions 25/95 dead transitions. [2022-12-13 12:51:54,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 1100 flow [2022-12-13 12:51:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:51:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:51:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 787 transitions. [2022-12-13 12:51:54,348 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4588921282798834 [2022-12-13 12:51:54,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 787 transitions. [2022-12-13 12:51:54,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 787 transitions. [2022-12-13 12:51:54,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:54,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 787 transitions. [2022-12-13 12:51:54,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.42857142857143) internal successors, (787), 7 states have internal predecessors, (787), 0 states have call successors, (0), 0 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 12:51:54,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 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 12:51:54,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 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 12:51:54,351 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 546 flow. Second operand 7 states and 787 transitions. [2022-12-13 12:51:54,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 1100 flow [2022-12-13 12:51:54,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 994 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-13 12:51:54,362 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 504 flow [2022-12-13 12:51:54,362 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=504, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2022-12-13 12:51:54,362 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2022-12-13 12:51:54,362 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 504 flow [2022-12-13 12:51:54,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.875) internal successors, (847), 8 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 12:51:54,362 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:54,362 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 12:51:54,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:51:54,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:51:54,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1812055216, now seen corresponding path program 1 times [2022-12-13 12:51:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:54,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102339513] [2022-12-13 12:51:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:54,990 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 12:51:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102339513] [2022-12-13 12:51:54,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102339513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:54,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:54,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:51:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308469440] [2022-12-13 12:51:54,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:51:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:51:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:51:55,019 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 245 [2022-12-13 12:51:55,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 504 flow. Second operand has 8 states, 8 states have (on average 104.0) internal successors, (832), 8 states have internal predecessors, (832), 0 states have call successors, (0), 0 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 12:51:55,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:55,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 245 [2022-12-13 12:51:55,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:55,439 INFO L130 PetriNetUnfolder]: 785/1294 cut-off events. [2022-12-13 12:51:55,439 INFO L131 PetriNetUnfolder]: For 6799/6799 co-relation queries the response was YES. [2022-12-13 12:51:55,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 1294 events. 785/1294 cut-off events. For 6799/6799 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5696 event pairs, 415 based on Foata normal form. 22/1316 useless extension candidates. Maximal degree in co-relation 6408. Up to 659 conditions per place. [2022-12-13 12:51:55,444 INFO L137 encePairwiseOnDemand]: 235/245 looper letters, 69 selfloop transitions, 21 changer transitions 10/101 dead transitions. [2022-12-13 12:51:55,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 1101 flow [2022-12-13 12:51:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:51:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:51:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 991 transitions. [2022-12-13 12:51:55,446 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4494331065759637 [2022-12-13 12:51:55,446 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 991 transitions. [2022-12-13 12:51:55,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 991 transitions. [2022-12-13 12:51:55,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:55,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 991 transitions. [2022-12-13 12:51:55,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 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 12:51:55,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 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 12:51:55,449 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 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 12:51:55,449 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 504 flow. Second operand 9 states and 991 transitions. [2022-12-13 12:51:55,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 1101 flow [2022-12-13 12:51:55,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 1012 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-12-13 12:51:55,460 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 637 flow [2022-12-13 12:51:55,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=637, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2022-12-13 12:51:55,461 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2022-12-13 12:51:55,461 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 637 flow [2022-12-13 12:51:55,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.0) internal successors, (832), 8 states have internal predecessors, (832), 0 states have call successors, (0), 0 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 12:51:55,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:55,461 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 12:51:55,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:51:55,461 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:51:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash 46742831, now seen corresponding path program 1 times [2022-12-13 12:51:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:55,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430434354] [2022-12-13 12:51:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:56,040 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 12:51:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:56,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430434354] [2022-12-13 12:51:56,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430434354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:56,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:56,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:51:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703667528] [2022-12-13 12:51:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:56,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:51:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:51:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:51:56,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2022-12-13 12:51:56,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 637 flow. Second operand has 10 states, 10 states have (on average 107.6) internal successors, (1076), 10 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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 12:51:56,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:56,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2022-12-13 12:51:56,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:56,584 INFO L130 PetriNetUnfolder]: 903/1504 cut-off events. [2022-12-13 12:51:56,584 INFO L131 PetriNetUnfolder]: For 8258/8258 co-relation queries the response was YES. [2022-12-13 12:51:56,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7463 conditions, 1504 events. 903/1504 cut-off events. For 8258/8258 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7243 event pairs, 152 based on Foata normal form. 54/1558 useless extension candidates. Maximal degree in co-relation 7440. Up to 559 conditions per place. [2022-12-13 12:51:56,589 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 39 selfloop transitions, 7 changer transitions 56/103 dead transitions. [2022-12-13 12:51:56,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 1169 flow [2022-12-13 12:51:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:51:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:51:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1025 transitions. [2022-12-13 12:51:56,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46485260770975056 [2022-12-13 12:51:56,591 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1025 transitions. [2022-12-13 12:51:56,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1025 transitions. [2022-12-13 12:51:56,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:56,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1025 transitions. [2022-12-13 12:51:56,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 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 12:51:56,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 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 12:51:56,595 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 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 12:51:56,595 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 637 flow. Second operand 9 states and 1025 transitions. [2022-12-13 12:51:56,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 1169 flow [2022-12-13 12:51:56,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 1099 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-13 12:51:56,611 INFO L231 Difference]: Finished difference. Result has 78 places, 34 transitions, 327 flow [2022-12-13 12:51:56,611 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=78, PETRI_TRANSITIONS=34} [2022-12-13 12:51:56,611 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2022-12-13 12:51:56,611 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 34 transitions, 327 flow [2022-12-13 12:51:56,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.6) internal successors, (1076), 10 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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 12:51:56,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:56,612 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 12:51:56,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:51:56,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:51:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1440551284, now seen corresponding path program 2 times [2022-12-13 12:51:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:56,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176573216] [2022-12-13 12:51:56,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:56,724 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 12:51:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:56,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176573216] [2022-12-13 12:51:56,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176573216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:56,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:56,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:51:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921264017] [2022-12-13 12:51:56,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:56,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:51:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:51:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:51:56,734 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 245 [2022-12-13 12:51:56,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 34 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 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 12:51:56,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:56,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 245 [2022-12-13 12:51:56,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:56,866 INFO L130 PetriNetUnfolder]: 248/448 cut-off events. [2022-12-13 12:51:56,866 INFO L131 PetriNetUnfolder]: For 4000/4002 co-relation queries the response was YES. [2022-12-13 12:51:56,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 448 events. 248/448 cut-off events. For 4000/4002 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1704 event pairs, 34 based on Foata normal form. 47/494 useless extension candidates. Maximal degree in co-relation 2363. Up to 211 conditions per place. [2022-12-13 12:51:56,867 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 41 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2022-12-13 12:51:56,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 49 transitions, 578 flow [2022-12-13 12:51:56,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:51:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:51:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2022-12-13 12:51:56,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4663265306122449 [2022-12-13 12:51:56,869 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2022-12-13 12:51:56,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2022-12-13 12:51:56,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:56,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2022-12-13 12:51:56,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 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 12:51:56,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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 12:51:56,871 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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 12:51:56,871 INFO L175 Difference]: Start difference. First operand has 78 places, 34 transitions, 327 flow. Second operand 4 states and 457 transitions. [2022-12-13 12:51:56,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 49 transitions, 578 flow [2022-12-13 12:51:56,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 472 flow, removed 36 selfloop flow, removed 21 redundant places. [2022-12-13 12:51:56,878 INFO L231 Difference]: Finished difference. Result has 55 places, 29 transitions, 218 flow [2022-12-13 12:51:56,878 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=29} [2022-12-13 12:51:56,878 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-12-13 12:51:56,879 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 29 transitions, 218 flow [2022-12-13 12:51:56,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 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 12:51:56,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:56,879 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 12:51:56,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:51:56,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:51:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1388592888, now seen corresponding path program 1 times [2022-12-13 12:51:56,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:56,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870692464] [2022-12-13 12:51:56,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:51:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:57,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870692464] [2022-12-13 12:51:57,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870692464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:57,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:57,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:51:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145937620] [2022-12-13 12:51:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:57,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:51:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:51:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:51:57,016 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 245 [2022-12-13 12:51:57,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 29 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:51:57,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:57,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 245 [2022-12-13 12:51:57,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:57,139 INFO L130 PetriNetUnfolder]: 121/250 cut-off events. [2022-12-13 12:51:57,139 INFO L131 PetriNetUnfolder]: For 1399/1400 co-relation queries the response was YES. [2022-12-13 12:51:57,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 250 events. 121/250 cut-off events. For 1399/1400 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 846 event pairs, 13 based on Foata normal form. 28/277 useless extension candidates. Maximal degree in co-relation 1248. Up to 99 conditions per place. [2022-12-13 12:51:57,140 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 40 selfloop transitions, 8 changer transitions 5/55 dead transitions. [2022-12-13 12:51:57,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 540 flow [2022-12-13 12:51:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:51:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:51:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-12-13 12:51:57,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46448979591836737 [2022-12-13 12:51:57,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2022-12-13 12:51:57,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2022-12-13 12:51:57,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:57,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2022-12-13 12:51:57,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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 12:51:57,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:57,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 12:51:57,144 INFO L175 Difference]: Start difference. First operand has 55 places, 29 transitions, 218 flow. Second operand 5 states and 569 transitions. [2022-12-13 12:51:57,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 540 flow [2022-12-13 12:51:57,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 515 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 12:51:57,145 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 249 flow [2022-12-13 12:51:57,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2022-12-13 12:51:57,146 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-12-13 12:51:57,146 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 249 flow [2022-12-13 12:51:57,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:51:57,146 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:57,146 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:57,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:51:57,147 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:51:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1379576047, now seen corresponding path program 1 times [2022-12-13 12:51:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:57,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530151418] [2022-12-13 12:51:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:51:57,291 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 12:51:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:51:57,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530151418] [2022-12-13 12:51:57,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530151418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:51:57,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:51:57,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:51:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233501280] [2022-12-13 12:51:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:51:57,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:51:57,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:51:57,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:51:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:51:57,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 245 [2022-12-13 12:51:57,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 32 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 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 12:51:57,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:51:57,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 245 [2022-12-13 12:51:57,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:51:57,394 INFO L130 PetriNetUnfolder]: 70/154 cut-off events. [2022-12-13 12:51:57,394 INFO L131 PetriNetUnfolder]: For 774/775 co-relation queries the response was YES. [2022-12-13 12:51:57,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 154 events. 70/154 cut-off events. For 774/775 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 431 event pairs, 13 based on Foata normal form. 9/162 useless extension candidates. Maximal degree in co-relation 812. Up to 55 conditions per place. [2022-12-13 12:51:57,394 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 31 selfloop transitions, 11 changer transitions 4/48 dead transitions. [2022-12-13 12:51:57,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 485 flow [2022-12-13 12:51:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:51:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:51:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 666 transitions. [2022-12-13 12:51:57,395 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4530612244897959 [2022-12-13 12:51:57,395 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 666 transitions. [2022-12-13 12:51:57,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 666 transitions. [2022-12-13 12:51:57,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:51:57,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 666 transitions. [2022-12-13 12:51:57,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 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 12:51:57,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:57,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 12:51:57,397 INFO L175 Difference]: Start difference. First operand has 57 places, 32 transitions, 249 flow. Second operand 6 states and 666 transitions. [2022-12-13 12:51:57,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 485 flow [2022-12-13 12:51:57,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 421 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-12-13 12:51:57,399 INFO L231 Difference]: Finished difference. Result has 58 places, 32 transitions, 238 flow [2022-12-13 12:51:57,399 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=58, PETRI_TRANSITIONS=32} [2022-12-13 12:51:57,399 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2022-12-13 12:51:57,399 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 32 transitions, 238 flow [2022-12-13 12:51:57,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 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 12:51:57,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:51:57,400 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 12:51:57,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:51:57,400 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:51:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:51:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1717367116, now seen corresponding path program 1 times [2022-12-13 12:51:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:51:57,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774479587] [2022-12-13 12:51:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:51:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:51:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:51:57,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:51:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:51:57,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:51:57,484 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:51:57,485 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 12:51:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 12:51:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 12:51:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 12:51:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 12:51:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 12:51:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 12:51:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 12:51:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 12:51:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 12:51:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 12:51:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 12:51:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 12:51:57,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:51:57,487 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:51:57,491 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:51:57,491 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:51:57,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:51:57 BasicIcfg [2022-12-13 12:51:57,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:51:57,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:51:57,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:51:57,527 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:51:57,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:51:39" (3/4) ... [2022-12-13 12:51:57,530 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:51:57,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:51:57,530 INFO L158 Benchmark]: Toolchain (without parser) took 19360.46ms. Allocated memory was 127.9MB in the beginning and 234.9MB in the end (delta: 107.0MB). Free memory was 84.9MB in the beginning and 140.8MB in the end (delta: -55.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2022-12-13 12:51:57,530 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:51:57,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.36ms. Allocated memory is still 127.9MB. Free memory was 84.9MB in the beginning and 55.9MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 12:51:57,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.66ms. Allocated memory is still 127.9MB. Free memory was 55.9MB in the beginning and 53.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:51:57,531 INFO L158 Benchmark]: Boogie Preprocessor took 21.87ms. Allocated memory is still 127.9MB. Free memory was 53.4MB in the beginning and 50.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:51:57,531 INFO L158 Benchmark]: RCFGBuilder took 637.07ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 50.9MB in the beginning and 93.8MB in the end (delta: -42.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-12-13 12:51:57,531 INFO L158 Benchmark]: TraceAbstraction took 18274.11ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 92.9MB in the beginning and 141.8MB in the end (delta: -49.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 12:51:57,531 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 234.9MB. Free memory was 141.8MB in the beginning and 140.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:51:57,532 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 127.9MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.36ms. Allocated memory is still 127.9MB. Free memory was 84.9MB in the beginning and 55.9MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.66ms. Allocated memory is still 127.9MB. Free memory was 55.9MB in the beginning and 53.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.87ms. Allocated memory is still 127.9MB. Free memory was 53.4MB in the beginning and 50.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 637.07ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 50.9MB in the beginning and 93.8MB in the end (delta: -42.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18274.11ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 92.9MB in the beginning and 141.8MB in the end (delta: -49.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 234.9MB. Free memory was 141.8MB in the beginning and 140.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 130 PlacesBefore, 41 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 6276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2724, independent: 2544, independent conditional: 0, independent unconditional: 2544, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1210, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2724, independent: 1372, independent conditional: 0, independent unconditional: 1372, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1210, unknown conditional: 0, unknown unconditional: 1210] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-1, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=0, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 pthread_t t1851; [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=1, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=57, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=56, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=56, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 849]: 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: 851]: 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, 152 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: 18.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1458 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1198 mSDsluCounter, 1024 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 875 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2940 IncrementalHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 149 mSDtfsCounter, 2940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=14, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 2861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 12:51:57,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- 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 12:51:59,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:51:59,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:51:59,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:51:59,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:51:59,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:51:59,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:51:59,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:51:59,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:51:59,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:51:59,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:51:59,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:51:59,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:51:59,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:51:59,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:51:59,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:51:59,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:51:59,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:51:59,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:51:59,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:51:59,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:51:59,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:51:59,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:51:59,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:51:59,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:51:59,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:51:59,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:51:59,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:51:59,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:51:59,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:51:59,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:51:59,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:51:59,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:51:59,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:51:59,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:51:59,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:51:59,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:51:59,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:51:59,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:51:59,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:51:59,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:51:59,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 12:51:59,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:51:59,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:51:59,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:51:59,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:51:59,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:51:59,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:51:59,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:51:59,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:51:59,296 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:51:59,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:51:59,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:51:59,296 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:51:59,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:51:59,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:51:59,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:51:59,297 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:51:59,297 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:51:59,297 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:51:59,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:51:59,298 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:51:59,298 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 12:51:59,298 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 12:51:59,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:51:59,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:51:59,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:51:59,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:51:59,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:51:59,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:51:59,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:51:59,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:51:59,300 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 12:51:59,305 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 12:51:59,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:51:59,306 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:51:59,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:51:59,306 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 12:51:59,306 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:51:59,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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2022-12-13 12:51:59,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:51:59,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:51:59,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:51:59,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:51:59,536 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:51:59,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:52:02,165 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:52:02,359 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:52:02,360 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:52:02,369 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data/2760c73bd/f7e538d18e284fe292106888c23866bd/FLAGc8a86002c [2022-12-13 12:52:02,379 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/data/2760c73bd/f7e538d18e284fe292106888c23866bd [2022-12-13 12:52:02,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:52:02,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:52:02,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:52:02,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:52:02,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:52:02,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5d21d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02, skipping insertion in model container [2022-12-13 12:52:02,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:52:02,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:52:02,528 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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 12:52:02,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:52:02,693 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:52:02,703 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_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 12:52:02,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:02,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:02,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:52:02,759 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:52:02,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02 WrapperNode [2022-12-13 12:52:02,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:52:02,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:52:02,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:52:02,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:52:02,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,794 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 12:52:02,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:52:02,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:52:02,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:52:02,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:52:02,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:52:02,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:52:02,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:52:02,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:52:02,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (1/1) ... [2022-12-13 12:52:02,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:52:02,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:52:02,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:52:02,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:52:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:52:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:52:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:52:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:52:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 12:52:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 12:52:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:52:02,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:52:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:52:02,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:52:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:52:02,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:52:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:52:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:52:02,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:52:02,879 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 12:52:03,004 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:52:03,006 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:52:03,355 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:52:03,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:52:03,474 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:52:03,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:03 BoogieIcfgContainer [2022-12-13 12:52:03,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:52:03,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:52:03,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:52:03,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:52:03,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:52:02" (1/3) ... [2022-12-13 12:52:03,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bd6d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:03, skipping insertion in model container [2022-12-13 12:52:03,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:02" (2/3) ... [2022-12-13 12:52:03,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bd6d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:03, skipping insertion in model container [2022-12-13 12:52:03,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:03" (3/3) ... [2022-12-13 12:52:03,482 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:52:03,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:52:03,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 12:52:03,496 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:52:03,546 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:52:03,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 12:52:03,605 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 12:52:03,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:52:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 12:52:03,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 12:52:03,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2022-12-13 12:52:03,615 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:52:03,622 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 12:52:03,624 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 12:52:03,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2022-12-13 12:52:03,644 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 12:52:03,644 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:52:03,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 12:52:03,646 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-12-13 12:52:09,724 INFO L134 LiptonReduction]: Checked pairs total: 6280 [2022-12-13 12:52:09,725 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-12-13 12:52:09,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:52:09,744 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;@543b4b2a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:52:09,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 12:52:09,746 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 12:52:09,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:52:09,747 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:09,747 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:52:09,747 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 12:52:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 602, now seen corresponding path program 1 times [2022-12-13 12:52:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:09,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265520868] [2022-12-13 12:52:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:09,761 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 12:52:09,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:09,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:09,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:09,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 12:52:09,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:09,820 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 12:52:09,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:09,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265520868] [2022-12-13 12:52:09,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265520868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:09,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:09,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:52:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873096640] [2022-12-13 12:52:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:09,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:52:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:52:09,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:52:09,847 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 247 [2022-12-13 12:52:09,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 12:52:09,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:09,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 247 [2022-12-13 12:52:09,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:10,221 INFO L130 PetriNetUnfolder]: 1616/2376 cut-off events. [2022-12-13 12:52:10,221 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 12:52:10,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4800 conditions, 2376 events. 1616/2376 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11002 event pairs, 1616 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 4789. Up to 2368 conditions per place. [2022-12-13 12:52:10,233 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-13 12:52:10,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2022-12-13 12:52:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:52:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:52:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2022-12-13 12:52:10,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5101214574898786 [2022-12-13 12:52:10,245 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 252 transitions. [2022-12-13 12:52:10,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 252 transitions. [2022-12-13 12:52:10,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:10,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 252 transitions. [2022-12-13 12:52:10,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 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 12:52:10,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 12:52:10,254 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 12:52:10,255 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 252 transitions. [2022-12-13 12:52:10,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2022-12-13 12:52:10,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:52:10,259 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-12-13 12:52:10,260 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 12:52:10,263 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-12-13 12:52:10,263 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-12-13 12:52:10,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 12:52:10,264 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:10,264 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:52:10,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:10,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:10,465 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 12:52:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash 590916, now seen corresponding path program 1 times [2022-12-13 12:52:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:10,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972239032] [2022-12-13 12:52:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:10,468 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 12:52:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:10,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:10,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:10,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:52:10,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:10,697 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 12:52:10,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:10,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:10,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972239032] [2022-12-13 12:52:10,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972239032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:10,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:10,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:52:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171859497] [2022-12-13 12:52:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:10,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:52:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:52:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:52:10,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2022-12-13 12:52:10,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 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 12:52:10,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:10,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2022-12-13 12:52:10,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:11,085 INFO L130 PetriNetUnfolder]: 1263/1942 cut-off events. [2022-12-13 12:52:11,086 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:52:11,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1942 events. 1263/1942 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9493 event pairs, 352 based on Foata normal form. 0/1781 useless extension candidates. Maximal degree in co-relation 3848. Up to 1510 conditions per place. [2022-12-13 12:52:11,098 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2022-12-13 12:52:11,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2022-12-13 12:52:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:52:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:52:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2022-12-13 12:52:11,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4993252361673414 [2022-12-13 12:52:11,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2022-12-13 12:52:11,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2022-12-13 12:52:11,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:11,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2022-12-13 12:52:11,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 12:52:11,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 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 12:52:11,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 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 12:52:11,107 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 370 transitions. [2022-12-13 12:52:11,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2022-12-13 12:52:11,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:52:11,108 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-12-13 12:52:11,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 12:52:11,108 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 12:52:11,109 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-12-13 12:52:11,109 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 12:52:11,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:11,109 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:11,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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)] Ended with exit code 0 [2022-12-13 12:52:11,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:11,310 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 12:52:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash -306973985, now seen corresponding path program 1 times [2022-12-13 12:52:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:11,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870556055] [2022-12-13 12:52:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:11,312 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 12:52:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:11,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:11,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:11,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:52:11,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:11,412 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 12:52:11,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:11,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870556055] [2022-12-13 12:52:11,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870556055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:11,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:11,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:52:11,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015280081] [2022-12-13 12:52:11,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:11,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:52:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:11,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:52:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:52:11,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 247 [2022-12-13 12:52:11,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 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 12:52:11,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:11,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 247 [2022-12-13 12:52:11,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:11,689 INFO L130 PetriNetUnfolder]: 679/1107 cut-off events. [2022-12-13 12:52:11,690 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 12:52:11,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1107 events. 679/1107 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5231 event pairs, 145 based on Foata normal form. 80/1139 useless extension candidates. Maximal degree in co-relation 2340. Up to 601 conditions per place. [2022-12-13 12:52:11,694 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 40 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2022-12-13 12:52:11,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 206 flow [2022-12-13 12:52:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:52:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:52:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2022-12-13 12:52:11,698 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 12:52:11,698 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2022-12-13 12:52:11,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2022-12-13 12:52:11,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:11,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2022-12-13 12:52:11,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 12:52:11,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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 12:52:11,702 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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 12:52:11,702 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 4 states and 468 transitions. [2022-12-13 12:52:11,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 206 flow [2022-12-13 12:52:11,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:52:11,703 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 86 flow [2022-12-13 12:52:11,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-13 12:52:11,704 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-12-13 12:52:11,704 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 86 flow [2022-12-13 12:52:11,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 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 12:52:11,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:11,705 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:11,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:11,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:11,906 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 12:52:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash 507956611, now seen corresponding path program 1 times [2022-12-13 12:52:11,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:11,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942378830] [2022-12-13 12:52:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:11,908 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 12:52:11,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:11,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:11,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:52:12,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:12,091 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 12:52:12,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:12,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:12,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942378830] [2022-12-13 12:52:12,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942378830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:12,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:12,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:52:12,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638813315] [2022-12-13 12:52:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:12,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:52:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:52:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:52:12,113 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 247 [2022-12-13 12:52:12,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 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 12:52:12,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:12,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 247 [2022-12-13 12:52:12,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:12,311 INFO L130 PetriNetUnfolder]: 274/501 cut-off events. [2022-12-13 12:52:12,311 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-13 12:52:12,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 501 events. 274/501 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2105 event pairs, 68 based on Foata normal form. 44/530 useless extension candidates. Maximal degree in co-relation 1307. Up to 194 conditions per place. [2022-12-13 12:52:12,313 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 49 selfloop transitions, 8 changer transitions 1/60 dead transitions. [2022-12-13 12:52:12,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 291 flow [2022-12-13 12:52:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:52:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:52:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-12-13 12:52:12,315 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 12:52:12,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2022-12-13 12:52:12,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2022-12-13 12:52:12,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:12,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2022-12-13 12:52:12,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 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 12:52:12,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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 12:52:12,319 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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 12:52:12,319 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 86 flow. Second operand 5 states and 585 transitions. [2022-12-13 12:52:12,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 291 flow [2022-12-13 12:52:12,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 281 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:52:12,320 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 126 flow [2022-12-13 12:52:12,321 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-13 12:52:12,321 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-12-13 12:52:12,321 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 126 flow [2022-12-13 12:52:12,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 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 12:52:12,322 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:12,322 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 12:52:12,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:12,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:12,523 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 12:52:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 909526140, now seen corresponding path program 1 times [2022-12-13 12:52:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:12,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90694119] [2022-12-13 12:52:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:12,524 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 12:52:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:12,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:12,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:12,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:52:12,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:12,639 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 12:52:12,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:12,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:12,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90694119] [2022-12-13 12:52:12,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90694119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:12,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:12,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:52:12,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380406950] [2022-12-13 12:52:12,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:12,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:52:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:12,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:52:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:52:12,654 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 247 [2022-12-13 12:52:12,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 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 12:52:12,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:12,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 247 [2022-12-13 12:52:12,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:12,872 INFO L130 PetriNetUnfolder]: 168/312 cut-off events. [2022-12-13 12:52:12,872 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-13 12:52:12,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 312 events. 168/312 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1207 event pairs, 68 based on Foata normal form. 11/318 useless extension candidates. Maximal degree in co-relation 911. Up to 129 conditions per place. [2022-12-13 12:52:12,873 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 36 selfloop transitions, 11 changer transitions 1/50 dead transitions. [2022-12-13 12:52:12,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 274 flow [2022-12-13 12:52:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:52:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:52:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2022-12-13 12:52:12,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45883940620782726 [2022-12-13 12:52:12,877 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 680 transitions. [2022-12-13 12:52:12,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions. [2022-12-13 12:52:12,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:12,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions. [2022-12-13 12:52:12,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 12:52:12,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 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 12:52:12,881 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 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 12:52:12,881 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 126 flow. Second operand 6 states and 680 transitions. [2022-12-13 12:52:12,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 274 flow [2022-12-13 12:52:12,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 249 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 12:52:12,883 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 140 flow [2022-12-13 12:52:12,883 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-13 12:52:12,883 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-12-13 12:52:12,883 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 140 flow [2022-12-13 12:52:12,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 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 12:52:12,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:12,884 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 12:52:12,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:13,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:13,085 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 12:52:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1776598270, now seen corresponding path program 1 times [2022-12-13 12:52:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:13,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717305056] [2022-12-13 12:52:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:13,088 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 12:52:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:13,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:13,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:13,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 12:52:13,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:13,899 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 12:52:13,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:13,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:13,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717305056] [2022-12-13 12:52:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717305056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:13,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:13,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:52:13,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348686173] [2022-12-13 12:52:13,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:13,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:52:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:13,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:52:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:52:14,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 247 [2022-12-13 12:52:14,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 140 flow. Second operand has 11 states, 11 states have (on average 104.9090909090909) internal successors, (1154), 11 states have internal predecessors, (1154), 0 states have call successors, (0), 0 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 12:52:14,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:14,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 247 [2022-12-13 12:52:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:14,613 INFO L130 PetriNetUnfolder]: 303/583 cut-off events. [2022-12-13 12:52:14,613 INFO L131 PetriNetUnfolder]: For 728/728 co-relation queries the response was YES. [2022-12-13 12:52:14,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 583 events. 303/583 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2633 event pairs, 78 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 1727. Up to 220 conditions per place. [2022-12-13 12:52:14,616 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 77 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2022-12-13 12:52:14,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 630 flow [2022-12-13 12:52:14,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:52:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:52:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 994 transitions. [2022-12-13 12:52:14,618 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4471434997750787 [2022-12-13 12:52:14,618 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 994 transitions. [2022-12-13 12:52:14,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 994 transitions. [2022-12-13 12:52:14,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:14,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 994 transitions. [2022-12-13 12:52:14,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.44444444444444) internal successors, (994), 9 states have internal predecessors, (994), 0 states have call successors, (0), 0 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 12:52:14,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 247.0) internal successors, (2470), 10 states have internal predecessors, (2470), 0 states have call successors, (0), 0 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 12:52:14,622 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 247.0) internal successors, (2470), 10 states have internal predecessors, (2470), 0 states have call successors, (0), 0 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 12:52:14,622 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 140 flow. Second operand 9 states and 994 transitions. [2022-12-13 12:52:14,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 630 flow [2022-12-13 12:52:14,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 430 flow, removed 30 selfloop flow, removed 9 redundant places. [2022-12-13 12:52:14,625 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 137 flow [2022-12-13 12:52:14,625 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-13 12:52:14,625 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-12-13 12:52:14,625 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 137 flow [2022-12-13 12:52:14,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.9090909090909) internal successors, (1154), 11 states have internal predecessors, (1154), 0 states have call successors, (0), 0 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 12:52:14,626 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:14,626 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 12:52:14,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:14,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:14,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 12:52:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 880159292, now seen corresponding path program 1 times [2022-12-13 12:52:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:14,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392654173] [2022-12-13 12:52:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:14,831 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 12:52:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:14,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:14,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:15,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 12:52:15,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:15,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:15,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392654173] [2022-12-13 12:52:15,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392654173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:15,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:15,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:52:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358098090] [2022-12-13 12:52:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:15,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:52:15,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:15,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:52:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:52:15,473 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 247 [2022-12-13 12:52:15,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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 12:52:15,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:15,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 247 [2022-12-13 12:52:15,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:15,678 INFO L130 PetriNetUnfolder]: 286/533 cut-off events. [2022-12-13 12:52:15,678 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-13 12:52:15,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 533 events. 286/533 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2395 event pairs, 93 based on Foata normal form. 3/531 useless extension candidates. Maximal degree in co-relation 1432. Up to 464 conditions per place. [2022-12-13 12:52:15,680 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 37 selfloop transitions, 3 changer transitions 4/47 dead transitions. [2022-12-13 12:52:15,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 272 flow [2022-12-13 12:52:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:52:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:52:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2022-12-13 12:52:15,682 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4089068825910931 [2022-12-13 12:52:15,682 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2022-12-13 12:52:15,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2022-12-13 12:52:15,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:15,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2022-12-13 12:52:15,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 12:52:15,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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 12:52:15,684 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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 12:52:15,684 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 137 flow. Second operand 5 states and 505 transitions. [2022-12-13 12:52:15,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 272 flow [2022-12-13 12:52:15,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:52:15,685 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 129 flow [2022-12-13 12:52:15,685 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-12-13 12:52:15,686 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 12:52:15,686 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 129 flow [2022-12-13 12:52:15,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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 12:52:15,686 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:15,686 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 12:52:15,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:15,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:15,888 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 12:52:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash -455290850, now seen corresponding path program 2 times [2022-12-13 12:52:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:15,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713600539] [2022-12-13 12:52:15,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:52:15,892 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 12:52:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:15,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:15,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:16,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 12:52:16,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:52:16,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 12:52:16,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:16,181 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 12:52:16,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:16,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:16,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713600539] [2022-12-13 12:52:16,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713600539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:16,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:16,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:52:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419245466] [2022-12-13 12:52:16,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:16,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:52:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:52:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:52:16,213 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 247 [2022-12-13 12:52:16,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 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 12:52:16,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:16,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 247 [2022-12-13 12:52:16,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:16,592 INFO L130 PetriNetUnfolder]: 434/860 cut-off events. [2022-12-13 12:52:16,593 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2022-12-13 12:52:16,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 860 events. 434/860 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4563 event pairs, 104 based on Foata normal form. 1/861 useless extension candidates. Maximal degree in co-relation 2323. Up to 361 conditions per place. [2022-12-13 12:52:16,595 INFO L137 encePairwiseOnDemand]: 238/247 looper letters, 54 selfloop transitions, 9 changer transitions 36/100 dead transitions. [2022-12-13 12:52:16,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 557 flow [2022-12-13 12:52:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:52:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:52:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 893 transitions. [2022-12-13 12:52:16,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2022-12-13 12:52:16,597 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 893 transitions. [2022-12-13 12:52:16,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 893 transitions. [2022-12-13 12:52:16,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:16,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 893 transitions. [2022-12-13 12:52:16,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.625) internal successors, (893), 8 states have internal predecessors, (893), 0 states have call successors, (0), 0 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 12:52:16,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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 12:52:16,600 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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 12:52:16,600 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 129 flow. Second operand 8 states and 893 transitions. [2022-12-13 12:52:16,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 557 flow [2022-12-13 12:52:16,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 542 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 12:52:16,602 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 184 flow [2022-12-13 12:52:16,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2022-12-13 12:52:16,602 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-12-13 12:52:16,602 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 184 flow [2022-12-13 12:52:16,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 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 12:52:16,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:16,603 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 12:52:16,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:16,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:16,804 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 12:52:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1733313386, now seen corresponding path program 3 times [2022-12-13 12:52:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:16,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938658775] [2022-12-13 12:52:16,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:52:16,808 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 12:52:16,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:16,810 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:16,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:17,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 12:52:17,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:52:17,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:52:17,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:17,108 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 12:52:17,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:17,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:17,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938658775] [2022-12-13 12:52:17,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938658775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:17,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:17,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:52:17,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506452438] [2022-12-13 12:52:17,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:17,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:52:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:17,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:52:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:52:17,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2022-12-13 12:52:17,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 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 12:52:17,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:17,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2022-12-13 12:52:17,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:17,314 INFO L130 PetriNetUnfolder]: 451/831 cut-off events. [2022-12-13 12:52:17,314 INFO L131 PetriNetUnfolder]: For 1114/1118 co-relation queries the response was YES. [2022-12-13 12:52:17,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 831 events. 451/831 cut-off events. For 1114/1118 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4175 event pairs, 108 based on Foata normal form. 3/826 useless extension candidates. Maximal degree in co-relation 2634. Up to 415 conditions per place. [2022-12-13 12:52:17,316 INFO L137 encePairwiseOnDemand]: 242/247 looper letters, 40 selfloop transitions, 3 changer transitions 28/72 dead transitions. [2022-12-13 12:52:17,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 461 flow [2022-12-13 12:52:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:52:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:52:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-12-13 12:52:17,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46639676113360323 [2022-12-13 12:52:17,318 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2022-12-13 12:52:17,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2022-12-13 12:52:17,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:17,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2022-12-13 12:52:17,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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 12:52:17,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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 12:52:17,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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 12:52:17,320 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 184 flow. Second operand 5 states and 576 transitions. [2022-12-13 12:52:17,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 461 flow [2022-12-13 12:52:17,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 444 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 12:52:17,322 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 132 flow [2022-12-13 12:52:17,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2022-12-13 12:52:17,323 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-13 12:52:17,323 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 132 flow [2022-12-13 12:52:17,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 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 12:52:17,323 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:17,323 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 12:52:17,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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)] Ended with exit code 0 [2022-12-13 12:52:17,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:17,525 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 12:52:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1981760296, now seen corresponding path program 4 times [2022-12-13 12:52:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:17,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030984909] [2022-12-13 12:52:17,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:52:17,528 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 12:52:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:17,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:17,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 (11)] Waiting until timeout for monitored process [2022-12-13 12:52:17,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:52:17,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:52:17,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 12:52:17,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:17,830 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 12:52:17,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:17,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:17,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030984909] [2022-12-13 12:52:17,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030984909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:17,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:17,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:52:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221937790] [2022-12-13 12:52:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:17,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:52:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:52:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:52:17,855 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2022-12-13 12:52:17,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 30 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 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 12:52:17,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:17,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2022-12-13 12:52:17,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:18,059 INFO L130 PetriNetUnfolder]: 171/344 cut-off events. [2022-12-13 12:52:18,059 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2022-12-13 12:52:18,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 344 events. 171/344 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1331 event pairs, 12 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 1133. Up to 208 conditions per place. [2022-12-13 12:52:18,060 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 39 selfloop transitions, 4 changer transitions 22/66 dead transitions. [2022-12-13 12:52:18,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 404 flow [2022-12-13 12:52:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:52:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:52:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2022-12-13 12:52:18,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46288798920377866 [2022-12-13 12:52:18,062 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2022-12-13 12:52:18,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2022-12-13 12:52:18,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:18,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2022-12-13 12:52:18,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 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 12:52:18,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 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 12:52:18,065 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 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 12:52:18,065 INFO L175 Difference]: Start difference. First operand has 52 places, 30 transitions, 132 flow. Second operand 6 states and 686 transitions. [2022-12-13 12:52:18,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 404 flow [2022-12-13 12:52:18,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 361 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-13 12:52:18,066 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 125 flow [2022-12-13 12:52:18,066 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2022-12-13 12:52:18,067 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 12:52:18,067 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 125 flow [2022-12-13 12:52:18,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 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 12:52:18,067 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:18,067 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 12:52:18,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 (11)] Ended with exit code 0 [2022-12-13 12:52:18,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:18,271 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 12:52:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1229168526, now seen corresponding path program 5 times [2022-12-13 12:52:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:18,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858531265] [2022-12-13 12:52:18,274 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:52:18,274 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 12:52:18,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:18,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:18,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 (12)] Waiting until timeout for monitored process [2022-12-13 12:52:18,385 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 12:52:18,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:52:18,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 12:52:18,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:52:18,690 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 12:52:18,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:52:18,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:52:18,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858531265] [2022-12-13 12:52:18,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858531265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:18,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:18,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:52:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22559953] [2022-12-13 12:52:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:18,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:52:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:52:18,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:52:18,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:52:18,736 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 247 [2022-12-13 12:52:18,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:52:18,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:18,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 247 [2022-12-13 12:52:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:18,988 INFO L130 PetriNetUnfolder]: 94/199 cut-off events. [2022-12-13 12:52:18,988 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2022-12-13 12:52:18,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 199 events. 94/199 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 611 event pairs, 14 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 605. Up to 101 conditions per place. [2022-12-13 12:52:18,990 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 34 selfloop transitions, 5 changer transitions 17/57 dead transitions. [2022-12-13 12:52:18,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 330 flow [2022-12-13 12:52:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:52:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:52:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 866 transitions. [2022-12-13 12:52:18,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4382591093117409 [2022-12-13 12:52:18,993 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 866 transitions. [2022-12-13 12:52:18,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 866 transitions. [2022-12-13 12:52:18,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:18,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 866 transitions. [2022-12-13 12:52:18,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.25) internal successors, (866), 8 states have internal predecessors, (866), 0 states have call successors, (0), 0 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 12:52:18,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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 12:52:18,996 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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 12:52:18,997 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 125 flow. Second operand 8 states and 866 transitions. [2022-12-13 12:52:18,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 330 flow [2022-12-13 12:52:18,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 312 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 12:52:18,998 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 130 flow [2022-12-13 12:52:18,998 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=130, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2022-12-13 12:52:18,998 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-13 12:52:18,998 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 130 flow [2022-12-13 12:52:18,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:52:18,999 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:18,999 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 12:52:19,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 (12)] Ended with exit code 0 [2022-12-13 12:52:19,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:19,200 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 12:52:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash 240269236, now seen corresponding path program 6 times [2022-12-13 12:52:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:52:19,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265991324] [2022-12-13 12:52:19,202 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 12:52:19,203 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 12:52:19,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:52:19,206 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:19,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 (13)] Waiting until timeout for monitored process [2022-12-13 12:52:19,431 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-13 12:52:19,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 12:52:19,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:52:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:52:19,551 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 12:52:19,551 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:52:19,552 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 12:52:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 12:52:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 12:52:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 12:52:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 12:52:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 12:52:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 12:52:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 12:52:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 12:52:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 12:52:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 12:52:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 12:52:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 12:52:19,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 (13)] Ended with exit code 0 [2022-12-13 12:52:19,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/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 12:52:19,756 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:19,761 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:52:19,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:52:19,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:52:19 BasicIcfg [2022-12-13 12:52:19,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:52:19,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:52:19,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:52:19,820 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:52:19,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:03" (3/4) ... [2022-12-13 12:52:19,823 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:52:19,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:52:19,823 INFO L158 Benchmark]: Toolchain (without parser) took 17441.23ms. Allocated memory was 73.4MB in the beginning and 174.1MB in the end (delta: 100.7MB). Free memory was 50.0MB in the beginning and 65.8MB in the end (delta: -15.8MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2022-12-13 12:52:19,824 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:52:19,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.80ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 39.7MB in the end (delta: 10.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-12-13 12:52:19,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.53ms. Allocated memory is still 73.4MB. Free memory was 39.4MB in the beginning and 37.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:52:19,825 INFO L158 Benchmark]: Boogie Preprocessor took 22.31ms. Allocated memory is still 73.4MB. Free memory was 36.7MB in the beginning and 34.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:52:19,825 INFO L158 Benchmark]: RCFGBuilder took 658.03ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 34.4MB in the beginning and 40.4MB in the end (delta: -6.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-12-13 12:52:19,825 INFO L158 Benchmark]: TraceAbstraction took 16341.82ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 39.4MB in the beginning and 66.9MB in the end (delta: -27.4MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-12-13 12:52:19,825 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 174.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:52:19,827 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.11ms. Allocated memory is still 56.6MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.80ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 39.7MB in the end (delta: 10.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.53ms. Allocated memory is still 73.4MB. Free memory was 39.4MB in the beginning and 37.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.31ms. Allocated memory is still 73.4MB. Free memory was 36.7MB in the beginning and 34.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 658.03ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 34.4MB in the beginning and 40.4MB in the end (delta: -6.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16341.82ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 39.4MB in the beginning and 66.9MB in the end (delta: -27.4MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 174.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 131 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 6280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2582, independent: 2402, independent conditional: 0, independent unconditional: 2402, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1168, independent conditional: 0, independent unconditional: 1168, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2582, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 1207, unknown conditional: 0, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=0, t1849={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=1, t1849={3:0}, t1850={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=2, t1849={3:0}, t1850={7:0}, t1851={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=4, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={3:0}, t1850={7:0}, t1851={11:0}, weak$$choice0=4, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 849]: 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: 851]: 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, 153 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: 16.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 591 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 385 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1755 IncrementalHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 48 mSDtfsCounter, 1755 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=8, InterpolantAutomatonStates: 61, 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.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 167 ConstructedInterpolants, 14 QuantifiedInterpolants, 1760 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1591 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 12:52:19,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ec7fc2f-2d86-4454-ad3f-38ddcf10da55/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample