./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:01:29,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:01:29,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:01:29,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:01:29,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:01:29,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:01:29,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:01:29,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:01:29,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:01:29,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:01:29,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:01:29,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:01:29,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:01:29,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:01:29,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:01:29,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:01:29,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:01:29,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:01:29,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:01:29,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:01:29,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:01:29,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:01:29,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:01:29,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:01:29,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:01:29,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:01:29,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:01:29,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:01:29,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:01:29,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:01:29,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:01:29,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:01:29,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:01:29,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:01:29,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:01:29,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:01:29,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:01:29,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:01:29,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:01:29,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:01:29,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:01:29,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:01:29,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:01:29,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:01:29,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:01:29,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:01:29,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:01:29,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:01:29,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:01:29,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:01:29,925 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:01:29,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:01:29,926 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:01:29,927 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:01:29,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:01:29,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:01:29,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:01:29,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:01:29,928 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:01:29,928 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:01:29,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:01:29,929 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:01:29,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:01:29,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:01:29,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:01:29,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:01:29,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:01:29,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:01:29,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:01:29,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:01:29,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:01:29,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:01:29,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:01:29,932 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:01:29,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:01:29,933 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_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 [2022-11-25 17:01:30,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:01:30,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:01:30,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:01:30,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:01:30,247 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:01:30,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix046.oepc.i [2022-11-25 17:01:33,226 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:01:33,579 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:01:33,580 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/sv-benchmarks/c/pthread-wmm/mix046.oepc.i [2022-11-25 17:01:33,598 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data/9e07b5de9/4ab362b879e2497d889fc83ad0a15be3/FLAG58c1b6f00 [2022-11-25 17:01:33,614 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data/9e07b5de9/4ab362b879e2497d889fc83ad0a15be3 [2022-11-25 17:01:33,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:01:33,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:01:33,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:01:33,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:01:33,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:01:33,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:01:33" (1/1) ... [2022-11-25 17:01:33,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62564c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:33, skipping insertion in model container [2022-11-25 17:01:33,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:01:33" (1/1) ... [2022-11-25 17:01:33,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:01:33,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:01:33,876 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_f699be79-442e-4b1c-be2c-09ac0684abc0/sv-benchmarks/c/pthread-wmm/mix046.oepc.i[945,958] [2022-11-25 17:01:34,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:01:34,231 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:01:34,247 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_f699be79-442e-4b1c-be2c-09ac0684abc0/sv-benchmarks/c/pthread-wmm/mix046.oepc.i[945,958] [2022-11-25 17:01:34,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:01:34,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:01:34,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:01:34,369 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:01:34,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34 WrapperNode [2022-11-25 17:01:34,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:01:34,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:01:34,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:01:34,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:01:34,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,452 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-25 17:01:34,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:01:34,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:01:34,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:01:34,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:01:34,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:01:34,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:01:34,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:01:34,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:01:34,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (1/1) ... [2022-11-25 17:01:34,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:01:34,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:01:34,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:01:34,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:01:34,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:01:34,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:01:34,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:01:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:01:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:01:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:01:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:01:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:01:34,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:01:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:01:34,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:01:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:01:34,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:01:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:01:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:01:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:01:34,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:01:34,616 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:01:34,835 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:01:34,837 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:01:35,358 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:01:35,545 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:01:35,545 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:01:35,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:01:35 BoogieIcfgContainer [2022-11-25 17:01:35,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:01:35,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:01:35,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:01:35,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:01:35,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:01:33" (1/3) ... [2022-11-25 17:01:35,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc0ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:01:35, skipping insertion in model container [2022-11-25 17:01:35,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:01:34" (2/3) ... [2022-11-25 17:01:35,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc0ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:01:35, skipping insertion in model container [2022-11-25 17:01:35,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:01:35" (3/3) ... [2022-11-25 17:01:35,558 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2022-11-25 17:01:35,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:01:35,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:01:35,577 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:01:35,638 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:01:35,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 17:01:35,743 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 17:01:35,743 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:01:35,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:01:35,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 17:01:35,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-11-25 17:01:35,764 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:01:35,786 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 17:01:35,805 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 17:01:35,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-11-25 17:01:35,880 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 17:01:35,880 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:01:35,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:01:35,889 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-11-25 17:01:41,918 INFO L134 LiptonReduction]: Checked pairs total: 10548 [2022-11-25 17:01:41,918 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-25 17:01:41,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:01:41,943 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;@44c5b7c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:01:41,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:01:41,946 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:01:41,946 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:01:41,946 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:41,947 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:01:41,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:01:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash 633, now seen corresponding path program 1 times [2022-11-25 17:01:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:41,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271784221] [2022-11-25 17:01:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:42,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:42,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271784221] [2022-11-25 17:01:42,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271784221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:42,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:42,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:01:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108772523] [2022-11-25 17:01:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:42,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:01:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:42,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:01:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:01:42,119 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 296 [2022-11-25 17:01:42,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:42,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:42,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 296 [2022-11-25 17:01:42,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:44,247 INFO L130 PetriNetUnfolder]: 8719/11886 cut-off events. [2022-11-25 17:01:44,248 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-25 17:01:44,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23834 conditions, 11886 events. 8719/11886 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 62179 event pairs, 8719 based on Foata normal form. 0/10394 useless extension candidates. Maximal degree in co-relation 23822. Up to 11731 conditions per place. [2022-11-25 17:01:44,343 INFO L137 encePairwiseOnDemand]: 287/296 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 17:01:44,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-11-25 17:01:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:01:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:01:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2022-11-25 17:01:44,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5219594594594594 [2022-11-25 17:01:44,360 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2022-11-25 17:01:44,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2022-11-25 17:01:44,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:44,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2022-11-25 17:01:44,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:44,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:44,379 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:44,380 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 309 transitions. [2022-11-25 17:01:44,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-11-25 17:01:44,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:01:44,389 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-11-25 17:01:44,391 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-11-25 17:01:44,407 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-11-25 17:01:44,407 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-11-25 17:01:44,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:44,408 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:44,408 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:01:44,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:01:44,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:01:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash 623960, now seen corresponding path program 1 times [2022-11-25 17:01:44,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:44,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546953456] [2022-11-25 17:01:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:44,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:44,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-11-25 17:01:44,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:44,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546953456] [2022-11-25 17:01:44,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546953456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:44,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:44,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:01:44,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327565110] [2022-11-25 17:01:44,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:44,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:01:44,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:01:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:44,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2022-11-25 17:01:44,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:44,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:44,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2022-11-25 17:01:44,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:46,447 INFO L130 PetriNetUnfolder]: 6855/9897 cut-off events. [2022-11-25 17:01:46,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:01:46,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19334 conditions, 9897 events. 6855/9897 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 59782 event pairs, 1263 based on Foata normal form. 0/9239 useless extension candidates. Maximal degree in co-relation 19331. Up to 7399 conditions per place. [2022-11-25 17:01:46,512 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-11-25 17:01:46,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-11-25 17:01:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:01:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:01:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-11-25 17:01:46,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5123873873873874 [2022-11-25 17:01:46,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2022-11-25 17:01:46,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2022-11-25 17:01:46,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:46,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2022-11-25 17:01:46,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:46,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:46,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:46,527 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 455 transitions. [2022-11-25 17:01:46,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-11-25 17:01:46,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:01:46,529 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-11-25 17:01:46,530 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-11-25 17:01:46,531 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 17:01:46,533 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-11-25 17:01:46,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:46,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:46,535 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:46,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:01:46,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:01:46,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1822515433, now seen corresponding path program 1 times [2022-11-25 17:01:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:46,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490122971] [2022-11-25 17:01:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:47,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:47,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490122971] [2022-11-25 17:01:47,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490122971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:47,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:47,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:01:47,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958822761] [2022-11-25 17:01:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:47,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:01:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:47,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:01:47,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:01:47,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 296 [2022-11-25 17:01:47,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:47,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:47,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 296 [2022-11-25 17:01:47,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:49,425 INFO L130 PetriNetUnfolder]: 5879/7987 cut-off events. [2022-11-25 17:01:49,426 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2022-11-25 17:01:49,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16652 conditions, 7987 events. 5879/7987 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39289 event pairs, 584 based on Foata normal form. 0/7987 useless extension candidates. Maximal degree in co-relation 16648. Up to 5184 conditions per place. [2022-11-25 17:01:49,479 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 52 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2022-11-25 17:01:49,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 254 flow [2022-11-25 17:01:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:01:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:01:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2022-11-25 17:01:49,484 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42712355212355213 [2022-11-25 17:01:49,484 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2022-11-25 17:01:49,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2022-11-25 17:01:49,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:49,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2022-11-25 17:01:49,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:49,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:49,493 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:49,493 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 7 states and 885 transitions. [2022-11-25 17:01:49,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 254 flow [2022-11-25 17:01:49,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:01:49,496 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 76 flow [2022-11-25 17:01:49,497 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-11-25 17:01:49,500 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2022-11-25 17:01:49,500 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 76 flow [2022-11-25 17:01:49,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:49,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:49,501 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:49,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:01:49,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:01:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1822515479, now seen corresponding path program 1 times [2022-11-25 17:01:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:49,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628476997] [2022-11-25 17:01:49,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:49,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:49,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628476997] [2022-11-25 17:01:49,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628476997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:49,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:49,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:01:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645861778] [2022-11-25 17:01:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:49,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:01:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:49,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:01:49,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:49,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 296 [2022-11-25 17:01:49,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:49,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:49,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 296 [2022-11-25 17:01:49,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:53,864 INFO L130 PetriNetUnfolder]: 23995/32506 cut-off events. [2022-11-25 17:01:53,864 INFO L131 PetriNetUnfolder]: For 1115/1115 co-relation queries the response was YES. [2022-11-25 17:01:53,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67098 conditions, 32506 events. 23995/32506 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 178126 event pairs, 7613 based on Foata normal form. 1344/33850 useless extension candidates. Maximal degree in co-relation 67094. Up to 16107 conditions per place. [2022-11-25 17:01:54,025 INFO L137 encePairwiseOnDemand]: 286/296 looper letters, 47 selfloop transitions, 8 changer transitions 35/90 dead transitions. [2022-11-25 17:01:54,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 90 transitions, 396 flow [2022-11-25 17:01:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:01:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:01:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-11-25 17:01:54,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-11-25 17:01:54,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-11-25 17:01:54,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-11-25 17:01:54,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:54,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-11-25 17:01:54,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:54,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:54,036 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:54,036 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 76 flow. Second operand 5 states and 712 transitions. [2022-11-25 17:01:54,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 90 transitions, 396 flow [2022-11-25 17:01:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 90 transitions, 378 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-25 17:01:54,077 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 148 flow [2022-11-25 17:01:54,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-11-25 17:01:54,079 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-11-25 17:01:54,079 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 148 flow [2022-11-25 17:01:54,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:54,080 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:54,080 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:54,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:01:54,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:01:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash -663459661, now seen corresponding path program 1 times [2022-11-25 17:01:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:54,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671124823] [2022-11-25 17:01:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:54,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:54,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671124823] [2022-11-25 17:01:54,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671124823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:54,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:54,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593530772] [2022-11-25 17:01:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:54,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:01:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:54,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:01:54,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:54,310 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 296 [2022-11-25 17:01:54,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:54,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:54,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 296 [2022-11-25 17:01:54,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:57,872 INFO L130 PetriNetUnfolder]: 22465/30662 cut-off events. [2022-11-25 17:01:57,872 INFO L131 PetriNetUnfolder]: For 22389/22389 co-relation queries the response was YES. [2022-11-25 17:01:57,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84973 conditions, 30662 events. 22465/30662 cut-off events. For 22389/22389 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 169429 event pairs, 1814 based on Foata normal form. 1254/31916 useless extension candidates. Maximal degree in co-relation 84966. Up to 14881 conditions per place. [2022-11-25 17:01:58,080 INFO L137 encePairwiseOnDemand]: 286/296 looper letters, 59 selfloop transitions, 12 changer transitions 50/121 dead transitions. [2022-11-25 17:01:58,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 121 transitions, 704 flow [2022-11-25 17:01:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:01:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:01:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 983 transitions. [2022-11-25 17:01:58,085 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47442084942084944 [2022-11-25 17:01:58,085 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 983 transitions. [2022-11-25 17:01:58,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 983 transitions. [2022-11-25 17:01:58,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:58,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 983 transitions. [2022-11-25 17:01:58,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.42857142857142) internal successors, (983), 7 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:58,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:58,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:58,096 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 148 flow. Second operand 7 states and 983 transitions. [2022-11-25 17:01:58,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 121 transitions, 704 flow [2022-11-25 17:01:58,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 121 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:01:58,176 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 240 flow [2022-11-25 17:01:58,177 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2022-11-25 17:01:58,179 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-11-25 17:01:58,179 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 240 flow [2022-11-25 17:01:58,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:58,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:58,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:58,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:01:58,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:01:58,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -663420260, now seen corresponding path program 1 times [2022-11-25 17:01:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:58,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423557090] [2022-11-25 17:01:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:58,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423557090] [2022-11-25 17:01:58,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423557090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:58,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:58,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482215346] [2022-11-25 17:01:58,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:58,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:01:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:58,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:01:58,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:58,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 296 [2022-11-25 17:01:58,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:58,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:58,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 296 [2022-11-25 17:01:58,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:02,125 INFO L130 PetriNetUnfolder]: 21388/29195 cut-off events. [2022-11-25 17:02:02,125 INFO L131 PetriNetUnfolder]: For 59948/59948 co-relation queries the response was YES. [2022-11-25 17:02:02,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90453 conditions, 29195 events. 21388/29195 cut-off events. For 59948/59948 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 160452 event pairs, 2445 based on Foata normal form. 1114/30309 useless extension candidates. Maximal degree in co-relation 90441. Up to 14405 conditions per place. [2022-11-25 17:02:02,301 INFO L137 encePairwiseOnDemand]: 286/296 looper letters, 65 selfloop transitions, 18 changer transitions 44/127 dead transitions. [2022-11-25 17:02:02,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 832 flow [2022-11-25 17:02:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:02:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:02:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2022-11-25 17:02:02,309 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47586872586872586 [2022-11-25 17:02:02,309 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2022-11-25 17:02:02,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2022-11-25 17:02:02,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:02,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2022-11-25 17:02:02,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:02,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:02,317 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:02,317 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 240 flow. Second operand 7 states and 986 transitions. [2022-11-25 17:02:02,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 832 flow [2022-11-25 17:02:02,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 127 transitions, 824 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-25 17:02:02,530 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 363 flow [2022-11-25 17:02:02,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2022-11-25 17:02:02,534 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2022-11-25 17:02:02,534 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 363 flow [2022-11-25 17:02:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:02,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:02,535 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:02,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:02:02,535 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 907571730, now seen corresponding path program 1 times [2022-11-25 17:02:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412059481] [2022-11-25 17:02:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:02,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412059481] [2022-11-25 17:02:02,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412059481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:02,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:02,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:02:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834991579] [2022-11-25 17:02:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:02,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:02:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:02:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:02:02,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 296 [2022-11-25 17:02:02,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:02,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:02,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 296 [2022-11-25 17:02:02,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:06,825 INFO L130 PetriNetUnfolder]: 19743/26979 cut-off events. [2022-11-25 17:02:06,825 INFO L131 PetriNetUnfolder]: For 86406/86406 co-relation queries the response was YES. [2022-11-25 17:02:06,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91250 conditions, 26979 events. 19743/26979 cut-off events. For 86406/86406 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 144798 event pairs, 4001 based on Foata normal form. 1097/28076 useless extension candidates. Maximal degree in co-relation 91232. Up to 10313 conditions per place. [2022-11-25 17:02:07,025 INFO L137 encePairwiseOnDemand]: 287/296 looper letters, 74 selfloop transitions, 9 changer transitions 49/132 dead transitions. [2022-11-25 17:02:07,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 1039 flow [2022-11-25 17:02:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:02:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:02:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 976 transitions. [2022-11-25 17:02:07,030 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47104247104247104 [2022-11-25 17:02:07,031 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 976 transitions. [2022-11-25 17:02:07,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 976 transitions. [2022-11-25 17:02:07,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:07,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 976 transitions. [2022-11-25 17:02:07,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.42857142857142) internal successors, (976), 7 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:07,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:07,040 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:07,040 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 363 flow. Second operand 7 states and 976 transitions. [2022-11-25 17:02:07,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 1039 flow [2022-11-25 17:02:07,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 132 transitions, 1001 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-11-25 17:02:07,763 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 455 flow [2022-11-25 17:02:07,763 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2022-11-25 17:02:07,763 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2022-11-25 17:02:07,763 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 455 flow [2022-11-25 17:02:07,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:07,764 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:07,764 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:07,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:02:07,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash -258701186, now seen corresponding path program 1 times [2022-11-25 17:02:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:07,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906624662] [2022-11-25 17:02:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:07,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:07,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906624662] [2022-11-25 17:02:07,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906624662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:07,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:07,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:02:07,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958385266] [2022-11-25 17:02:07,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:07,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:02:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:07,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:02:07,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:02:07,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 17:02:07,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:07,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:07,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 17:02:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:09,605 INFO L130 PetriNetUnfolder]: 7765/11565 cut-off events. [2022-11-25 17:02:09,605 INFO L131 PetriNetUnfolder]: For 29504/30838 co-relation queries the response was YES. [2022-11-25 17:02:09,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36878 conditions, 11565 events. 7765/11565 cut-off events. For 29504/30838 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 68970 event pairs, 1650 based on Foata normal form. 707/12146 useless extension candidates. Maximal degree in co-relation 36859. Up to 9644 conditions per place. [2022-11-25 17:02:09,682 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 57 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2022-11-25 17:02:09,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 732 flow [2022-11-25 17:02:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:02:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:02:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-25 17:02:09,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2022-11-25 17:02:09,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-25 17:02:09,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-25 17:02:09,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:09,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-25 17:02:09,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:09,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:09,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:09,692 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 455 flow. Second operand 3 states and 438 transitions. [2022-11-25 17:02:09,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 732 flow [2022-11-25 17:02:09,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 82 transitions, 717 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 17:02:09,794 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 473 flow [2022-11-25 17:02:09,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2022-11-25 17:02:09,797 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2022-11-25 17:02:09,797 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 473 flow [2022-11-25 17:02:09,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:09,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:09,798 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:09,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:02:09,798 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash 593298208, now seen corresponding path program 1 times [2022-11-25 17:02:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:09,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436998207] [2022-11-25 17:02:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436998207] [2022-11-25 17:02:10,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436998207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:10,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:10,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:02:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90565717] [2022-11-25 17:02:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:10,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:02:10,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:10,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:02:10,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:02:10,038 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 296 [2022-11-25 17:02:10,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:10,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:10,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 296 [2022-11-25 17:02:10,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:12,925 INFO L130 PetriNetUnfolder]: 12579/18872 cut-off events. [2022-11-25 17:02:12,926 INFO L131 PetriNetUnfolder]: For 43186/44259 co-relation queries the response was YES. [2022-11-25 17:02:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64749 conditions, 18872 events. 12579/18872 cut-off events. For 43186/44259 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 121676 event pairs, 4809 based on Foata normal form. 690/19428 useless extension candidates. Maximal degree in co-relation 64730. Up to 9098 conditions per place. [2022-11-25 17:02:13,036 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 57 selfloop transitions, 10 changer transitions 30/108 dead transitions. [2022-11-25 17:02:13,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 897 flow [2022-11-25 17:02:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:02:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:02:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2022-11-25 17:02:13,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4925675675675676 [2022-11-25 17:02:13,039 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 729 transitions. [2022-11-25 17:02:13,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 729 transitions. [2022-11-25 17:02:13,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:13,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 729 transitions. [2022-11-25 17:02:13,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:13,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:13,045 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:13,045 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 473 flow. Second operand 5 states and 729 transitions. [2022-11-25 17:02:13,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 897 flow [2022-11-25 17:02:13,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 882 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:02:13,143 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 468 flow [2022-11-25 17:02:13,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=468, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2022-11-25 17:02:13,143 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2022-11-25 17:02:13,144 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 468 flow [2022-11-25 17:02:13,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:13,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:13,144 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:13,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:02:13,145 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1760931666, now seen corresponding path program 1 times [2022-11-25 17:02:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:13,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841844285] [2022-11-25 17:02:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841844285] [2022-11-25 17:02:13,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841844285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:13,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:13,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:02:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789589184] [2022-11-25 17:02:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:13,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:02:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:02:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:02:13,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 17:02:13,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 468 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:13,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:13,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 17:02:13,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:14,441 INFO L130 PetriNetUnfolder]: 5178/8267 cut-off events. [2022-11-25 17:02:14,442 INFO L131 PetriNetUnfolder]: For 16964/17531 co-relation queries the response was YES. [2022-11-25 17:02:14,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27879 conditions, 8267 events. 5178/8267 cut-off events. For 16964/17531 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 52281 event pairs, 1070 based on Foata normal form. 740/8889 useless extension candidates. Maximal degree in co-relation 27859. Up to 3933 conditions per place. [2022-11-25 17:02:14,487 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 78 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2022-11-25 17:02:14,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 966 flow [2022-11-25 17:02:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:02:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:02:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-11-25 17:02:14,490 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49493243243243246 [2022-11-25 17:02:14,490 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2022-11-25 17:02:14,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2022-11-25 17:02:14,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:14,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2022-11-25 17:02:14,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 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-11-25 17:02:14,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:14,495 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:14,495 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 468 flow. Second operand 4 states and 586 transitions. [2022-11-25 17:02:14,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 966 flow [2022-11-25 17:02:14,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 938 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-25 17:02:14,526 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 504 flow [2022-11-25 17:02:14,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=504, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2022-11-25 17:02:14,527 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2022-11-25 17:02:14,527 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 504 flow [2022-11-25 17:02:14,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:14,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:14,528 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:14,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:02:14,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 289544415, now seen corresponding path program 1 times [2022-11-25 17:02:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:14,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473944715] [2022-11-25 17:02:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:14,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:14,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473944715] [2022-11-25 17:02:14,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473944715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:14,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:14,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:02:14,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695088036] [2022-11-25 17:02:14,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:14,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:02:14,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:14,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:02:14,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:02:14,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 17:02:14,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:14,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:14,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 17:02:14,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:15,958 INFO L130 PetriNetUnfolder]: 3750/5980 cut-off events. [2022-11-25 17:02:15,958 INFO L131 PetriNetUnfolder]: For 13908/14277 co-relation queries the response was YES. [2022-11-25 17:02:15,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22477 conditions, 5980 events. 3750/5980 cut-off events. For 13908/14277 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 36553 event pairs, 834 based on Foata normal form. 381/6250 useless extension candidates. Maximal degree in co-relation 22458. Up to 2294 conditions per place. [2022-11-25 17:02:15,996 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 92 selfloop transitions, 13 changer transitions 0/122 dead transitions. [2022-11-25 17:02:15,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 122 transitions, 1117 flow [2022-11-25 17:02:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:02:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:02:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 732 transitions. [2022-11-25 17:02:15,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2022-11-25 17:02:15,999 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 732 transitions. [2022-11-25 17:02:15,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 732 transitions. [2022-11-25 17:02:16,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:16,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 732 transitions. [2022-11-25 17:02:16,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:16,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:16,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:16,005 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 504 flow. Second operand 5 states and 732 transitions. [2022-11-25 17:02:16,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 122 transitions, 1117 flow [2022-11-25 17:02:16,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 122 transitions, 1097 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-25 17:02:16,033 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 552 flow [2022-11-25 17:02:16,033 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=552, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2022-11-25 17:02:16,034 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2022-11-25 17:02:16,034 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 552 flow [2022-11-25 17:02:16,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:16,034 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:16,034 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:16,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:02:16,035 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash 331840397, now seen corresponding path program 1 times [2022-11-25 17:02:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:16,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473980408] [2022-11-25 17:02:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:17,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:17,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473980408] [2022-11-25 17:02:17,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473980408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:17,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:17,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:02:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577385459] [2022-11-25 17:02:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:17,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:02:17,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:17,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:02:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:02:17,282 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 296 [2022-11-25 17:02:17,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 552 flow. Second operand has 8 states, 8 states have (on average 131.75) internal successors, (1054), 8 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:17,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:17,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 296 [2022-11-25 17:02:17,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:19,115 INFO L130 PetriNetUnfolder]: 6037/9759 cut-off events. [2022-11-25 17:02:19,115 INFO L131 PetriNetUnfolder]: For 28678/29252 co-relation queries the response was YES. [2022-11-25 17:02:19,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38679 conditions, 9759 events. 6037/9759 cut-off events. For 28678/29252 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 66051 event pairs, 1096 based on Foata normal form. 208/9866 useless extension candidates. Maximal degree in co-relation 38659. Up to 3626 conditions per place. [2022-11-25 17:02:19,174 INFO L137 encePairwiseOnDemand]: 288/296 looper letters, 116 selfloop transitions, 7 changer transitions 60/200 dead transitions. [2022-11-25 17:02:19,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 200 transitions, 1888 flow [2022-11-25 17:02:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:02:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:02:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1131 transitions. [2022-11-25 17:02:19,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47761824324324326 [2022-11-25 17:02:19,178 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1131 transitions. [2022-11-25 17:02:19,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1131 transitions. [2022-11-25 17:02:19,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:19,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1131 transitions. [2022-11-25 17:02:19,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 141.375) internal successors, (1131), 8 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:19,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:19,187 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:19,187 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 552 flow. Second operand 8 states and 1131 transitions. [2022-11-25 17:02:19,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 200 transitions, 1888 flow [2022-11-25 17:02:19,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 200 transitions, 1730 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-11-25 17:02:19,381 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 559 flow [2022-11-25 17:02:19,382 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=559, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2022-11-25 17:02:19,382 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2022-11-25 17:02:19,382 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 559 flow [2022-11-25 17:02:19,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.75) internal successors, (1054), 8 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:19,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:19,383 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:19,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:02:19,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1430070985, now seen corresponding path program 2 times [2022-11-25 17:02:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:19,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940882429] [2022-11-25 17:02:19,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:19,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-11-25 17:02:19,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:19,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940882429] [2022-11-25 17:02:19,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940882429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:19,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:19,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:02:19,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812110572] [2022-11-25 17:02:19,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:19,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:02:19,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:02:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:02:19,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 17:02:19,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 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-11-25 17:02:19,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:19,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 17:02:19,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:21,043 INFO L130 PetriNetUnfolder]: 4577/7360 cut-off events. [2022-11-25 17:02:21,044 INFO L131 PetriNetUnfolder]: For 19273/19700 co-relation queries the response was YES. [2022-11-25 17:02:21,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28969 conditions, 7360 events. 4577/7360 cut-off events. For 19273/19700 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 48465 event pairs, 812 based on Foata normal form. 210/7446 useless extension candidates. Maximal degree in co-relation 28946. Up to 2938 conditions per place. [2022-11-25 17:02:21,101 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 91 selfloop transitions, 17 changer transitions 11/133 dead transitions. [2022-11-25 17:02:21,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 133 transitions, 1237 flow [2022-11-25 17:02:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:02:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:02:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 863 transitions. [2022-11-25 17:02:21,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48592342342342343 [2022-11-25 17:02:21,104 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 863 transitions. [2022-11-25 17:02:21,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 863 transitions. [2022-11-25 17:02:21,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:21,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 863 transitions. [2022-11-25 17:02:21,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:21,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:21,111 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:21,111 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 559 flow. Second operand 6 states and 863 transitions. [2022-11-25 17:02:21,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 133 transitions, 1237 flow [2022-11-25 17:02:21,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 1221 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-25 17:02:21,354 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 533 flow [2022-11-25 17:02:21,355 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2022-11-25 17:02:21,355 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2022-11-25 17:02:21,355 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 533 flow [2022-11-25 17:02:21,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 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-11-25 17:02:21,356 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:21,356 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:21,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:02:21,356 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash 993345629, now seen corresponding path program 1 times [2022-11-25 17:02:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:21,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575600920] [2022-11-25 17:02:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:22,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575600920] [2022-11-25 17:02:22,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575600920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:22,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:22,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:02:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662245748] [2022-11-25 17:02:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:22,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:02:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:02:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:02:22,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 296 [2022-11-25 17:02:22,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 533 flow. Second operand has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:22,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:22,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 296 [2022-11-25 17:02:22,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:23,914 INFO L130 PetriNetUnfolder]: 2973/4777 cut-off events. [2022-11-25 17:02:23,914 INFO L131 PetriNetUnfolder]: For 18051/18570 co-relation queries the response was YES. [2022-11-25 17:02:23,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21129 conditions, 4777 events. 2973/4777 cut-off events. For 18051/18570 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29067 event pairs, 335 based on Foata normal form. 185/4905 useless extension candidates. Maximal degree in co-relation 21108. Up to 1773 conditions per place. [2022-11-25 17:02:23,946 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 132 selfloop transitions, 4 changer transitions 27/177 dead transitions. [2022-11-25 17:02:23,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 177 transitions, 1737 flow [2022-11-25 17:02:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:02:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:02:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 996 transitions. [2022-11-25 17:02:23,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4806949806949807 [2022-11-25 17:02:23,950 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 996 transitions. [2022-11-25 17:02:23,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 996 transitions. [2022-11-25 17:02:23,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:23,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 996 transitions. [2022-11-25 17:02:23,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:23,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:23,957 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:23,958 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 533 flow. Second operand 7 states and 996 transitions. [2022-11-25 17:02:23,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 177 transitions, 1737 flow [2022-11-25 17:02:24,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 177 transitions, 1454 flow, removed 58 selfloop flow, removed 9 redundant places. [2022-11-25 17:02:24,062 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 452 flow [2022-11-25 17:02:24,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2022-11-25 17:02:24,062 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2022-11-25 17:02:24,063 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 452 flow [2022-11-25 17:02:24,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:24,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:24,064 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:24,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:02:24,064 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1496570543, now seen corresponding path program 2 times [2022-11-25 17:02:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:24,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440648881] [2022-11-25 17:02:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440648881] [2022-11-25 17:02:24,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440648881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:24,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:24,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:02:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525644026] [2022-11-25 17:02:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:24,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:02:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:24,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:02:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:02:24,343 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 17:02:24,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:24,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:24,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 17:02:24,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:25,477 INFO L130 PetriNetUnfolder]: 4146/6827 cut-off events. [2022-11-25 17:02:25,477 INFO L131 PetriNetUnfolder]: For 22132/22224 co-relation queries the response was YES. [2022-11-25 17:02:25,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27656 conditions, 6827 events. 4146/6827 cut-off events. For 22132/22224 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 43272 event pairs, 1535 based on Foata normal form. 67/6828 useless extension candidates. Maximal degree in co-relation 27636. Up to 3444 conditions per place. [2022-11-25 17:02:25,499 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 52 selfloop transitions, 1 changer transitions 56/117 dead transitions. [2022-11-25 17:02:25,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 117 transitions, 1003 flow [2022-11-25 17:02:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:02:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:02:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-11-25 17:02:25,502 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-11-25 17:02:25,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-11-25 17:02:25,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-11-25 17:02:25,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:25,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-11-25 17:02:25,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:25,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:25,507 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:25,508 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 452 flow. Second operand 5 states and 712 transitions. [2022-11-25 17:02:25,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 117 transitions, 1003 flow [2022-11-25 17:02:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 117 transitions, 968 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-11-25 17:02:25,660 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 390 flow [2022-11-25 17:02:25,660 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=390, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2022-11-25 17:02:25,661 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2022-11-25 17:02:25,661 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 390 flow [2022-11-25 17:02:25,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:25,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:25,661 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:25,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:02:25,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1959414625, now seen corresponding path program 3 times [2022-11-25 17:02:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:25,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375183946] [2022-11-25 17:02:25,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:02:25,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:02:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:02:25,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:02:25,880 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:02:25,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 17:02:25,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 17:02:25,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 17:02:25,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 17:02:25,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 17:02:25,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 17:02:25,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 17:02:25,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 17:02:25,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 17:02:25,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 17:02:25,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 17:02:25,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 17:02:25,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 17:02:25,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 17:02:25,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 17:02:25,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 17:02:25,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:02:25,891 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:25,897 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:02:25,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:02:25,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:02:25 BasicIcfg [2022-11-25 17:02:25,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:02:25,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:02:25,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:02:25,982 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:02:25,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:01:35" (3/4) ... [2022-11-25 17:02:25,985 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:02:25,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:02:25,986 INFO L158 Benchmark]: Toolchain (without parser) took 52367.90ms. Allocated memory was 169.9MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 137.4MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-25 17:02:25,986 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:02:25,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.30ms. Allocated memory is still 169.9MB. Free memory was 136.7MB in the beginning and 108.7MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:02:25,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.04ms. Allocated memory is still 169.9MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:02:25,987 INFO L158 Benchmark]: Boogie Preprocessor took 42.12ms. Allocated memory is still 169.9MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:02:25,988 INFO L158 Benchmark]: RCFGBuilder took 1051.64ms. Allocated memory is still 169.9MB. Free memory was 103.9MB in the beginning and 125.1MB in the end (delta: -21.2MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2022-11-25 17:02:25,988 INFO L158 Benchmark]: TraceAbstraction took 50431.14ms. Allocated memory was 169.9MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 124.9MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-25 17:02:25,988 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 9.1GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 2.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:02:25,990 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.27ms. Allocated memory is still 134.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 750.30ms. Allocated memory is still 169.9MB. Free memory was 136.7MB in the beginning and 108.7MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.04ms. Allocated memory is still 169.9MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.12ms. Allocated memory is still 169.9MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1051.64ms. Allocated memory is still 169.9MB. Free memory was 103.9MB in the beginning and 125.1MB in the end (delta: -21.2MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 50431.14ms. Allocated memory was 169.9MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 124.9MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 9.1GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 2.8kB). 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, 158 PlacesBefore, 53 PlacesAfterwards, 147 TransitionsBefore, 41 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 10548 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4574, independent: 4344, independent conditional: 0, independent unconditional: 4344, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2457, independent: 2400, independent conditional: 0, independent unconditional: 2400, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2457, independent: 2366, independent conditional: 0, independent unconditional: 2366, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 417, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4574, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 2457, unknown conditional: 0, unknown unconditional: 2457] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1217, ((void *)0), P0, ((void *)0))=-3, t1217={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1218, ((void *)0), P1, ((void *)0))=-2, t1217={5:0}, t1218={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1219; [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1219, ((void *)0), P2, ((void *)0))=-1, t1217={5:0}, t1218={6:0}, t1219={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1220; [L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1220, ((void *)0), P3, ((void *)0))=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 189 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 50.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1071 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 926 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 434 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2776 IncrementalHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 66 mSDtfsCounter, 2776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred in iteration=12, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 2048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:02:26,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:02:28,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:02:28,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:02:28,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:02:28,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:02:28,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:02:28,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:02:28,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:02:28,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:02:28,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:02:28,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:02:28,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:02:28,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:02:28,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:02:28,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:02:28,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:02:28,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:02:28,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:02:28,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:02:28,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:02:28,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:02:28,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:02:28,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:02:28,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:02:28,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:02:28,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:02:28,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:02:28,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:02:28,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:02:28,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:02:28,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:02:28,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:02:28,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:02:28,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:02:28,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:02:28,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:02:28,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:02:28,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:02:28,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:02:28,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:02:28,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:02:28,943 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:02:28,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:02:28,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:02:28,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:02:28,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:02:28,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:02:28,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:02:28,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:02:28,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:02:28,970 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:02:28,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:02:28,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:02:28,971 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:02:28,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:02:28,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:02:28,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:02:28,972 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:02:28,972 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:02:28,972 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:02:28,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:02:28,973 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:02:28,973 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:02:28,973 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:02:28,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:02:28,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:02:28,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:02:28,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:02:28,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:02:28,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:02:28,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:02:28,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:02:28,975 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:02:28,976 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:02:28,976 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:02:28,976 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:02:28,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:02:28,977 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:02:28,977 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_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 [2022-11-25 17:02:29,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:02:29,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:02:29,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:02:29,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:02:29,377 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:02:29,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix046.oepc.i [2022-11-25 17:02:32,406 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:02:32,715 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:02:32,715 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/sv-benchmarks/c/pthread-wmm/mix046.oepc.i [2022-11-25 17:02:32,737 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data/9f58108a8/c2b0d419e31741229517e32f6c48cb22/FLAG4383964d1 [2022-11-25 17:02:32,753 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/data/9f58108a8/c2b0d419e31741229517e32f6c48cb22 [2022-11-25 17:02:32,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:02:32,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:02:32,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:02:32,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:02:32,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:02:32,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b93237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32, skipping insertion in model container [2022-11-25 17:02:32,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:02:32,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:02:33,026 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_f699be79-442e-4b1c-be2c-09ac0684abc0/sv-benchmarks/c/pthread-wmm/mix046.oepc.i[945,958] [2022-11-25 17:02:33,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:02:33,304 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:02:33,317 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_f699be79-442e-4b1c-be2c-09ac0684abc0/sv-benchmarks/c/pthread-wmm/mix046.oepc.i[945,958] [2022-11-25 17:02:33,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:02:33,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:02:33,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:02:33,495 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:02:33,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33 WrapperNode [2022-11-25 17:02:33,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:02:33,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:02:33,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:02:33,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:02:33,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,552 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-25 17:02:33,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:02:33,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:02:33,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:02:33,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:02:33,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,608 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:02:33,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:02:33,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:02:33,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:02:33,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (1/1) ... [2022-11-25 17:02:33,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:02:33,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:02:33,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:02:33,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:02:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:02:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:02:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:02:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:02:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:02:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:02:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:02:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:02:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:02:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:02:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:02:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:02:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:02:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:02:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:02:33,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:02:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:02:33,740 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:02:33,970 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:02:33,972 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:02:34,554 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:02:34,713 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:02:34,714 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:02:34,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:02:34 BoogieIcfgContainer [2022-11-25 17:02:34,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:02:34,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:02:34,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:02:34,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:02:34,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:02:32" (1/3) ... [2022-11-25 17:02:34,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fb18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:02:34, skipping insertion in model container [2022-11-25 17:02:34,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:33" (2/3) ... [2022-11-25 17:02:34,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fb18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:02:34, skipping insertion in model container [2022-11-25 17:02:34,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:02:34" (3/3) ... [2022-11-25 17:02:34,725 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2022-11-25 17:02:34,744 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:02:34,745 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:02:34,745 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:02:34,837 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:02:34,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-11-25 17:02:35,020 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-25 17:02:35,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:02:35,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:02:35,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-11-25 17:02:35,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-11-25 17:02:35,038 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:02:35,053 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-11-25 17:02:35,056 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-11-25 17:02:35,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-11-25 17:02:35,097 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-25 17:02:35,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:02:35,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:02:35,102 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-11-25 17:02:45,607 INFO L134 LiptonReduction]: Checked pairs total: 10550 [2022-11-25 17:02:45,607 INFO L136 LiptonReduction]: Total number of compositions: 146 [2022-11-25 17:02:45,624 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:02:45,636 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;@11c81fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:02:45,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:02:45,639 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:02:45,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:02:45,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:45,640 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:02:45,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 637, now seen corresponding path program 1 times [2022-11-25 17:02:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:45,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524030318] [2022-11-25 17:02:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:45,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:45,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:45,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:45,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:02:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:45,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:02:45,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:45,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:45,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:45,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524030318] [2022-11-25 17:02:45,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524030318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:45,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:45,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:02:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484294360] [2022-11-25 17:02:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:45,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:02:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:45,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:02:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:02:45,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 298 [2022-11-25 17:02:45,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:45,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:45,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 298 [2022-11-25 17:02:45,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:48,211 INFO L130 PetriNetUnfolder]: 8719/11885 cut-off events. [2022-11-25 17:02:48,211 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 17:02:48,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23833 conditions, 11885 events. 8719/11885 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 62241 event pairs, 8719 based on Foata normal form. 0/10392 useless extension candidates. Maximal degree in co-relation 23821. Up to 11731 conditions per place. [2022-11-25 17:02:48,303 INFO L137 encePairwiseOnDemand]: 289/298 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 17:02:48,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2022-11-25 17:02:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:02:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:02:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 311 transitions. [2022-11-25 17:02:48,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5218120805369127 [2022-11-25 17:02:48,319 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 311 transitions. [2022-11-25 17:02:48,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 311 transitions. [2022-11-25 17:02:48,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:48,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 311 transitions. [2022-11-25 17:02:48,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:48,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:48,333 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:48,335 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 311 transitions. [2022-11-25 17:02:48,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2022-11-25 17:02:48,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:02:48,342 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-11-25 17:02:48,345 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-11-25 17:02:48,349 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-11-25 17:02:48,349 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-11-25 17:02:48,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:48,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:48,350 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:02:48,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 17:02:48,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:48,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash 627868, now seen corresponding path program 1 times [2022-11-25 17:02:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:48,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971136735] [2022-11-25 17:02:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:48,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:48,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:02:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:48,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:02:48,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:48,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:48,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:48,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971136735] [2022-11-25 17:02:48,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971136735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:48,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:48,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:02:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638868169] [2022-11-25 17:02:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:48,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:02:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:02:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:02:48,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 298 [2022-11-25 17:02:48,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:48,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:48,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 298 [2022-11-25 17:02:48,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:50,367 INFO L130 PetriNetUnfolder]: 6855/9365 cut-off events. [2022-11-25 17:02:50,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:02:50,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18802 conditions, 9365 events. 6855/9365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 46864 event pairs, 3527 based on Foata normal form. 0/8707 useless extension candidates. Maximal degree in co-relation 18799. Up to 7399 conditions per place. [2022-11-25 17:02:50,427 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-11-25 17:02:50,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2022-11-25 17:02:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:02:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:02:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2022-11-25 17:02:50,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5123042505592841 [2022-11-25 17:02:50,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2022-11-25 17:02:50,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2022-11-25 17:02:50,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:50,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2022-11-25 17:02:50,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:50,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:50,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:50,454 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 458 transitions. [2022-11-25 17:02:50,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2022-11-25 17:02:50,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:02:50,456 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-11-25 17:02:50,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-11-25 17:02:50,457 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 17:02:50,457 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-11-25 17:02:50,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:50,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:50,458 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:50,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-25 17:02:50,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:50,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:50,672 INFO L85 PathProgramCache]: Analyzing trace with hash 286385471, now seen corresponding path program 1 times [2022-11-25 17:02:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:50,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165587320] [2022-11-25 17:02:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:50,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:50,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:50,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:50,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:02:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:50,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:02:50,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:50,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:50,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:50,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165587320] [2022-11-25 17:02:50,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165587320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:50,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:50,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:02:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779948875] [2022-11-25 17:02:50,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:50,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:02:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:02:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:02:50,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2022-11-25 17:02:50,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:50,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:50,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2022-11-25 17:02:50,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:51,861 INFO L130 PetriNetUnfolder]: 3719/5317 cut-off events. [2022-11-25 17:02:51,862 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-11-25 17:02:51,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11102 conditions, 5317 events. 3719/5317 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27433 event pairs, 803 based on Foata normal form. 108/5195 useless extension candidates. Maximal degree in co-relation 11098. Up to 4756 conditions per place. [2022-11-25 17:02:51,896 INFO L137 encePairwiseOnDemand]: 292/298 looper letters, 40 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2022-11-25 17:02:51,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 208 flow [2022-11-25 17:02:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:02:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:02:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-25 17:02:51,899 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49440715883668906 [2022-11-25 17:02:51,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-25 17:02:51,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-25 17:02:51,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:51,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-25 17:02:51,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:51,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:51,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:51,910 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 442 transitions. [2022-11-25 17:02:51,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 208 flow [2022-11-25 17:02:51,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:02:51,913 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 101 flow [2022-11-25 17:02:51,913 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-11-25 17:02:51,915 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 17:02:51,916 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2022-11-25 17:02:51,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:51,916 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:51,917 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:51,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:52,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:52,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1742775706, now seen corresponding path program 1 times [2022-11-25 17:02:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:52,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121432786] [2022-11-25 17:02:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:52,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:52,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:52,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:02:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:52,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:02:52,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:52,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:52,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:52,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121432786] [2022-11-25 17:02:52,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121432786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:52,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:52,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:02:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690085097] [2022-11-25 17:02:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:52,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:02:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:52,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:02:52,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:02:52,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2022-11-25 17:02:52,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:52,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:52,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2022-11-25 17:02:52,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:52,893 INFO L130 PetriNetUnfolder]: 1694/2617 cut-off events. [2022-11-25 17:02:52,894 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2022-11-25 17:02:52,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6274 conditions, 2617 events. 1694/2617 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13270 event pairs, 402 based on Foata normal form. 135/2657 useless extension candidates. Maximal degree in co-relation 6269. Up to 1426 conditions per place. [2022-11-25 17:02:52,910 INFO L137 encePairwiseOnDemand]: 292/298 looper letters, 53 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-11-25 17:02:52,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 307 flow [2022-11-25 17:02:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:02:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:02:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2022-11-25 17:02:52,913 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49580536912751677 [2022-11-25 17:02:52,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2022-11-25 17:02:52,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2022-11-25 17:02:52,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:52,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2022-11-25 17:02:52,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:52,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:52,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:52,920 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 4 states and 591 transitions. [2022-11-25 17:02:52,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 307 flow [2022-11-25 17:02:52,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:02:52,922 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 148 flow [2022-11-25 17:02:52,923 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-11-25 17:02:52,923 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2022-11-25 17:02:52,924 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 148 flow [2022-11-25 17:02:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:52,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:52,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:52,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:53,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:53,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash 744297315, now seen corresponding path program 1 times [2022-11-25 17:02:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:53,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277347533] [2022-11-25 17:02:53,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:53,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:53,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:53,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:53,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:02:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:53,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:02:53,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:53,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:53,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:53,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277347533] [2022-11-25 17:02:53,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277347533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:53,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:53,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:02:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243004154] [2022-11-25 17:02:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:53,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:02:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:02:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:02:53,411 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2022-11-25 17:02:53,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:53,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:53,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2022-11-25 17:02:53,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:53,966 INFO L130 PetriNetUnfolder]: 1064/1672 cut-off events. [2022-11-25 17:02:53,967 INFO L131 PetriNetUnfolder]: For 1119/1119 co-relation queries the response was YES. [2022-11-25 17:02:53,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4543 conditions, 1672 events. 1064/1672 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8049 event pairs, 331 based on Foata normal form. 63/1703 useless extension candidates. Maximal degree in co-relation 4537. Up to 630 conditions per place. [2022-11-25 17:02:53,977 INFO L137 encePairwiseOnDemand]: 292/298 looper letters, 64 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2022-11-25 17:02:53,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 416 flow [2022-11-25 17:02:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:02:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:02:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2022-11-25 17:02:53,981 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49530201342281877 [2022-11-25 17:02:53,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2022-11-25 17:02:53,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2022-11-25 17:02:53,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:53,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2022-11-25 17:02:53,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:53,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:53,989 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:53,989 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 148 flow. Second operand 5 states and 738 transitions. [2022-11-25 17:02:53,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 416 flow [2022-11-25 17:02:53,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 398 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:02:53,995 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 198 flow [2022-11-25 17:02:53,996 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-11-25 17:02:53,997 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-11-25 17:02:53,997 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 198 flow [2022-11-25 17:02:53,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:53,998 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:53,998 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:54,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:54,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:54,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1612579931, now seen corresponding path program 1 times [2022-11-25 17:02:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:54,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149896634] [2022-11-25 17:02:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:54,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:54,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:54,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:54,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:02:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:54,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:02:54,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:54,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:54,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:54,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149896634] [2022-11-25 17:02:54,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149896634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:54,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:54,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:02:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196893231] [2022-11-25 17:02:54,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:54,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:02:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:02:54,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:02:54,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2022-11-25 17:02:54,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:54,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:54,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2022-11-25 17:02:54,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:55,043 INFO L130 PetriNetUnfolder]: 999/1542 cut-off events. [2022-11-25 17:02:55,044 INFO L131 PetriNetUnfolder]: For 1282/1282 co-relation queries the response was YES. [2022-11-25 17:02:55,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 1542 events. 999/1542 cut-off events. For 1282/1282 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7388 event pairs, 326 based on Foata normal form. 13/1536 useless extension candidates. Maximal degree in co-relation 4343. Up to 630 conditions per place. [2022-11-25 17:02:55,054 INFO L137 encePairwiseOnDemand]: 292/298 looper letters, 60 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2022-11-25 17:02:55,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 442 flow [2022-11-25 17:02:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:02:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:02:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2022-11-25 17:02:55,058 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4865771812080537 [2022-11-25 17:02:55,058 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 870 transitions. [2022-11-25 17:02:55,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 870 transitions. [2022-11-25 17:02:55,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:55,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 870 transitions. [2022-11-25 17:02:55,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:55,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:55,066 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:55,066 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 198 flow. Second operand 6 states and 870 transitions. [2022-11-25 17:02:55,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 442 flow [2022-11-25 17:02:55,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 408 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 17:02:55,089 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 208 flow [2022-11-25 17:02:55,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-11-25 17:02:55,090 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 17:02:55,090 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 208 flow [2022-11-25 17:02:55,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:55,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:55,091 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:55,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:55,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:55,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1379824608, now seen corresponding path program 1 times [2022-11-25 17:02:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:55,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707404797] [2022-11-25 17:02:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:55,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:55,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:02:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:55,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 17:02:55,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:56,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:56,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:56,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707404797] [2022-11-25 17:02:56,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707404797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:56,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:56,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:02:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009562599] [2022-11-25 17:02:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:56,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:02:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:02:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:02:56,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 298 [2022-11-25 17:02:56,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:56,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:56,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 298 [2022-11-25 17:02:56,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:57,571 INFO L130 PetriNetUnfolder]: 999/1577 cut-off events. [2022-11-25 17:02:57,571 INFO L131 PetriNetUnfolder]: For 1977/1977 co-relation queries the response was YES. [2022-11-25 17:02:57,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 1577 events. 999/1577 cut-off events. For 1977/1977 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7816 event pairs, 0 based on Foata normal form. 0/1577 useless extension candidates. Maximal degree in co-relation 4462. Up to 1252 conditions per place. [2022-11-25 17:02:57,584 INFO L137 encePairwiseOnDemand]: 293/298 looper letters, 59 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2022-11-25 17:02:57,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 465 flow [2022-11-25 17:02:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:02:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:02:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2022-11-25 17:02:57,588 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4172259507829978 [2022-11-25 17:02:57,589 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2022-11-25 17:02:57,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2022-11-25 17:02:57,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:57,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2022-11-25 17:02:57,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:57,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:57,598 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:57,598 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 208 flow. Second operand 6 states and 746 transitions. [2022-11-25 17:02:57,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 465 flow [2022-11-25 17:02:57,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 390 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-25 17:02:57,607 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 164 flow [2022-11-25 17:02:57,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-25 17:02:57,608 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 17:02:57,609 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 164 flow [2022-11-25 17:02:57,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:57,610 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:57,610 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:57,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-25 17:02:57,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:57,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1009211184, now seen corresponding path program 1 times [2022-11-25 17:02:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:57,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747746561] [2022-11-25 17:02:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:57,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:57,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:57,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:57,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:02:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:57,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:02:58,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:58,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:02:58,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747746561] [2022-11-25 17:02:58,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747746561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:58,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:58,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:02:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822572710] [2022-11-25 17:02:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:58,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:02:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:58,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:02:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:02:58,797 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2022-11-25 17:02:58,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:58,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:58,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2022-11-25 17:02:58,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:59,641 INFO L130 PetriNetUnfolder]: 1159/1893 cut-off events. [2022-11-25 17:02:59,642 INFO L131 PetriNetUnfolder]: For 1115/1115 co-relation queries the response was YES. [2022-11-25 17:02:59,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1893 events. 1159/1893 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10093 event pairs, 145 based on Foata normal form. 1/1890 useless extension candidates. Maximal degree in co-relation 4992. Up to 773 conditions per place. [2022-11-25 17:02:59,652 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 69 selfloop transitions, 4 changer transitions 32/109 dead transitions. [2022-11-25 17:02:59,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 670 flow [2022-11-25 17:02:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:02:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:02:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1110 transitions. [2022-11-25 17:02:59,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46560402684563756 [2022-11-25 17:02:59,658 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1110 transitions. [2022-11-25 17:02:59,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1110 transitions. [2022-11-25 17:02:59,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:59,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1110 transitions. [2022-11-25 17:02:59,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.75) internal successors, (1110), 8 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:59,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:59,669 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:59,669 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 164 flow. Second operand 8 states and 1110 transitions. [2022-11-25 17:02:59,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 670 flow [2022-11-25 17:02:59,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 109 transitions, 653 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:02:59,685 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 173 flow [2022-11-25 17:02:59,686 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2022-11-25 17:02:59,686 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2022-11-25 17:02:59,687 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 173 flow [2022-11-25 17:02:59,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:02:59,688 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:59,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:59,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:59,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:59,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:02:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1949083886, now seen corresponding path program 2 times [2022-11-25 17:02:59,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:59,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559861712] [2022-11-25 17:02:59,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:02:59,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:59,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:59,907 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:59,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:03:00,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:03:00,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:03:00,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:03:00,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:00,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:00,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:03:00,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559861712] [2022-11-25 17:03:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559861712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:00,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:00,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:03:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418879295] [2022-11-25 17:03:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:00,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:03:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:00,200 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2022-11-25 17:03:00,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 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-11-25 17:03:00,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:00,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2022-11-25 17:03:00,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:00,935 INFO L130 PetriNetUnfolder]: 1736/2711 cut-off events. [2022-11-25 17:03:00,936 INFO L131 PetriNetUnfolder]: For 1970/1970 co-relation queries the response was YES. [2022-11-25 17:03:00,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 2711 events. 1736/2711 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14104 event pairs, 368 based on Foata normal form. 1/2707 useless extension candidates. Maximal degree in co-relation 7698. Up to 1405 conditions per place. [2022-11-25 17:03:00,948 INFO L137 encePairwiseOnDemand]: 294/298 looper letters, 56 selfloop transitions, 1 changer transitions 32/92 dead transitions. [2022-11-25 17:03:00,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 580 flow [2022-11-25 17:03:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:03:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 720 transitions. [2022-11-25 17:03:00,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48322147651006714 [2022-11-25 17:03:00,953 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 720 transitions. [2022-11-25 17:03:00,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 720 transitions. [2022-11-25 17:03:00,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:00,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 720 transitions. [2022-11-25 17:03:00,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:00,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:00,961 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:00,961 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 173 flow. Second operand 5 states and 720 transitions. [2022-11-25 17:03:00,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 580 flow [2022-11-25 17:03:00,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 558 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-25 17:03:00,999 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 170 flow [2022-11-25 17:03:00,999 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-11-25 17:03:01,000 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-11-25 17:03:01,000 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 170 flow [2022-11-25 17:03:01,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 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-11-25 17:03:01,001 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:01,001 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:01,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:01,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:03:01,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:03:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash 848587730, now seen corresponding path program 3 times [2022-11-25 17:03:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:03:01,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083032641] [2022-11-25 17:03:01,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:03:01,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:03:01,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:03:01,223 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:03:01,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 17:03:01,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:03:01,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:03:01,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:03:01,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:01,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:01,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:03:01,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083032641] [2022-11-25 17:03:01,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083032641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:01,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:01,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:03:01,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970407267] [2022-11-25 17:03:01,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:01,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:03:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:03:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:03:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:03:01,464 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 298 [2022-11-25 17:03:01,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:01,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:01,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 298 [2022-11-25 17:03:01,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:02,026 INFO L130 PetriNetUnfolder]: 1971/3115 cut-off events. [2022-11-25 17:03:02,026 INFO L131 PetriNetUnfolder]: For 2430/2430 co-relation queries the response was YES. [2022-11-25 17:03:02,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8638 conditions, 3115 events. 1971/3115 cut-off events. For 2430/2430 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17143 event pairs, 827 based on Foata normal form. 1/3061 useless extension candidates. Maximal degree in co-relation 8626. Up to 1724 conditions per place. [2022-11-25 17:03:02,038 INFO L137 encePairwiseOnDemand]: 294/298 looper letters, 54 selfloop transitions, 2 changer transitions 13/72 dead transitions. [2022-11-25 17:03:02,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 445 flow [2022-11-25 17:03:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:03:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:03:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2022-11-25 17:03:02,041 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4848993288590604 [2022-11-25 17:03:02,041 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2022-11-25 17:03:02,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2022-11-25 17:03:02,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:02,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2022-11-25 17:03:02,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:02,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:02,047 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:02,048 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 170 flow. Second operand 4 states and 578 transitions. [2022-11-25 17:03:02,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 445 flow [2022-11-25 17:03:02,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 438 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:03:02,081 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 175 flow [2022-11-25 17:03:02,081 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-11-25 17:03:02,082 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2022-11-25 17:03:02,082 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 175 flow [2022-11-25 17:03:02,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:02,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:02,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:02,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:02,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:03:02,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:03:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash 356294210, now seen corresponding path program 4 times [2022-11-25 17:03:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:03:02,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025850714] [2022-11-25 17:03:02,292 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:03:02,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:03:02,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:03:02,294 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:03:02,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 17:03:02,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:03:02,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:03:02,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:03:02,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:02,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:03:02,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:03:02,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025850714] [2022-11-25 17:03:02,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025850714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:02,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:02,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:03:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450659345] [2022-11-25 17:03:02,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:02,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:03:02,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:03:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:03:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:03:02,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 298 [2022-11-25 17:03:02,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:02,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:02,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 298 [2022-11-25 17:03:02,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:02,987 INFO L130 PetriNetUnfolder]: 1376/2243 cut-off events. [2022-11-25 17:03:02,987 INFO L131 PetriNetUnfolder]: For 1736/1736 co-relation queries the response was YES. [2022-11-25 17:03:02,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6427 conditions, 2243 events. 1376/2243 cut-off events. For 1736/1736 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11334 event pairs, 571 based on Foata normal form. 1/2229 useless extension candidates. Maximal degree in co-relation 6415. Up to 1240 conditions per place. [2022-11-25 17:03:02,995 INFO L137 encePairwiseOnDemand]: 294/298 looper letters, 44 selfloop transitions, 2 changer transitions 20/69 dead transitions. [2022-11-25 17:03:02,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 436 flow [2022-11-25 17:03:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:03:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:03:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2022-11-25 17:03:02,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4823825503355705 [2022-11-25 17:03:02,999 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2022-11-25 17:03:02,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2022-11-25 17:03:03,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:03,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2022-11-25 17:03:03,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:03,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:03,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:03,006 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 175 flow. Second operand 4 states and 575 transitions. [2022-11-25 17:03:03,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 436 flow [2022-11-25 17:03:03,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 426 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:03:03,028 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 177 flow [2022-11-25 17:03:03,028 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2022-11-25 17:03:03,029 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2022-11-25 17:03:03,029 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 177 flow [2022-11-25 17:03:03,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:03,030 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:03,030 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:03,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-25 17:03:03,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:03:03,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:03:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash 83198612, now seen corresponding path program 5 times [2022-11-25 17:03:03,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:03:03,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806862725] [2022-11-25 17:03:03,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:03:03,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:03:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:03:03,246 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:03:03,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 17:03:03,426 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:03:03,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:03:03,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:03:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:03:03,627 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:03:03,627 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:03:03,628 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 17:03:03,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 17:03:03,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 17:03:03,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 17:03:03,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 17:03:03,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 17:03:03,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 17:03:03,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 17:03:03,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 17:03:03,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 17:03:03,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 17:03:03,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 17:03:03,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 17:03:03,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 17:03:03,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 17:03:03,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 17:03:03,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:03:03,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:03:03,850 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:03,855 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:03:03,855 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:03:03,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:03:03 BasicIcfg [2022-11-25 17:03:03,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:03:03,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:03:03,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:03:03,990 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:03:03,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:02:34" (3/4) ... [2022-11-25 17:03:03,994 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:03:03,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:03:03,995 INFO L158 Benchmark]: Toolchain (without parser) took 31237.34ms. Allocated memory was 81.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 58.4MB in the beginning and 711.2MB in the end (delta: -652.9MB). Peak memory consumption was 983.7MB. Max. memory is 16.1GB. [2022-11-25 17:03:03,995 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 60.8MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:03:03,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.42ms. Allocated memory is still 81.8MB. Free memory was 58.1MB in the beginning and 51.1MB in the end (delta: 7.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-11-25 17:03:03,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.06ms. Allocated memory is still 81.8MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:03:03,996 INFO L158 Benchmark]: Boogie Preprocessor took 74.85ms. Allocated memory is still 81.8MB. Free memory was 48.5MB in the beginning and 46.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:03:03,997 INFO L158 Benchmark]: RCFGBuilder took 1088.12ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 51.8MB in the end (delta: -5.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-11-25 17:03:03,997 INFO L158 Benchmark]: TraceAbstraction took 29271.27ms. Allocated memory was 81.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 51.3MB in the beginning and 711.2MB in the end (delta: -660.0MB). Peak memory consumption was 974.2MB. Max. memory is 16.1GB. [2022-11-25 17:03:03,998 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 1.7GB. Free memory is still 711.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:03:03,999 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 60.8MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.42ms. Allocated memory is still 81.8MB. Free memory was 58.1MB in the beginning and 51.1MB in the end (delta: 7.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.06ms. Allocated memory is still 81.8MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.85ms. Allocated memory is still 81.8MB. Free memory was 48.5MB in the beginning and 46.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1088.12ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 51.8MB in the end (delta: -5.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29271.27ms. Allocated memory was 81.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 51.3MB in the beginning and 711.2MB in the end (delta: -660.0MB). Peak memory consumption was 974.2MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 1.7GB. Free memory is still 711.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.6s, 159 PlacesBefore, 53 PlacesAfterwards, 148 TransitionsBefore, 41 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 10550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4620, independent: 4391, independent conditional: 0, independent unconditional: 4391, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2471, independent: 2415, independent conditional: 0, independent unconditional: 2415, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2471, independent: 2383, independent conditional: 0, independent unconditional: 2383, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 403, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4620, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 2471, unknown conditional: 0, unknown unconditional: 2471] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 244, Positive conditional cache size: 0, Positive unconditional cache size: 244, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1217, ((void *)0), P0, ((void *)0))=0, t1217={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1218, ((void *)0), P1, ((void *)0))=1, t1217={11:0}, t1218={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L873] 0 pthread_t t1219; [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1219, ((void *)0), P2, ((void *)0))=2, t1217={11:0}, t1218={15:0}, t1219={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t1220; [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1220, ((void *)0), P3, ((void *)0))=3, t1217={11:0}, t1218={15:0}, t1219={7:0}, t1220={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1217={11:0}, t1218={15:0}, t1219={7:0}, t1220={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=2] [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 487 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2046 IncrementalHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 48 mSDtfsCounter, 2046 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 16 QuantifiedInterpolants, 1917 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1743 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:03:04,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f699be79-442e-4b1c-be2c-09ac0684abc0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample