./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS --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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- 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-4e7fbc6 [2022-11-23 02:14:55,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:14:55,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:14:55,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:14:55,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:14:56,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:14:56,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:14:56,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:14:56,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:14:56,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:14:56,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:14:56,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:14:56,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:14:56,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:14:56,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:14:56,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:14:56,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:14:56,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:14:56,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:14:56,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:14:56,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:14:56,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:14:56,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:14:56,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:14:56,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:14:56,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:14:56,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:14:56,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:14:56,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:14:56,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:14:56,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:14:56,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:14:56,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:14:56,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:14:56,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:14:56,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:14:56,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:14:56,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:14:56,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:14:56,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:14:56,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:14:56,041 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:14:56,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:14:56,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:14:56,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:14:56,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:14:56,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:14:56,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:14:56,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:14:56,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:14:56,082 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:14:56,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:14:56,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:14:56,084 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:14:56,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:14:56,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:14:56,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:14:56,085 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:14:56,085 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:14:56,085 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:14:56,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:14:56,086 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:14:56,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:14:56,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:14:56,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:14:56,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:14:56,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:14:56,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:14:56,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:14:56,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:14:56,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:14:56,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:14:56,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:14:56,089 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:14:56,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:14:56,089 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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS 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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2022-11-23 02:14:56,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:14:56,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:14:56,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:14:56,458 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:14:56,458 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:14:56,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix004.opt.i [2022-11-23 02:14:59,524 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:14:59,754 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:14:59,755 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2022-11-23 02:14:59,773 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data/6457fbdcb/1e0505b4e3f242528476fddc9b5bdbbe/FLAG39a4f89a6 [2022-11-23 02:14:59,790 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data/6457fbdcb/1e0505b4e3f242528476fddc9b5bdbbe [2022-11-23 02:14:59,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:14:59,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:14:59,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:14:59,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:14:59,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:14:59,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:59" (1/1) ... [2022-11-23 02:14:59,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56af5178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:59, skipping insertion in model container [2022-11-23 02:14:59,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:59" (1/1) ... [2022-11-23 02:14:59,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:14:59,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:15:00,087 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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2022-11-23 02:15:00,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:15:00,368 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:15:00,379 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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2022-11-23 02:15:00,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:15:00,513 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:15:00,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00 WrapperNode [2022-11-23 02:15:00,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:15:00,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:15:00,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:15:00,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:15:00,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,606 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-11-23 02:15:00,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:15:00,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:15:00,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:15:00,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:15:00,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,668 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:15:00,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:15:00,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:15:00,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:15:00,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (1/1) ... [2022-11-23 02:15:00,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:15:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:15:00,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:15:00,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:15:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:15:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:15:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:15:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:15:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:15:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:15:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:15:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:15:00,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:15:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:15:00,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:15:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 02:15:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 02:15:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:15:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:15:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:15:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:15:00,780 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:15:00,987 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:15:00,989 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:15:01,354 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:15:01,580 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:15:01,580 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:15:01,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:01 BoogieIcfgContainer [2022-11-23 02:15:01,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:15:01,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:15:01,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:15:01,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:15:01,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:14:59" (1/3) ... [2022-11-23 02:15:01,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275e99e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:15:01, skipping insertion in model container [2022-11-23 02:15:01,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:00" (2/3) ... [2022-11-23 02:15:01,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275e99e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:15:01, skipping insertion in model container [2022-11-23 02:15:01,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:01" (3/3) ... [2022-11-23 02:15:01,595 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2022-11-23 02:15:01,614 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:15:01,615 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 02:15:01,615 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:15:01,697 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:15:01,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-23 02:15:01,846 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-23 02:15:01,850 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:01,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 02:15:01,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2022-11-23 02:15:01,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2022-11-23 02:15:01,872 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:15:01,908 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2022-11-23 02:15:01,910 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2022-11-23 02:15:01,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2022-11-23 02:15:01,993 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-23 02:15:01,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:01,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 02:15:02,002 INFO L119 LiptonReduction]: Number of co-enabled transitions 3376 [2022-11-23 02:15:10,083 INFO L134 LiptonReduction]: Checked pairs total: 8860 [2022-11-23 02:15:10,083 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-11-23 02:15:10,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:15:10,124 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;@6c4682de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:15:10,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 02:15:10,127 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 02:15:10,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:10,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:10,129 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 02:15:10,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:10,135 INFO L85 PathProgramCache]: Analyzing trace with hash 630, now seen corresponding path program 1 times [2022-11-23 02:15:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:10,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573569334] [2022-11-23 02:15:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:10,256 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-23 02:15:10,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:10,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573569334] [2022-11-23 02:15:10,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573569334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:10,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:10,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 02:15:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221576022] [2022-11-23 02:15:10,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:10,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:15:10,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:15:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:15:10,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 291 [2022-11-23 02:15:10,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 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-23 02:15:10,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:10,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 291 [2022-11-23 02:15:10,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:11,354 INFO L130 PetriNetUnfolder]: 4373/6068 cut-off events. [2022-11-23 02:15:11,354 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-23 02:15:11,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12154 conditions, 6068 events. 4373/6068 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 30954 event pairs, 4373 based on Foata normal form. 0/5335 useless extension candidates. Maximal degree in co-relation 12142. Up to 5983 conditions per place. [2022-11-23 02:15:11,399 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-11-23 02:15:11,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-11-23 02:15:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:15:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 02:15:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2022-11-23 02:15:11,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5309278350515464 [2022-11-23 02:15:11,413 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2022-11-23 02:15:11,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2022-11-23 02:15:11,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:11,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2022-11-23 02:15:11,421 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-23 02:15:11,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:11,426 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:11,428 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 309 transitions. [2022-11-23 02:15:11,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-11-23 02:15:11,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:15:11,435 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-11-23 02:15:11,437 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-11-23 02:15:11,440 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-23 02:15:11,441 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-11-23 02:15:11,441 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-23 02:15:11,441 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:11,441 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:11,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:15:11,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 211576091, now seen corresponding path program 1 times [2022-11-23 02:15:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:11,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248835202] [2022-11-23 02:15:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:11,898 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-23 02:15:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:11,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248835202] [2022-11-23 02:15:11,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248835202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:11,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:11,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:15:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725426518] [2022-11-23 02:15:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:11,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:15:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:15:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:15:11,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 291 [2022-11-23 02:15:11,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:11,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:11,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 291 [2022-11-23 02:15:11,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:12,737 INFO L130 PetriNetUnfolder]: 3632/5255 cut-off events. [2022-11-23 02:15:12,737 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:12,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10345 conditions, 5255 events. 3632/5255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29211 event pairs, 668 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 10342. Up to 3973 conditions per place. [2022-11-23 02:15:12,768 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-23 02:15:12,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2022-11-23 02:15:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:15:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:15:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-11-23 02:15:12,775 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5120274914089347 [2022-11-23 02:15:12,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-11-23 02:15:12,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-11-23 02:15:12,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:12,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-11-23 02:15:12,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:12,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:12,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:12,783 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 447 transitions. [2022-11-23 02:15:12,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2022-11-23 02:15:12,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:15:12,785 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-11-23 02:15:12,786 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-11-23 02:15:12,786 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-23 02:15:12,786 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-11-23 02:15:12,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:12,787 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:12,788 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:12,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:15:12,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1946570699, now seen corresponding path program 1 times [2022-11-23 02:15:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:12,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306587786] [2022-11-23 02:15:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:13,609 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-23 02:15:13,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:13,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306587786] [2022-11-23 02:15:13,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306587786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:13,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:13,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:15:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627677072] [2022-11-23 02:15:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:13,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:15:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:15:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:15:13,949 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 291 [2022-11-23 02:15:13,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 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-23 02:15:13,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:13,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 291 [2022-11-23 02:15:13,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:14,637 INFO L130 PetriNetUnfolder]: 2594/3676 cut-off events. [2022-11-23 02:15:14,638 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-11-23 02:15:14,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7550 conditions, 3676 events. 2594/3676 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18099 event pairs, 588 based on Foata normal form. 0/3640 useless extension candidates. Maximal degree in co-relation 7546. Up to 3462 conditions per place. [2022-11-23 02:15:14,661 INFO L137 encePairwiseOnDemand]: 286/291 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-11-23 02:15:14,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 164 flow [2022-11-23 02:15:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:15:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:15:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2022-11-23 02:15:14,664 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42668957617411224 [2022-11-23 02:15:14,664 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2022-11-23 02:15:14,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2022-11-23 02:15:14,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:14,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2022-11-23 02:15:14,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:14,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:14,672 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:14,672 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 6 states and 745 transitions. [2022-11-23 02:15:14,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 164 flow [2022-11-23 02:15:14,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:15:14,677 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 70 flow [2022-11-23 02:15:14,678 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-11-23 02:15:14,679 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2022-11-23 02:15:14,679 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 70 flow [2022-11-23 02:15:14,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 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-23 02:15:14,680 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:14,681 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:14,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:15:14,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1946570721, now seen corresponding path program 1 times [2022-11-23 02:15:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:14,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008387835] [2022-11-23 02:15:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:15:14,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:14,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008387835] [2022-11-23 02:15:14,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008387835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:14,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:14,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:15:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222240411] [2022-11-23 02:15:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:14,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:15:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:15:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:15:14,926 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2022-11-23 02:15:14,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:14,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:14,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2022-11-23 02:15:14,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:16,486 INFO L130 PetriNetUnfolder]: 8375/11424 cut-off events. [2022-11-23 02:15:16,487 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-11-23 02:15:16,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23155 conditions, 11424 events. 8375/11424 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 53690 event pairs, 3715 based on Foata normal form. 480/11904 useless extension candidates. Maximal degree in co-relation 23151. Up to 9713 conditions per place. [2022-11-23 02:15:16,563 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 38 selfloop transitions, 5 changer transitions 24/67 dead transitions. [2022-11-23 02:15:16,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 296 flow [2022-11-23 02:15:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:15:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:15:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2022-11-23 02:15:16,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47697594501718216 [2022-11-23 02:15:16,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2022-11-23 02:15:16,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2022-11-23 02:15:16,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:16,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2022-11-23 02:15:16,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:16,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:16,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:16,575 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 70 flow. Second operand 5 states and 694 transitions. [2022-11-23 02:15:16,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 296 flow [2022-11-23 02:15:16,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:15:16,578 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 108 flow [2022-11-23 02:15:16,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-11-23 02:15:16,581 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-11-23 02:15:16,581 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 108 flow [2022-11-23 02:15:16,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:16,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:16,582 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:16,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:15:16,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash -884650977, now seen corresponding path program 1 times [2022-11-23 02:15:16,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:16,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061853052] [2022-11-23 02:15:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:16,784 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-23 02:15:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:16,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061853052] [2022-11-23 02:15:16,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061853052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:16,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:16,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:15:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499504320] [2022-11-23 02:15:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:16,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:15:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:15:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:15:16,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2022-11-23 02:15:16,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:16,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:16,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2022-11-23 02:15:16,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:18,197 INFO L130 PetriNetUnfolder]: 7439/10152 cut-off events. [2022-11-23 02:15:18,197 INFO L131 PetriNetUnfolder]: For 5832/5832 co-relation queries the response was YES. [2022-11-23 02:15:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26022 conditions, 10152 events. 7439/10152 cut-off events. For 5832/5832 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 45982 event pairs, 1907 based on Foata normal form. 432/10584 useless extension candidates. Maximal degree in co-relation 26015. Up to 6401 conditions per place. [2022-11-23 02:15:18,268 INFO L137 encePairwiseOnDemand]: 287/291 looper letters, 40 selfloop transitions, 3 changer transitions 26/69 dead transitions. [2022-11-23 02:15:18,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 364 flow [2022-11-23 02:15:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:15:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:15:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2022-11-23 02:15:18,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4756013745704467 [2022-11-23 02:15:18,271 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2022-11-23 02:15:18,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2022-11-23 02:15:18,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:18,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2022-11-23 02:15:18,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:18,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:18,278 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:18,278 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 108 flow. Second operand 5 states and 692 transitions. [2022-11-23 02:15:18,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 364 flow [2022-11-23 02:15:18,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 357 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 02:15:18,347 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 116 flow [2022-11-23 02:15:18,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2022-11-23 02:15:18,350 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2022-11-23 02:15:18,350 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 116 flow [2022-11-23 02:15:18,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:18,351 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:18,351 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:18,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:15:18,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 416814647, now seen corresponding path program 1 times [2022-11-23 02:15:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:18,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934556706] [2022-11-23 02:15:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:18,548 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-23 02:15:18,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:18,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934556706] [2022-11-23 02:15:18,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934556706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:18,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:18,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:15:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289430743] [2022-11-23 02:15:18,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:18,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:15:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:15:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:15:18,559 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 291 [2022-11-23 02:15:18,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:18,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:18,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 291 [2022-11-23 02:15:18,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:19,588 INFO L130 PetriNetUnfolder]: 4282/6151 cut-off events. [2022-11-23 02:15:19,589 INFO L131 PetriNetUnfolder]: For 4067/4185 co-relation queries the response was YES. [2022-11-23 02:15:19,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15282 conditions, 6151 events. 4282/6151 cut-off events. For 4067/4185 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 31800 event pairs, 1327 based on Foata normal form. 240/6280 useless extension candidates. Maximal degree in co-relation 15273. Up to 3635 conditions per place. [2022-11-23 02:15:19,637 INFO L137 encePairwiseOnDemand]: 287/291 looper letters, 35 selfloop transitions, 3 changer transitions 17/60 dead transitions. [2022-11-23 02:15:19,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 302 flow [2022-11-23 02:15:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:15:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:15:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 720 transitions. [2022-11-23 02:15:19,642 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4948453608247423 [2022-11-23 02:15:19,642 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 720 transitions. [2022-11-23 02:15:19,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 720 transitions. [2022-11-23 02:15:19,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:19,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 720 transitions. [2022-11-23 02:15:19,645 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-23 02:15:19,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:19,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:19,649 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 116 flow. Second operand 5 states and 720 transitions. [2022-11-23 02:15:19,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 302 flow [2022-11-23 02:15:19,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 290 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 02:15:19,679 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 121 flow [2022-11-23 02:15:19,679 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2022-11-23 02:15:19,682 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-11-23 02:15:19,683 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 121 flow [2022-11-23 02:15:19,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:19,683 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:19,687 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:19,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:15:19,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash 514381843, now seen corresponding path program 1 times [2022-11-23 02:15:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:19,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415840611] [2022-11-23 02:15:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:19,921 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-23 02:15:19,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:19,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415840611] [2022-11-23 02:15:19,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415840611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:19,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:19,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:15:19,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746254136] [2022-11-23 02:15:19,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:19,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:15:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:19,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:15:19,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:15:19,935 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-11-23 02:15:19,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:19,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:19,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-11-23 02:15:19,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:20,488 INFO L130 PetriNetUnfolder]: 3003/4530 cut-off events. [2022-11-23 02:15:20,489 INFO L131 PetriNetUnfolder]: For 1545/1772 co-relation queries the response was YES. [2022-11-23 02:15:20,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10869 conditions, 4530 events. 3003/4530 cut-off events. For 1545/1772 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 25081 event pairs, 471 based on Foata normal form. 316/4700 useless extension candidates. Maximal degree in co-relation 10859. Up to 2154 conditions per place. [2022-11-23 02:15:20,525 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 47 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2022-11-23 02:15:20,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 302 flow [2022-11-23 02:15:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:15:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:15:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-11-23 02:15:20,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49312714776632305 [2022-11-23 02:15:20,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2022-11-23 02:15:20,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2022-11-23 02:15:20,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:20,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2022-11-23 02:15:20,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:20,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:20,532 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:20,532 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 121 flow. Second operand 4 states and 574 transitions. [2022-11-23 02:15:20,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 302 flow [2022-11-23 02:15:20,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 292 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 02:15:20,541 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 157 flow [2022-11-23 02:15:20,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-11-23 02:15:20,542 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2022-11-23 02:15:20,542 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 157 flow [2022-11-23 02:15:20,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:20,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:20,543 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-23 02:15:20,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:15:20,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1155068234, now seen corresponding path program 1 times [2022-11-23 02:15:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:20,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022919384] [2022-11-23 02:15:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:20,819 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-23 02:15:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:20,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022919384] [2022-11-23 02:15:20,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022919384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:20,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:20,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:15:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081418126] [2022-11-23 02:15:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:20,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:15:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:15:20,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:15:20,833 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-11-23 02:15:20,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:20,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:20,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-11-23 02:15:20,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:21,407 INFO L130 PetriNetUnfolder]: 2295/3646 cut-off events. [2022-11-23 02:15:21,408 INFO L131 PetriNetUnfolder]: For 2067/2264 co-relation queries the response was YES. [2022-11-23 02:15:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10545 conditions, 3646 events. 2295/3646 cut-off events. For 2067/2264 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20943 event pairs, 433 based on Foata normal form. 238/3754 useless extension candidates. Maximal degree in co-relation 10535. Up to 1265 conditions per place. [2022-11-23 02:15:21,433 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 59 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2022-11-23 02:15:21,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 421 flow [2022-11-23 02:15:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:15:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:15:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 720 transitions. [2022-11-23 02:15:21,435 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4948453608247423 [2022-11-23 02:15:21,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 720 transitions. [2022-11-23 02:15:21,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 720 transitions. [2022-11-23 02:15:21,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:21,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 720 transitions. [2022-11-23 02:15:21,438 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-23 02:15:21,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:21,441 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:21,442 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 157 flow. Second operand 5 states and 720 transitions. [2022-11-23 02:15:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 421 flow [2022-11-23 02:15:21,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:15:21,445 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 222 flow [2022-11-23 02:15:21,446 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=5, PETRI_FLOW=222, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-11-23 02:15:21,446 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2022-11-23 02:15:21,446 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 222 flow [2022-11-23 02:15:21,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:21,447 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:21,447 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-23 02:15:21,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:15:21,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 93197830, now seen corresponding path program 1 times [2022-11-23 02:15:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:21,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308689917] [2022-11-23 02:15:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:21,712 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-23 02:15:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:21,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308689917] [2022-11-23 02:15:21,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308689917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:21,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:21,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:15:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904772728] [2022-11-23 02:15:21,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:21,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:15:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:21,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:15:21,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:15:21,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-11-23 02:15:21,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:21,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:21,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-11-23 02:15:21,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:22,279 INFO L130 PetriNetUnfolder]: 2014/3236 cut-off events. [2022-11-23 02:15:22,279 INFO L131 PetriNetUnfolder]: For 4847/5053 co-relation queries the response was YES. [2022-11-23 02:15:22,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10806 conditions, 3236 events. 2014/3236 cut-off events. For 4847/5053 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18641 event pairs, 420 based on Foata normal form. 109/3219 useless extension candidates. Maximal degree in co-relation 10794. Up to 1265 conditions per place. [2022-11-23 02:15:22,300 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 69 selfloop transitions, 14 changer transitions 0/90 dead transitions. [2022-11-23 02:15:22,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 558 flow [2022-11-23 02:15:22,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:15:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:15:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 864 transitions. [2022-11-23 02:15:22,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4948453608247423 [2022-11-23 02:15:22,303 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 864 transitions. [2022-11-23 02:15:22,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 864 transitions. [2022-11-23 02:15:22,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:22,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 864 transitions. [2022-11-23 02:15:22,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.0) internal successors, (864), 6 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:22,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:22,309 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:22,310 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 222 flow. Second operand 6 states and 864 transitions. [2022-11-23 02:15:22,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 558 flow [2022-11-23 02:15:22,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 542 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-23 02:15:22,316 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 292 flow [2022-11-23 02:15:22,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-11-23 02:15:22,317 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2022-11-23 02:15:22,317 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 292 flow [2022-11-23 02:15:22,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:22,318 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:22,318 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-23 02:15:22,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:15:22,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -359255622, now seen corresponding path program 1 times [2022-11-23 02:15:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:22,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848918053] [2022-11-23 02:15:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:22,560 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-23 02:15:22,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848918053] [2022-11-23 02:15:22,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848918053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:22,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:22,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:15:22,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123256728] [2022-11-23 02:15:22,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:22,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:15:22,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:15:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:15:22,578 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 291 [2022-11-23 02:15:22,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:22,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:22,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 291 [2022-11-23 02:15:22,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:23,421 INFO L130 PetriNetUnfolder]: 3240/5201 cut-off events. [2022-11-23 02:15:23,421 INFO L131 PetriNetUnfolder]: For 12847/12871 co-relation queries the response was YES. [2022-11-23 02:15:23,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19398 conditions, 5201 events. 3240/5201 cut-off events. For 12847/12871 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 31243 event pairs, 514 based on Foata normal form. 9/5198 useless extension candidates. Maximal degree in co-relation 19384. Up to 2516 conditions per place. [2022-11-23 02:15:23,465 INFO L137 encePairwiseOnDemand]: 287/291 looper letters, 64 selfloop transitions, 2 changer transitions 36/107 dead transitions. [2022-11-23 02:15:23,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 922 flow [2022-11-23 02:15:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:15:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:15:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2022-11-23 02:15:23,482 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49140893470790376 [2022-11-23 02:15:23,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2022-11-23 02:15:23,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2022-11-23 02:15:23,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:23,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2022-11-23 02:15:23,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:23,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:23,490 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:23,490 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 292 flow. Second operand 5 states and 715 transitions. [2022-11-23 02:15:23,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 922 flow [2022-11-23 02:15:23,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 107 transitions, 840 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-11-23 02:15:23,550 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 282 flow [2022-11-23 02:15:23,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2022-11-23 02:15:23,552 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2022-11-23 02:15:23,552 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 282 flow [2022-11-23 02:15:23,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:23,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:23,553 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-23 02:15:23,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:15:23,553 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2127837370, now seen corresponding path program 2 times [2022-11-23 02:15:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:23,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928391768] [2022-11-23 02:15:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:23,878 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-23 02:15:23,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:23,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928391768] [2022-11-23 02:15:23,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928391768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:23,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:23,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:15:23,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586946575] [2022-11-23 02:15:23,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:23,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:15:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:23,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:15:23,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:15:23,895 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-11-23 02:15:23,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:23,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:23,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-11-23 02:15:23,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:24,580 INFO L130 PetriNetUnfolder]: 2752/4410 cut-off events. [2022-11-23 02:15:24,580 INFO L131 PetriNetUnfolder]: For 7502/7772 co-relation queries the response was YES. [2022-11-23 02:15:24,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15581 conditions, 4410 events. 2752/4410 cut-off events. For 7502/7772 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 27483 event pairs, 482 based on Foata normal form. 63/4285 useless extension candidates. Maximal degree in co-relation 15564. Up to 1667 conditions per place. [2022-11-23 02:15:24,600 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 54 selfloop transitions, 18 changer transitions 3/81 dead transitions. [2022-11-23 02:15:24,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 541 flow [2022-11-23 02:15:24,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:15:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:15:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2022-11-23 02:15:24,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48306332842415317 [2022-11-23 02:15:24,606 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2022-11-23 02:15:24,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2022-11-23 02:15:24,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:24,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2022-11-23 02:15:24,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.57142857142858) internal successors, (984), 7 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:24,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:24,614 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:24,614 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 282 flow. Second operand 7 states and 984 transitions. [2022-11-23 02:15:24,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 541 flow [2022-11-23 02:15:24,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 518 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-23 02:15:24,704 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 314 flow [2022-11-23 02:15:24,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2022-11-23 02:15:24,704 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2022-11-23 02:15:24,704 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 314 flow [2022-11-23 02:15:24,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:24,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:24,705 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] [2022-11-23 02:15:24,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:15:24,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1246332764, now seen corresponding path program 1 times [2022-11-23 02:15:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:24,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250436432] [2022-11-23 02:15:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:25,530 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-23 02:15:25,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:25,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250436432] [2022-11-23 02:15:25,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250436432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:25,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:25,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 02:15:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495134100] [2022-11-23 02:15:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:25,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:15:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:15:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:15:25,630 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2022-11-23 02:15:25,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 314 flow. Second operand has 9 states, 9 states have (on average 123.0) internal successors, (1107), 9 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:25,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:25,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2022-11-23 02:15:25,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:26,825 INFO L130 PetriNetUnfolder]: 4326/6542 cut-off events. [2022-11-23 02:15:26,826 INFO L131 PetriNetUnfolder]: For 19031/19031 co-relation queries the response was YES. [2022-11-23 02:15:26,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25158 conditions, 6542 events. 4326/6542 cut-off events. For 19031/19031 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 35826 event pairs, 184 based on Foata normal form. 1/6543 useless extension candidates. Maximal degree in co-relation 25142. Up to 2808 conditions per place. [2022-11-23 02:15:26,850 INFO L137 encePairwiseOnDemand]: 281/291 looper letters, 64 selfloop transitions, 7 changer transitions 120/191 dead transitions. [2022-11-23 02:15:26,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 191 transitions, 1613 flow [2022-11-23 02:15:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 02:15:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-23 02:15:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1689 transitions. [2022-11-23 02:15:26,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4464710547184774 [2022-11-23 02:15:26,857 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1689 transitions. [2022-11-23 02:15:26,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1689 transitions. [2022-11-23 02:15:26,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:26,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1689 transitions. [2022-11-23 02:15:26,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 129.92307692307693) internal successors, (1689), 13 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:26,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 291.0) internal successors, (4074), 14 states have internal predecessors, (4074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:26,871 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 291.0) internal successors, (4074), 14 states have internal predecessors, (4074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:26,871 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 314 flow. Second operand 13 states and 1689 transitions. [2022-11-23 02:15:26,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 191 transitions, 1613 flow [2022-11-23 02:15:26,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 191 transitions, 1428 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-11-23 02:15:26,982 INFO L231 Difference]: Finished difference. Result has 74 places, 43 transitions, 258 flow [2022-11-23 02:15:26,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=258, PETRI_PLACES=74, PETRI_TRANSITIONS=43} [2022-11-23 02:15:26,983 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2022-11-23 02:15:26,983 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 43 transitions, 258 flow [2022-11-23 02:15:26,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.0) internal successors, (1107), 9 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:26,984 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:26,984 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] [2022-11-23 02:15:26,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:15:26,984 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1788736770, now seen corresponding path program 2 times [2022-11-23 02:15:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:26,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240315885] [2022-11-23 02:15:26,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:26,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:15:27,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:27,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240315885] [2022-11-23 02:15:27,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240315885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:27,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:27,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:15:27,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958701967] [2022-11-23 02:15:27,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:27,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:15:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:27,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:15:27,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:15:27,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2022-11-23 02:15:27,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 43 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:27,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:27,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2022-11-23 02:15:27,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:27,665 INFO L130 PetriNetUnfolder]: 844/1400 cut-off events. [2022-11-23 02:15:27,666 INFO L131 PetriNetUnfolder]: For 2983/2983 co-relation queries the response was YES. [2022-11-23 02:15:27,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5209 conditions, 1400 events. 844/1400 cut-off events. For 2983/2983 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6566 event pairs, 304 based on Foata normal form. 1/1401 useless extension candidates. Maximal degree in co-relation 5191. Up to 882 conditions per place. [2022-11-23 02:15:27,674 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 65 selfloop transitions, 11 changer transitions 20/96 dead transitions. [2022-11-23 02:15:27,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 769 flow [2022-11-23 02:15:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:15:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:15:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2022-11-23 02:15:27,678 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45933562428407787 [2022-11-23 02:15:27,678 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 802 transitions. [2022-11-23 02:15:27,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 802 transitions. [2022-11-23 02:15:27,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:27,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 802 transitions. [2022-11-23 02:15:27,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:27,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:27,684 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:27,685 INFO L175 Difference]: Start difference. First operand has 74 places, 43 transitions, 258 flow. Second operand 6 states and 802 transitions. [2022-11-23 02:15:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 769 flow [2022-11-23 02:15:27,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 558 flow, removed 19 selfloop flow, removed 15 redundant places. [2022-11-23 02:15:27,701 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 245 flow [2022-11-23 02:15:27,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2022-11-23 02:15:27,702 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2022-11-23 02:15:27,702 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 245 flow [2022-11-23 02:15:27,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:27,703 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:27,703 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] [2022-11-23 02:15:27,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 02:15:27,704 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:27,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2117010548, now seen corresponding path program 3 times [2022-11-23 02:15:27,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:27,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136358644] [2022-11-23 02:15:27,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:27,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:27,969 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-23 02:15:27,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:27,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136358644] [2022-11-23 02:15:27,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136358644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:27,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:27,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:15:27,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174459488] [2022-11-23 02:15:27,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:27,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:15:27,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:27,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:15:27,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:15:27,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 291 [2022-11-23 02:15:27,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:27,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:27,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 291 [2022-11-23 02:15:27,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:28,316 INFO L130 PetriNetUnfolder]: 755/1352 cut-off events. [2022-11-23 02:15:28,316 INFO L131 PetriNetUnfolder]: For 1808/1901 co-relation queries the response was YES. [2022-11-23 02:15:28,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4397 conditions, 1352 events. 755/1352 cut-off events. For 1808/1901 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7292 event pairs, 241 based on Foata normal form. 4/1310 useless extension candidates. Maximal degree in co-relation 4385. Up to 586 conditions per place. [2022-11-23 02:15:28,322 INFO L137 encePairwiseOnDemand]: 287/291 looper letters, 40 selfloop transitions, 1 changer transitions 46/90 dead transitions. [2022-11-23 02:15:28,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 572 flow [2022-11-23 02:15:28,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:15:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:15:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 705 transitions. [2022-11-23 02:15:28,325 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4845360824742268 [2022-11-23 02:15:28,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 705 transitions. [2022-11-23 02:15:28,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 705 transitions. [2022-11-23 02:15:28,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:28,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 705 transitions. [2022-11-23 02:15:28,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:28,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:28,331 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:28,331 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 245 flow. Second operand 5 states and 705 transitions. [2022-11-23 02:15:28,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 572 flow [2022-11-23 02:15:28,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 90 transitions, 558 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-23 02:15:28,337 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 165 flow [2022-11-23 02:15:28,338 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2022-11-23 02:15:28,338 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2022-11-23 02:15:28,338 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 165 flow [2022-11-23 02:15:28,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:28,339 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:28,339 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] [2022-11-23 02:15:28,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 02:15:28,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -721445732, now seen corresponding path program 4 times [2022-11-23 02:15:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:28,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457269652] [2022-11-23 02:15:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:28,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:29,753 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-23 02:15:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:15:29,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457269652] [2022-11-23 02:15:29,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457269652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:29,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:29,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:15:29,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466906489] [2022-11-23 02:15:29,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:29,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:15:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:15:29,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:15:29,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:15:29,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 291 [2022-11-23 02:15:29,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 165 flow. Second operand has 8 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:29,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:29,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 291 [2022-11-23 02:15:29,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:30,246 INFO L130 PetriNetUnfolder]: 386/704 cut-off events. [2022-11-23 02:15:30,246 INFO L131 PetriNetUnfolder]: For 913/962 co-relation queries the response was YES. [2022-11-23 02:15:30,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2150 conditions, 704 events. 386/704 cut-off events. For 913/962 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3353 event pairs, 43 based on Foata normal form. 1/667 useless extension candidates. Maximal degree in co-relation 2137. Up to 281 conditions per place. [2022-11-23 02:15:30,249 INFO L137 encePairwiseOnDemand]: 283/291 looper letters, 35 selfloop transitions, 4 changer transitions 39/82 dead transitions. [2022-11-23 02:15:30,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 501 flow [2022-11-23 02:15:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:15:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:15:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1208 transitions. [2022-11-23 02:15:30,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4612447499045437 [2022-11-23 02:15:30,255 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1208 transitions. [2022-11-23 02:15:30,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1208 transitions. [2022-11-23 02:15:30,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:30,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1208 transitions. [2022-11-23 02:15:30,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.22222222222223) internal successors, (1208), 9 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:30,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:30,264 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:30,264 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 165 flow. Second operand 9 states and 1208 transitions. [2022-11-23 02:15:30,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 501 flow [2022-11-23 02:15:30,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 82 transitions, 473 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-23 02:15:30,268 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 164 flow [2022-11-23 02:15:30,268 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=164, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2022-11-23 02:15:30,268 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2022-11-23 02:15:30,269 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 164 flow [2022-11-23 02:15:30,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:30,269 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:30,270 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] [2022-11-23 02:15:30,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 02:15:30,270 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1793202018, now seen corresponding path program 5 times [2022-11-23 02:15:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:15:30,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290431538] [2022-11-23 02:15:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:15:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:15:30,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:15:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:15:30,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:15:30,401 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:15:30,402 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 02:15:30,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 02:15:30,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 02:15:30,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 02:15:30,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 02:15:30,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 02:15:30,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 02:15:30,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 02:15:30,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 02:15:30,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 02:15:30,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 02:15:30,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 02:15:30,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 02:15:30,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 02:15:30,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 02:15:30,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 02:15:30,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 02:15:30,408 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:30,414 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:15:30,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:15:30,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:15:30 BasicIcfg [2022-11-23 02:15:30,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:15:30,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:15:30,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:15:30,546 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:15:30,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:01" (3/4) ... [2022-11-23 02:15:30,549 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:15:30,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:15:30,549 INFO L158 Benchmark]: Toolchain (without parser) took 30752.54ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 124.7MB in the beginning and 771.8MB in the end (delta: -647.1MB). Peak memory consumption was 624.5MB. Max. memory is 16.1GB. [2022-11-23 02:15:30,550 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:15:30,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.81ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 113.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 02:15:30,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.64ms. Allocated memory is still 163.6MB. Free memory was 113.8MB in the beginning and 110.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:15:30,551 INFO L158 Benchmark]: Boogie Preprocessor took 66.12ms. Allocated memory is still 163.6MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:15:30,551 INFO L158 Benchmark]: RCFGBuilder took 909.13ms. Allocated memory is still 163.6MB. Free memory was 108.8MB in the beginning and 69.3MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-23 02:15:30,552 INFO L158 Benchmark]: TraceAbstraction took 28958.48ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 68.4MB in the beginning and 772.8MB in the end (delta: -704.4MB). Peak memory consumption was 569.1MB. Max. memory is 16.1GB. [2022-11-23 02:15:30,552 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 1.4GB. Free memory was 772.8MB in the beginning and 771.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:15:30,553 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.24ms. Allocated memory is still 130.0MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.81ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 113.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.64ms. Allocated memory is still 163.6MB. Free memory was 113.8MB in the beginning and 110.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.12ms. Allocated memory is still 163.6MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 909.13ms. Allocated memory is still 163.6MB. Free memory was 108.8MB in the beginning and 69.3MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28958.48ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 68.4MB in the beginning and 772.8MB in the end (delta: -704.4MB). Peak memory consumption was 569.1MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 1.4GB. Free memory was 772.8MB in the beginning and 771.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 157 PlacesBefore, 51 PlacesAfterwards, 146 TransitionsBefore, 39 TransitionsAfterwards, 3376 CoEnabledTransitionPairs, 8 FixpointIterations, 51 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 8860 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5387, independent: 5170, independent conditional: 0, independent unconditional: 5170, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2468, independent: 2403, independent conditional: 0, independent unconditional: 2403, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2468, independent: 2378, independent conditional: 0, independent unconditional: 2378, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 680, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 614, dependent conditional: 0, dependent unconditional: 614, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5387, independent: 2767, independent conditional: 0, independent unconditional: 2767, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 2468, unknown conditional: 0, unknown unconditional: 2468] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 303, Positive conditional cache size: 0, Positive unconditional cache size: 303, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t93, ((void *)0), P0, ((void *)0))=-1, t93={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t94, ((void *)0), P1, ((void *)0))=0, t93={5:0}, t94={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t95, ((void *)0), P2, ((void *)0))=1, t93={5:0}, t94={6:0}, t95={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t96, ((void *)0), P3, ((void *)0))=2, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 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: 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, 185 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: 28.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1151 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 958 mSDsluCounter, 697 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 594 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2439 IncrementalHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 103 mSDtfsCounter, 2439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 2370 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-23 02:15:30,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS --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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- 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-4e7fbc6 [2022-11-23 02:15:33,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:15:33,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:15:33,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:15:33,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:15:33,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:15:33,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:15:33,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:15:33,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:15:33,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:15:33,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:15:33,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:15:33,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:15:33,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:15:33,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:15:33,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:15:33,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:15:33,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:15:33,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:15:33,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:15:33,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:15:33,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:15:33,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:15:33,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:15:33,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:15:33,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:15:33,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:15:33,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:15:33,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:15:33,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:15:33,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:15:33,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:15:33,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:15:33,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:15:33,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:15:33,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:15:33,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:15:33,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:15:33,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:15:33,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:15:33,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:15:33,167 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 02:15:33,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:15:33,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:15:33,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:15:33,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:15:33,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:15:33,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:15:33,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:15:33,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:15:33,208 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:15:33,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:15:33,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:15:33,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:15:33,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:15:33,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:15:33,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:15:33,210 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:15:33,210 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:15:33,211 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:15:33,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:15:33,211 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:15:33,211 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 02:15:33,212 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 02:15:33,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:15:33,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:15:33,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:15:33,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:15:33,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:15:33,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:15:33,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:15:33,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:15:33,214 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 02:15:33,214 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 02:15:33,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:15:33,215 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:15:33,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:15:33,215 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 02:15:33,215 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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS 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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2022-11-23 02:15:33,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:15:33,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:15:33,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:15:33,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:15:33,574 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:15:33,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix004.opt.i [2022-11-23 02:15:36,634 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:15:36,906 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:15:36,907 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2022-11-23 02:15:36,934 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data/cd55e3dc3/39074e018bd24a6fa5f84cca98f6d8da/FLAGd91bdae43 [2022-11-23 02:15:36,952 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/data/cd55e3dc3/39074e018bd24a6fa5f84cca98f6d8da [2022-11-23 02:15:36,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:15:36,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:15:36,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:15:36,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:15:36,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:15:36,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:15:36" (1/1) ... [2022-11-23 02:15:36,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c997b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:36, skipping insertion in model container [2022-11-23 02:15:36,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:15:36" (1/1) ... [2022-11-23 02:15:36,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:15:37,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:15:37,299 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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2022-11-23 02:15:37,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:15:37,635 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:15:37,652 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_437ddffd-b3bf-4d40-ac8b-80e0377554c5/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2022-11-23 02:15:37,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:15:37,735 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:15:37,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37 WrapperNode [2022-11-23 02:15:37,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:15:37,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:15:37,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:15:37,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:15:37,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,792 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-23 02:15:37,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:15:37,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:15:37,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:15:37,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:15:37,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,836 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:15:37,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:15:37,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:15:37,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:15:37,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (1/1) ... [2022-11-23 02:15:37,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:15:37,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:15:37,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:15:37,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:15:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:15:37,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:15:37,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:15:37,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:15:37,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 02:15:37,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 02:15:37,957 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:15:37,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:15:37,957 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:15:37,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:15:37,958 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:15:37,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:15:37,958 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 02:15:37,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 02:15:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:15:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:15:37,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:15:37,961 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:15:38,179 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:15:38,181 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:15:38,635 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:15:38,803 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:15:38,803 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:15:38,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:38 BoogieIcfgContainer [2022-11-23 02:15:38,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:15:38,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:15:38,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:15:38,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:15:38,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:15:36" (1/3) ... [2022-11-23 02:15:38,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f5e6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:15:38, skipping insertion in model container [2022-11-23 02:15:38,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:37" (2/3) ... [2022-11-23 02:15:38,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f5e6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:15:38, skipping insertion in model container [2022-11-23 02:15:38,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:38" (3/3) ... [2022-11-23 02:15:38,817 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2022-11-23 02:15:38,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:15:38,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 02:15:38,837 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:15:38,960 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:15:39,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-23 02:15:39,113 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-23 02:15:39,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:39,123 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 98 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 02:15:39,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-11-23 02:15:39,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-11-23 02:15:39,137 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:15:39,161 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-23 02:15:39,173 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-23 02:15:39,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-11-23 02:15:39,227 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-23 02:15:39,236 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:39,237 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 98 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 02:15:39,240 INFO L119 LiptonReduction]: Number of co-enabled transitions 3376 [2022-11-23 02:15:49,639 INFO L134 LiptonReduction]: Checked pairs total: 8467 [2022-11-23 02:15:49,640 INFO L136 LiptonReduction]: Total number of compositions: 147 [2022-11-23 02:15:49,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:15:49,662 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;@2c0b9424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:15:49,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 02:15:49,665 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-23 02:15:49,666 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:49,666 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:49,667 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 02:15:49,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 636, now seen corresponding path program 1 times [2022-11-23 02:15:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:49,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432585823] [2022-11-23 02:15:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:49,686 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-23 02:15:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:49,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:49,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:49,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 02:15:49,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:49,816 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-23 02:15:49,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:49,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:49,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432585823] [2022-11-23 02:15:49,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432585823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:49,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:49,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 02:15:49,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110322623] [2022-11-23 02:15:49,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:49,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:15:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:49,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:15:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:15:49,869 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 298 [2022-11-23 02:15:49,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:49,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:49,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 298 [2022-11-23 02:15:49,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:50,985 INFO L130 PetriNetUnfolder]: 4373/6067 cut-off events. [2022-11-23 02:15:50,986 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-23 02:15:51,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12153 conditions, 6067 events. 4373/6067 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 31060 event pairs, 4373 based on Foata normal form. 0/5334 useless extension candidates. Maximal degree in co-relation 12141. Up to 5983 conditions per place. [2022-11-23 02:15:51,042 INFO L137 encePairwiseOnDemand]: 289/298 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-11-23 02:15:51,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-11-23 02:15:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:15:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 02:15:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 311 transitions. [2022-11-23 02:15:51,066 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5218120805369127 [2022-11-23 02:15:51,067 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 311 transitions. [2022-11-23 02:15:51,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 311 transitions. [2022-11-23 02:15:51,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:51,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 311 transitions. [2022-11-23 02:15:51,081 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-23 02:15:51,087 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-23 02:15:51,088 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-23 02:15:51,090 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 311 transitions. [2022-11-23 02:15:51,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-11-23 02:15:51,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:15:51,101 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-11-23 02:15:51,103 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-11-23 02:15:51,110 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-23 02:15:51,111 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-11-23 02:15:51,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:51,112 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:51,112 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:51,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:15:51,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:51,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2112410075, now seen corresponding path program 1 times [2022-11-23 02:15:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261512459] [2022-11-23 02:15:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:51,338 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-23 02:15:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:51,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:51,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:51,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:15:51,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:51,652 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-23 02:15:51,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:51,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261512459] [2022-11-23 02:15:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261512459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:51,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:51,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:15:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280223701] [2022-11-23 02:15:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:51,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:15:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:15:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:15:51,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 298 [2022-11-23 02:15:51,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:51,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:51,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 298 [2022-11-23 02:15:51,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:52,619 INFO L130 PetriNetUnfolder]: 3632/5254 cut-off events. [2022-11-23 02:15:52,620 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:15:52,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10344 conditions, 5254 events. 3632/5254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 29090 event pairs, 668 based on Foata normal form. 0/4881 useless extension candidates. Maximal degree in co-relation 10341. Up to 3973 conditions per place. [2022-11-23 02:15:52,653 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-23 02:15:52,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2022-11-23 02:15:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:15:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:15:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2022-11-23 02:15:52,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5033557046979866 [2022-11-23 02:15:52,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2022-11-23 02:15:52,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2022-11-23 02:15:52,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:52,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2022-11-23 02:15:52,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:52,664 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-23 02:15:52,664 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-23 02:15:52,665 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 450 transitions. [2022-11-23 02:15:52,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2022-11-23 02:15:52,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:15:52,667 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-11-23 02:15:52,668 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-11-23 02:15:52,668 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-23 02:15:52,669 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-11-23 02:15:52,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:52,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:52,669 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:52,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:15:52,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:52,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1493556964, now seen corresponding path program 1 times [2022-11-23 02:15:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:52,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555942164] [2022-11-23 02:15:52,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:52,902 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-23 02:15:52,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:52,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:52,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:53,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:15:53,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:15:53,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:53,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:53,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555942164] [2022-11-23 02:15:53,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555942164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:53,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:53,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:15:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173611214] [2022-11-23 02:15:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:53,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:15:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:15:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:15:53,116 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2022-11-23 02:15:53,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:53,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:53,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2022-11-23 02:15:53,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:53,804 INFO L130 PetriNetUnfolder]: 2540/3676 cut-off events. [2022-11-23 02:15:53,804 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-11-23 02:15:53,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7628 conditions, 3676 events. 2540/3676 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 18788 event pairs, 492 based on Foata normal form. 180/3717 useless extension candidates. Maximal degree in co-relation 7624. Up to 2887 conditions per place. [2022-11-23 02:15:53,824 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2022-11-23 02:15:53,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2022-11-23 02:15:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:15:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:15:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2022-11-23 02:15:53,827 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4771812080536913 [2022-11-23 02:15:53,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2022-11-23 02:15:53,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2022-11-23 02:15:53,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:53,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2022-11-23 02:15:53,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:53,833 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-23 02:15:53,834 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-23 02:15:53,834 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 711 transitions. [2022-11-23 02:15:53,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2022-11-23 02:15:53,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:15:53,837 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2022-11-23 02:15:53,837 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-23 02:15:53,838 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-11-23 02:15:53,838 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2022-11-23 02:15:53,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:53,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:53,839 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:53,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:54,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:54,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1094897257, now seen corresponding path program 1 times [2022-11-23 02:15:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:54,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022447431] [2022-11-23 02:15:54,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:54,053 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-23 02:15:54,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:54,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:54,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:54,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:15:54,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:54,237 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-23 02:15:54,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:54,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:54,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022447431] [2022-11-23 02:15:54,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022447431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:54,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:54,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:15:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008965223] [2022-11-23 02:15:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:54,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:15:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:54,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:15:54,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:15:54,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2022-11-23 02:15:54,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:54,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:54,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2022-11-23 02:15:54,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:54,851 INFO L130 PetriNetUnfolder]: 1284/1992 cut-off events. [2022-11-23 02:15:54,852 INFO L131 PetriNetUnfolder]: For 871/871 co-relation queries the response was YES. [2022-11-23 02:15:54,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5497 conditions, 1992 events. 1284/1992 cut-off events. For 871/871 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9786 event pairs, 186 based on Foata normal form. 132/2061 useless extension candidates. Maximal degree in co-relation 5490. Up to 1027 conditions per place. [2022-11-23 02:15:54,868 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2022-11-23 02:15:54,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2022-11-23 02:15:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:15:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:15:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2022-11-23 02:15:54,872 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47818791946308725 [2022-11-23 02:15:54,872 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2022-11-23 02:15:54,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2022-11-23 02:15:54,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:54,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2022-11-23 02:15:54,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:54,879 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-23 02:15:54,881 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-23 02:15:54,881 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 855 transitions. [2022-11-23 02:15:54,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2022-11-23 02:15:54,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 02:15:54,889 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2022-11-23 02:15:54,889 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-11-23 02:15:54,890 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-11-23 02:15:54,891 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2022-11-23 02:15:54,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:54,891 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:54,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:15:54,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-23 02:15:55,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:55,104 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023428, now seen corresponding path program 1 times [2022-11-23 02:15:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:55,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637402112] [2022-11-23 02:15:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:55,106 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-23 02:15:55,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:55,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:55,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:55,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 02:15:55,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:55,322 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-23 02:15:55,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:55,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:55,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637402112] [2022-11-23 02:15:55,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637402112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:55,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:55,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:15:55,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686335627] [2022-11-23 02:15:55,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:55,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:15:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:15:55,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:15:55,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2022-11-23 02:15:55,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:55,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:55,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2022-11-23 02:15:55,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:55,907 INFO L130 PetriNetUnfolder]: 660/1072 cut-off events. [2022-11-23 02:15:55,907 INFO L131 PetriNetUnfolder]: For 1240/1240 co-relation queries the response was YES. [2022-11-23 02:15:55,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1072 events. 660/1072 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4711 event pairs, 124 based on Foata normal form. 56/1109 useless extension candidates. Maximal degree in co-relation 3489. Up to 395 conditions per place. [2022-11-23 02:15:55,917 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2022-11-23 02:15:55,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2022-11-23 02:15:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:15:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:15:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 997 transitions. [2022-11-23 02:15:55,921 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4779482262703739 [2022-11-23 02:15:55,921 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 997 transitions. [2022-11-23 02:15:55,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 997 transitions. [2022-11-23 02:15:55,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:55,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 997 transitions. [2022-11-23 02:15:55,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.42857142857142) internal successors, (997), 7 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:55,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:55,931 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:55,931 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 997 transitions. [2022-11-23 02:15:55,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2022-11-23 02:15:55,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-11-23 02:15:55,945 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2022-11-23 02:15:55,946 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-11-23 02:15:55,946 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2022-11-23 02:15:55,947 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2022-11-23 02:15:55,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:55,947 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:55,948 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-23 02:15:55,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:56,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:56,165 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:56,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1184988522, now seen corresponding path program 1 times [2022-11-23 02:15:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:56,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513264654] [2022-11-23 02:15:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:56,166 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-23 02:15:56,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:56,167 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:56,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:56,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:15:56,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:56,406 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-23 02:15:56,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:56,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513264654] [2022-11-23 02:15:56,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513264654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:56,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:56,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:15:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025948970] [2022-11-23 02:15:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:56,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:15:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:15:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:15:56,466 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2022-11-23 02:15:56,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 131.57142857142858) internal successors, (921), 7 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:56,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:56,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2022-11-23 02:15:56,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:57,028 INFO L130 PetriNetUnfolder]: 528/841 cut-off events. [2022-11-23 02:15:57,028 INFO L131 PetriNetUnfolder]: For 950/950 co-relation queries the response was YES. [2022-11-23 02:15:57,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 841 events. 528/841 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3489 event pairs, 119 based on Foata normal form. 12/845 useless extension candidates. Maximal degree in co-relation 2631. Up to 340 conditions per place. [2022-11-23 02:15:57,033 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2022-11-23 02:15:57,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2022-11-23 02:15:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:15:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:15:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1115 transitions. [2022-11-23 02:15:57,041 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4677013422818792 [2022-11-23 02:15:57,041 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1115 transitions. [2022-11-23 02:15:57,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1115 transitions. [2022-11-23 02:15:57,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:57,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1115 transitions. [2022-11-23 02:15:57,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.375) internal successors, (1115), 8 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:57,047 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-23 02:15:57,048 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-23 02:15:57,048 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1115 transitions. [2022-11-23 02:15:57,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2022-11-23 02:15:57,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-11-23 02:15:57,059 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2022-11-23 02:15:57,060 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2022-11-23 02:15:57,062 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-11-23 02:15:57,063 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2022-11-23 02:15:57,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.57142857142858) internal successors, (921), 7 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:57,064 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:57,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] [2022-11-23 02:15:57,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:57,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:57,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:57,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -334048715, now seen corresponding path program 1 times [2022-11-23 02:15:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:57,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192826435] [2022-11-23 02:15:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:15:57,278 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-23 02:15:57,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:57,279 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:57,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:15:57,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:15:57,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:57,504 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-23 02:15:57,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:57,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:57,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192826435] [2022-11-23 02:15:57,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192826435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:57,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:57,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:15:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185565535] [2022-11-23 02:15:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:57,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:15:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:15:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:15:57,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 298 [2022-11-23 02:15:57,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:57,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:57,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 298 [2022-11-23 02:15:57,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:57,824 INFO L130 PetriNetUnfolder]: 707/1143 cut-off events. [2022-11-23 02:15:57,824 INFO L131 PetriNetUnfolder]: For 1628/1628 co-relation queries the response was YES. [2022-11-23 02:15:57,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1143 events. 707/1143 cut-off events. For 1628/1628 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5355 event pairs, 147 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 3564. Up to 653 conditions per place. [2022-11-23 02:15:57,834 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 81 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2022-11-23 02:15:57,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 659 flow [2022-11-23 02:15:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:15:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:15:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2022-11-23 02:15:57,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4949664429530201 [2022-11-23 02:15:57,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2022-11-23 02:15:57,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2022-11-23 02:15:57,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:57,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2022-11-23 02:15:57,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:57,842 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-23 02:15:57,842 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-23 02:15:57,842 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 4 states and 590 transitions. [2022-11-23 02:15:57,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 659 flow [2022-11-23 02:15:57,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 518 flow, removed 38 selfloop flow, removed 7 redundant places. [2022-11-23 02:15:57,853 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 167 flow [2022-11-23 02:15:57,854 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-11-23 02:15:57,854 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-11-23 02:15:57,854 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 167 flow [2022-11-23 02:15:57,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:57,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:57,855 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] [2022-11-23 02:15:57,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:15:58,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:58,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1866246263, now seen corresponding path program 2 times [2022-11-23 02:15:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:58,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996689964] [2022-11-23 02:15:58,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:15:58,074 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-23 02:15:58,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:58,075 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:58,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:58,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:15:58,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:15:58,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:15:58,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:58,283 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-23 02:15:58,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:58,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:58,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996689964] [2022-11-23 02:15:58,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996689964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:58,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:58,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:15:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317139741] [2022-11-23 02:15:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:58,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:15:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:15:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:15:58,300 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 298 [2022-11-23 02:15:58,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:58,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:58,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 298 [2022-11-23 02:15:58,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:58,680 INFO L130 PetriNetUnfolder]: 1162/1930 cut-off events. [2022-11-23 02:15:58,680 INFO L131 PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES. [2022-11-23 02:15:58,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5510 conditions, 1930 events. 1162/1930 cut-off events. For 1881/1881 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10808 event pairs, 149 based on Foata normal form. 1/1916 useless extension candidates. Maximal degree in co-relation 5500. Up to 975 conditions per place. [2022-11-23 02:15:58,693 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 79 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2022-11-23 02:15:58,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 527 flow [2022-11-23 02:15:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:15:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:15:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2022-11-23 02:15:58,695 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49328859060402686 [2022-11-23 02:15:58,696 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2022-11-23 02:15:58,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2022-11-23 02:15:58,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:58,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2022-11-23 02:15:58,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:58,699 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-23 02:15:58,700 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-23 02:15:58,700 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 167 flow. Second operand 4 states and 588 transitions. [2022-11-23 02:15:58,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 527 flow [2022-11-23 02:15:58,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:15:58,717 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 179 flow [2022-11-23 02:15:58,718 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-11-23 02:15:58,718 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-11-23 02:15:58,718 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 179 flow [2022-11-23 02:15:58,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:58,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:58,719 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] [2022-11-23 02:15:58,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-23 02:15:58,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:58,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1504187175, now seen corresponding path program 3 times [2022-11-23 02:15:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:58,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852509537] [2022-11-23 02:15:58,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:15:58,933 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-23 02:15:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:58,934 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:58,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:59,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 02:15:59,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:15:59,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:15:59,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:15:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:15:59,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:15:59,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:15:59,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852509537] [2022-11-23 02:15:59,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852509537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:15:59,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:15:59,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:15:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65073965] [2022-11-23 02:15:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:15:59,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:15:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:15:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:15:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:15:59,165 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 298 [2022-11-23 02:15:59,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:59,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:15:59,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 298 [2022-11-23 02:15:59,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:15:59,689 INFO L130 PetriNetUnfolder]: 1796/3048 cut-off events. [2022-11-23 02:15:59,689 INFO L131 PetriNetUnfolder]: For 3265/3265 co-relation queries the response was YES. [2022-11-23 02:15:59,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9150 conditions, 3048 events. 1796/3048 cut-off events. For 3265/3265 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 18961 event pairs, 259 based on Foata normal form. 1/3015 useless extension candidates. Maximal degree in co-relation 9138. Up to 1543 conditions per place. [2022-11-23 02:15:59,714 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 84 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2022-11-23 02:15:59,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 565 flow [2022-11-23 02:15:59,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:15:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:15:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2022-11-23 02:15:59,716 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4974832214765101 [2022-11-23 02:15:59,716 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2022-11-23 02:15:59,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2022-11-23 02:15:59,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:15:59,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2022-11-23 02:15:59,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:59,722 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-23 02:15:59,722 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-23 02:15:59,722 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 179 flow. Second operand 4 states and 593 transitions. [2022-11-23 02:15:59,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 565 flow [2022-11-23 02:15:59,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:15:59,766 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 191 flow [2022-11-23 02:15:59,767 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2022-11-23 02:15:59,767 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2022-11-23 02:15:59,767 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 191 flow [2022-11-23 02:15:59,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:15:59,768 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:15:59,768 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] [2022-11-23 02:15:59,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-23 02:15:59,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:59,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:15:59,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:15:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2086563653, now seen corresponding path program 4 times [2022-11-23 02:15:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:15:59,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012342723] [2022-11-23 02:15:59,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:15:59,980 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-23 02:15:59,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:15:59,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:15:59,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:16:00,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:16:00,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:16:00,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 02:16:00,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:16:00,865 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-23 02:16:00,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:16:00,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:16:00,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012342723] [2022-11-23 02:16:00,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012342723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:16:00,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:16:00,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:16:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58502016] [2022-11-23 02:16:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:16:00,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:16:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:16:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:16:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:16:00,920 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 298 [2022-11-23 02:16:00,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:16:00,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:16:00,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 298 [2022-11-23 02:16:00,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:16:01,631 INFO L130 PetriNetUnfolder]: 1624/2786 cut-off events. [2022-11-23 02:16:01,631 INFO L131 PetriNetUnfolder]: For 3731/3732 co-relation queries the response was YES. [2022-11-23 02:16:01,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9061 conditions, 2786 events. 1624/2786 cut-off events. For 3731/3732 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17157 event pairs, 371 based on Foata normal form. 1/2668 useless extension candidates. Maximal degree in co-relation 9047. Up to 792 conditions per place. [2022-11-23 02:16:01,661 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 90 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2022-11-23 02:16:01,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 104 transitions, 705 flow [2022-11-23 02:16:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:16:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:16:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1120 transitions. [2022-11-23 02:16:01,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4697986577181208 [2022-11-23 02:16:01,665 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1120 transitions. [2022-11-23 02:16:01,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1120 transitions. [2022-11-23 02:16:01,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:16:01,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1120 transitions. [2022-11-23 02:16:01,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:16:01,672 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-23 02:16:01,673 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-23 02:16:01,674 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 191 flow. Second operand 8 states and 1120 transitions. [2022-11-23 02:16:01,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 104 transitions, 705 flow [2022-11-23 02:16:01,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:16:01,710 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 216 flow [2022-11-23 02:16:01,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2022-11-23 02:16:01,711 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2022-11-23 02:16:01,711 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 216 flow [2022-11-23 02:16:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:16:01,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:16:01,712 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] [2022-11-23 02:16:01,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:16:01,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:16:01,924 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 02:16:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:16:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash 205447237, now seen corresponding path program 5 times [2022-11-23 02:16:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:16:01,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572299321] [2022-11-23 02:16:01,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:16:01,925 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-23 02:16:01,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:16:01,926 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:16:01,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:16:02,130 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:16:02,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 02:16:02,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:16:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:16:02,311 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 02:16:02,311 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:16:02,312 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 02:16:02,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 02:16:02,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 02:16:02,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 02:16:02,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 02:16:02,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 02:16:02,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 02:16:02,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 02:16:02,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 02:16:02,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 02:16:02,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 02:16:02,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 02:16:02,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 02:16:02,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 02:16:02,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 02:16:02,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 02:16:02,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 02:16:02,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/mathsat -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-23 02:16:02,531 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-23 02:16:02,535 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:16:02,535 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:16:02,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:16:02 BasicIcfg [2022-11-23 02:16:02,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:16:02,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:16:02,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:16:02,658 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:16:02,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:38" (3/4) ... [2022-11-23 02:16:02,661 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:16:02,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:16:02,662 INFO L158 Benchmark]: Toolchain (without parser) took 25703.56ms. Allocated memory was 65.0MB in the beginning and 503.3MB in the end (delta: 438.3MB). Free memory was 34.7MB in the beginning and 393.4MB in the end (delta: -358.7MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2022-11-23 02:16:02,663 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 65.0MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:16:02,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.68ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 34.5MB in the beginning and 55.8MB in the end (delta: -21.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-11-23 02:16:02,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.91ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 53.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:16:02,664 INFO L158 Benchmark]: Boogie Preprocessor took 49.17ms. Allocated memory is still 94.4MB. Free memory was 53.2MB in the beginning and 50.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 02:16:02,664 INFO L158 Benchmark]: RCFGBuilder took 963.55ms. Allocated memory is still 94.4MB. Free memory was 50.6MB in the beginning and 43.5MB in the end (delta: 7.1MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2022-11-23 02:16:02,664 INFO L158 Benchmark]: TraceAbstraction took 23849.24ms. Allocated memory was 94.4MB in the beginning and 503.3MB in the end (delta: 408.9MB). Free memory was 43.0MB in the beginning and 394.4MB in the end (delta: -351.4MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2022-11-23 02:16:02,665 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 503.3MB. Free memory is still 393.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:16:02,667 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 65.0MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.68ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 34.5MB in the beginning and 55.8MB in the end (delta: -21.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.91ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 53.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.17ms. Allocated memory is still 94.4MB. Free memory was 53.2MB in the beginning and 50.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 963.55ms. Allocated memory is still 94.4MB. Free memory was 50.6MB in the beginning and 43.5MB in the end (delta: 7.1MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23849.24ms. Allocated memory was 94.4MB in the beginning and 503.3MB in the end (delta: 408.9MB). Free memory was 43.0MB in the beginning and 394.4MB in the end (delta: -351.4MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 503.3MB. Free memory is still 393.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 158 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 39 TransitionsAfterwards, 3376 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 8467 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5013, independent: 4805, independent conditional: 0, independent unconditional: 4805, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2540, independent: 2460, independent conditional: 0, independent unconditional: 2460, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2540, independent: 2425, independent conditional: 0, independent unconditional: 2425, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 694, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 603, dependent conditional: 0, dependent unconditional: 603, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5013, independent: 2345, independent conditional: 0, independent unconditional: 2345, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 2540, unknown conditional: 0, unknown unconditional: 2540] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 308, Positive conditional cache size: 0, Positive unconditional cache size: 308, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t93, ((void *)0), P0, ((void *)0))=-1, t93={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t94, ((void *)0), P1, ((void *)0))=0, t93={3:0}, t94={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t95, ((void *)0), P2, ((void *)0))=1, t93={3:0}, t94={7:0}, t95={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t96, ((void *)0), P3, ((void *)0))=2, t93={3:0}, t94={7:0}, t95={11:0}, t96={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={3:0}, t94={7:0}, t95={11:0}, t96={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 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: 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, 186 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: 23.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1743 IncrementalHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 17 mSDtfsCounter, 1743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, InterpolantAutomatonStates: 51, 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.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1526 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-23 02:16:02,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_437ddffd-b3bf-4d40-ac8b-80e0377554c5/bin/uautomizer-QkZJyEgLgS/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