./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f --- 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 03:55:36,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:55:36,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:55:36,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:55:36,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:55:36,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:55:36,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:55:36,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:55:36,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:55:36,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:55:36,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:55:36,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:55:36,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:55:36,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:55:36,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:55:36,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:55:36,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:55:36,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:55:36,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:55:36,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:55:36,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:55:36,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:55:36,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:55:36,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:55:36,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:55:36,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:55:36,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:55:36,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:55:36,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:55:36,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:55:36,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:55:36,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:55:36,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:55:36,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:55:36,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:55:36,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:55:36,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:55:36,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:55:36,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:55:36,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:55:36,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:55:36,545 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 03:55:36,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:55:36,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:55:36,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:55:36,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:55:36,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:55:36,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:55:36,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:55:36,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:55:36,575 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:55:36,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:55:36,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:55:36,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:55:36,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:55:36,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:55:36,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:55:36,577 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:55:36,577 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:55:36,577 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:55:36,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:55:36,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:55:36,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:55:36,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:55:36,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:55:36,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:55:36,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:55:36,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:55:36,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:55:36,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:55:36,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:55:36,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:55:36,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:55:36,581 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:55:36,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:55:36,581 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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 -> e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f [2022-11-23 03:55:36,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:55:37,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:55:37,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:55:37,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:55:37,020 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:55:37,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i [2022-11-23 03:55:40,213 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:55:40,521 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:55:40,543 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i [2022-11-23 03:55:40,580 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data/6e65d735e/c3e1be15c07243a7a626cb23d77b7680/FLAGd1bb20e89 [2022-11-23 03:55:40,601 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data/6e65d735e/c3e1be15c07243a7a626cb23d77b7680 [2022-11-23 03:55:40,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:55:40,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:55:40,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:55:40,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:55:40,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:55:40,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:40" (1/1) ... [2022-11-23 03:55:40,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3646fbe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:40, skipping insertion in model container [2022-11-23 03:55:40,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:40" (1/1) ... [2022-11-23 03:55:40,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:55:40,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:55:40,883 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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i[995,1008] [2022-11-23 03:55:41,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:55:41,168 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:55:41,189 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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i[995,1008] [2022-11-23 03:55:41,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:55:41,387 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:55:41,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41 WrapperNode [2022-11-23 03:55:41,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:55:41,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:55:41,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:55:41,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:55:41,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,496 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-11-23 03:55:41,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:55:41,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:55:41,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:55:41,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:55:41,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,591 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:55:41,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:55:41,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:55:41,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:55:41,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (1/1) ... [2022-11-23 03:55:41,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:55:41,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:41,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:55:41,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:55:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:55:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:55:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:55:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:55:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:55:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:55:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:55:41,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:55:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:55:41,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:55:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:55:41,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:55:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:55:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:55:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:55:41,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:55:41,707 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 03:55:41,985 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:55:41,987 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:55:42,960 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:55:43,891 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:55:43,891 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:55:43,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:43 BoogieIcfgContainer [2022-11-23 03:55:43,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:55:43,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:55:43,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:55:43,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:55:43,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:55:40" (1/3) ... [2022-11-23 03:55:43,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8f9213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:43, skipping insertion in model container [2022-11-23 03:55:43,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:41" (2/3) ... [2022-11-23 03:55:43,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8f9213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:43, skipping insertion in model container [2022-11-23 03:55:43,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:43" (3/3) ... [2022-11-23 03:55:43,914 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.oepc.i [2022-11-23 03:55:43,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:55:43,937 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-11-23 03:55:43,938 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:55:44,171 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:55:44,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 200 transitions, 415 flow [2022-11-23 03:55:44,449 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2022-11-23 03:55:44,450 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:55:44,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 378 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-23 03:55:44,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 200 transitions, 415 flow [2022-11-23 03:55:44,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 197 transitions, 403 flow [2022-11-23 03:55:44,480 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:55:44,512 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 197 transitions, 403 flow [2022-11-23 03:55:44,523 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 197 transitions, 403 flow [2022-11-23 03:55:44,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 197 transitions, 403 flow [2022-11-23 03:55:44,626 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2022-11-23 03:55:44,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:55:44,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 380 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-23 03:55:44,637 INFO L119 LiptonReduction]: Number of co-enabled transitions 9828 [2022-11-23 03:56:28,524 INFO L134 LiptonReduction]: Checked pairs total: 41797 [2022-11-23 03:56:28,524 INFO L136 LiptonReduction]: Total number of compositions: 199 [2022-11-23 03:56:28,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:56:28,547 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;@78d7de86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:56:28,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-11-23 03:56:28,549 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 03:56:28,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:56:28,550 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:28,550 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 03:56:28,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1330, now seen corresponding path program 1 times [2022-11-23 03:56:28,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:28,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080160652] [2022-11-23 03:56:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:28,755 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 03:56:28,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:28,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080160652] [2022-11-23 03:56:28,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080160652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:28,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:28,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 03:56:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877629546] [2022-11-23 03:56:28,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:28,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:56:28,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:28,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:56:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:56:28,820 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 399 [2022-11-23 03:56:28,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 193 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 03:56:28,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:28,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 399 [2022-11-23 03:56:28,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:34,347 INFO L130 PetriNetUnfolder]: 13766/19838 cut-off events. [2022-11-23 03:56:34,348 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-23 03:56:34,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39277 conditions, 19838 events. 13766/19838 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 137292 event pairs, 13766 based on Foata normal form. 0/8612 useless extension candidates. Maximal degree in co-relation 39266. Up to 19343 conditions per place. [2022-11-23 03:56:34,519 INFO L137 encePairwiseOnDemand]: 355/399 looper letters, 42 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-11-23 03:56:34,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 189 flow [2022-11-23 03:56:34,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:56:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 03:56:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 354 transitions. [2022-11-23 03:56:34,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44360902255639095 [2022-11-23 03:56:34,545 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 354 transitions. [2022-11-23 03:56:34,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 354 transitions. [2022-11-23 03:56:34,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:34,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 354 transitions. [2022-11-23 03:56:34,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 177.0) internal successors, (354), 2 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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 03:56:34,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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 03:56:34,571 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states 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 03:56:34,573 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 193 flow. Second operand 2 states and 354 transitions. [2022-11-23 03:56:34,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 189 flow [2022-11-23 03:56:34,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:56:34,585 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2022-11-23 03:56:34,588 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-11-23 03:56:34,592 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -45 predicate places. [2022-11-23 03:56:34,593 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2022-11-23 03:56:34,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 03:56:34,594 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:34,594 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:56:34,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:56:34,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:34,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1311322, now seen corresponding path program 1 times [2022-11-23 03:56:34,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:34,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729304069] [2022-11-23 03:56:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:35,004 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 03:56:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729304069] [2022-11-23 03:56:35,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729304069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:35,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:35,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:56:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395333789] [2022-11-23 03:56:35,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:35,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:56:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:56:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:56:35,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 399 [2022-11-23 03:56:35,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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 03:56:35,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:35,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 399 [2022-11-23 03:56:35,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:37,975 INFO L130 PetriNetUnfolder]: 5696/8334 cut-off events. [2022-11-23 03:56:37,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:56:37,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16528 conditions, 8334 events. 5696/8334 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 51992 event pairs, 5696 based on Foata normal form. 404/5008 useless extension candidates. Maximal degree in co-relation 16525. Up to 8133 conditions per place. [2022-11-23 03:56:38,033 INFO L137 encePairwiseOnDemand]: 390/399 looper letters, 34 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2022-11-23 03:56:38,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 156 flow [2022-11-23 03:56:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:56:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:56:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-23 03:56:38,037 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3642439431913116 [2022-11-23 03:56:38,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-23 03:56:38,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-23 03:56:38,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:38,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-23 03:56:38,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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 03:56:38,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:38,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:38,045 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 436 transitions. [2022-11-23 03:56:38,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 156 flow [2022-11-23 03:56:38,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:56:38,047 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2022-11-23 03:56:38,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-23 03:56:38,048 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -51 predicate places. [2022-11-23 03:56:38,049 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2022-11-23 03:56:38,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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 03:56:38,050 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:38,050 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:56:38,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:56:38,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1311321, now seen corresponding path program 1 times [2022-11-23 03:56:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:38,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779614364] [2022-11-23 03:56:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:38,227 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 03:56:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779614364] [2022-11-23 03:56:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779614364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:38,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:38,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:56:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599901439] [2022-11-23 03:56:38,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:38,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:56:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:38,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:56:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:56:38,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 399 [2022-11-23 03:56:38,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 03:56:38,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:38,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 399 [2022-11-23 03:56:38,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:40,138 INFO L130 PetriNetUnfolder]: 5077/7862 cut-off events. [2022-11-23 03:56:40,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:56:40,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15666 conditions, 7862 events. 5077/7862 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 49750 event pairs, 2879 based on Foata normal form. 0/5878 useless extension candidates. Maximal degree in co-relation 15662. Up to 4172 conditions per place. [2022-11-23 03:56:40,188 INFO L137 encePairwiseOnDemand]: 377/399 looper letters, 38 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2022-11-23 03:56:40,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 206 flow [2022-11-23 03:56:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:56:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:56:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-23 03:56:40,191 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3659147869674185 [2022-11-23 03:56:40,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-23 03:56:40,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-23 03:56:40,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:40,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-23 03:56:40,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:40,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:40,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:40,199 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 438 transitions. [2022-11-23 03:56:40,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 206 flow [2022-11-23 03:56:40,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:56:40,202 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 177 flow [2022-11-23 03:56:40,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-11-23 03:56:40,204 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -51 predicate places. [2022-11-23 03:56:40,205 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 177 flow [2022-11-23 03:56:40,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 03:56:40,205 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:40,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:40,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:56:40,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1352453751, now seen corresponding path program 1 times [2022-11-23 03:56:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:40,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646097679] [2022-11-23 03:56:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:40,540 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 03:56:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:40,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646097679] [2022-11-23 03:56:40,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646097679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:40,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:40,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:56:40,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038070294] [2022-11-23 03:56:40,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:40,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:56:40,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:56:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:56:40,545 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 399 [2022-11-23 03:56:40,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 03:56:40,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:40,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 399 [2022-11-23 03:56:40,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:42,570 INFO L130 PetriNetUnfolder]: 4649/7618 cut-off events. [2022-11-23 03:56:42,570 INFO L131 PetriNetUnfolder]: For 2699/2824 co-relation queries the response was YES. [2022-11-23 03:56:42,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21037 conditions, 7618 events. 4649/7618 cut-off events. For 2699/2824 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 53071 event pairs, 1867 based on Foata normal form. 0/6577 useless extension candidates. Maximal degree in co-relation 21032. Up to 4127 conditions per place. [2022-11-23 03:56:42,634 INFO L137 encePairwiseOnDemand]: 395/399 looper letters, 67 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2022-11-23 03:56:42,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 433 flow [2022-11-23 03:56:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:56:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:56:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2022-11-23 03:56:42,638 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38262322472848787 [2022-11-23 03:56:42,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2022-11-23 03:56:42,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2022-11-23 03:56:42,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:42,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2022-11-23 03:56:42,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:42,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:42,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:42,647 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 177 flow. Second operand 3 states and 458 transitions. [2022-11-23 03:56:42,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 433 flow [2022-11-23 03:56:42,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:56:42,692 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 168 flow [2022-11-23 03:56:42,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-11-23 03:56:42,694 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -50 predicate places. [2022-11-23 03:56:42,694 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 168 flow [2022-11-23 03:56:42,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 03:56:42,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:42,695 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:42,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:56:42,696 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1352453362, now seen corresponding path program 1 times [2022-11-23 03:56:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:42,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722814430] [2022-11-23 03:56:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:43,398 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 03:56:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:43,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722814430] [2022-11-23 03:56:43,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722814430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:43,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:43,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:56:43,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074546556] [2022-11-23 03:56:43,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:43,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:56:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:43,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:56:43,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:56:43,405 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 399 [2022-11-23 03:56:43,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 03:56:43,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:43,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 399 [2022-11-23 03:56:43,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:45,062 INFO L130 PetriNetUnfolder]: 4574/7328 cut-off events. [2022-11-23 03:56:45,062 INFO L131 PetriNetUnfolder]: For 1804/1865 co-relation queries the response was YES. [2022-11-23 03:56:45,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20151 conditions, 7328 events. 4574/7328 cut-off events. For 1804/1865 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 48540 event pairs, 1893 based on Foata normal form. 0/5730 useless extension candidates. Maximal degree in co-relation 20145. Up to 5896 conditions per place. [2022-11-23 03:56:45,113 INFO L137 encePairwiseOnDemand]: 395/399 looper letters, 62 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2022-11-23 03:56:45,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 402 flow [2022-11-23 03:56:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:56:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:56:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-11-23 03:56:45,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3817878028404344 [2022-11-23 03:56:45,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2022-11-23 03:56:45,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2022-11-23 03:56:45,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:45,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2022-11-23 03:56:45,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:45,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:45,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:45,137 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 168 flow. Second operand 3 states and 457 transitions. [2022-11-23 03:56:45,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 402 flow [2022-11-23 03:56:45,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:56:45,141 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 205 flow [2022-11-23 03:56:45,141 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2022-11-23 03:56:45,145 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -49 predicate places. [2022-11-23 03:56:45,145 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 205 flow [2022-11-23 03:56:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 03:56:45,146 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:45,146 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:45,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:56:45,147 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1023616651, now seen corresponding path program 1 times [2022-11-23 03:56:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:45,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386543358] [2022-11-23 03:56:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:45,854 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 03:56:45,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:45,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386543358] [2022-11-23 03:56:45,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386543358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:45,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:45,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:56:45,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166585442] [2022-11-23 03:56:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:45,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:56:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:56:45,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:56:45,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 399 [2022-11-23 03:56:45,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:45,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:45,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 399 [2022-11-23 03:56:45,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:47,394 INFO L130 PetriNetUnfolder]: 4558/7314 cut-off events. [2022-11-23 03:56:47,394 INFO L131 PetriNetUnfolder]: For 2071/2109 co-relation queries the response was YES. [2022-11-23 03:56:47,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20673 conditions, 7314 events. 4558/7314 cut-off events. For 2071/2109 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 48496 event pairs, 1396 based on Foata normal form. 8/5910 useless extension candidates. Maximal degree in co-relation 20666. Up to 5046 conditions per place. [2022-11-23 03:56:47,440 INFO L137 encePairwiseOnDemand]: 395/399 looper letters, 79 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2022-11-23 03:56:47,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 519 flow [2022-11-23 03:56:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:56:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:56:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2022-11-23 03:56:47,446 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37468671679197996 [2022-11-23 03:56:47,446 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2022-11-23 03:56:47,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2022-11-23 03:56:47,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:47,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2022-11-23 03:56:47,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states 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 03:56:47,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:56:47,455 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:56:47,456 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 205 flow. Second operand 4 states and 598 transitions. [2022-11-23 03:56:47,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 519 flow [2022-11-23 03:56:47,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 514 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:56:47,465 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 220 flow [2022-11-23 03:56:47,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-11-23 03:56:47,470 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -46 predicate places. [2022-11-23 03:56:47,470 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 220 flow [2022-11-23 03:56:47,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:47,472 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:47,472 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:47,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:56:47,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1023616262, now seen corresponding path program 1 times [2022-11-23 03:56:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349841903] [2022-11-23 03:56:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:47,720 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 03:56:47,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:47,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349841903] [2022-11-23 03:56:47,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349841903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:47,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:47,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:56:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781428831] [2022-11-23 03:56:47,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:56:47,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:47,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:56:47,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:56:47,807 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 399 [2022-11-23 03:56:47,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:47,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:47,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 399 [2022-11-23 03:56:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:49,462 INFO L130 PetriNetUnfolder]: 4991/8172 cut-off events. [2022-11-23 03:56:49,462 INFO L131 PetriNetUnfolder]: For 3684/3753 co-relation queries the response was YES. [2022-11-23 03:56:49,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23447 conditions, 8172 events. 4991/8172 cut-off events. For 3684/3753 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 57571 event pairs, 2048 based on Foata normal form. 0/6938 useless extension candidates. Maximal degree in co-relation 23439. Up to 5302 conditions per place. [2022-11-23 03:56:49,502 INFO L137 encePairwiseOnDemand]: 393/399 looper letters, 57 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2022-11-23 03:56:49,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 415 flow [2022-11-23 03:56:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:56:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:56:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-23 03:56:49,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3642439431913116 [2022-11-23 03:56:49,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-23 03:56:49,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-23 03:56:49,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:49,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-23 03:56:49,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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 03:56:49,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:49,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:49,512 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 220 flow. Second operand 3 states and 436 transitions. [2022-11-23 03:56:49,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 415 flow [2022-11-23 03:56:49,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 398 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 03:56:49,516 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 250 flow [2022-11-23 03:56:49,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-11-23 03:56:49,517 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -46 predicate places. [2022-11-23 03:56:49,517 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 250 flow [2022-11-23 03:56:49,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:49,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:49,518 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:56:49,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1023616263, now seen corresponding path program 1 times [2022-11-23 03:56:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:49,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820546994] [2022-11-23 03:56:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:56:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:50,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820546994] [2022-11-23 03:56:50,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820546994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:50,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:50,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:56:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429024608] [2022-11-23 03:56:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:50,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:56:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:56:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:56:50,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 399 [2022-11-23 03:56:50,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:50,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:50,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 399 [2022-11-23 03:56:50,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:53,133 INFO L130 PetriNetUnfolder]: 5817/9191 cut-off events. [2022-11-23 03:56:53,134 INFO L131 PetriNetUnfolder]: For 6770/6770 co-relation queries the response was YES. [2022-11-23 03:56:53,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28645 conditions, 9191 events. 5817/9191 cut-off events. For 6770/6770 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 62891 event pairs, 1319 based on Foata normal form. 119/7636 useless extension candidates. Maximal degree in co-relation 28636. Up to 3644 conditions per place. [2022-11-23 03:56:53,182 INFO L137 encePairwiseOnDemand]: 379/399 looper letters, 112 selfloop transitions, 49 changer transitions 0/162 dead transitions. [2022-11-23 03:56:53,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 162 transitions, 1008 flow [2022-11-23 03:56:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:56:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-23 03:56:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1334 transitions. [2022-11-23 03:56:53,188 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3343358395989975 [2022-11-23 03:56:53,188 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1334 transitions. [2022-11-23 03:56:53,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1334 transitions. [2022-11-23 03:56:53,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:53,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1334 transitions. [2022-11-23 03:56:53,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.4) internal successors, (1334), 10 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states 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 03:56:53,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 399.0) internal successors, (4389), 11 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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 03:56:53,203 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 399.0) internal successors, (4389), 11 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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 03:56:53,203 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 250 flow. Second operand 10 states and 1334 transitions. [2022-11-23 03:56:53,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 162 transitions, 1008 flow [2022-11-23 03:56:53,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 162 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:56:53,250 INFO L231 Difference]: Finished difference. Result has 63 places, 91 transitions, 611 flow [2022-11-23 03:56:53,250 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=611, PETRI_PLACES=63, PETRI_TRANSITIONS=91} [2022-11-23 03:56:53,251 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -38 predicate places. [2022-11-23 03:56:53,251 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 91 transitions, 611 flow [2022-11-23 03:56:53,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:56:53,252 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:53,252 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:56:53,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1023898255, now seen corresponding path program 1 times [2022-11-23 03:56:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:53,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347102975] [2022-11-23 03:56:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:56:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:53,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347102975] [2022-11-23 03:56:53,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347102975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:53,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:53,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:56:53,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474424904] [2022-11-23 03:56:53,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:53,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:56:53,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:56:53,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:56:54,063 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 399 [2022-11-23 03:56:54,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 91 transitions, 611 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 03:56:54,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:54,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 399 [2022-11-23 03:56:54,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:55,723 INFO L130 PetriNetUnfolder]: 5423/8670 cut-off events. [2022-11-23 03:56:55,724 INFO L131 PetriNetUnfolder]: For 12186/12241 co-relation queries the response was YES. [2022-11-23 03:56:55,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32348 conditions, 8670 events. 5423/8670 cut-off events. For 12186/12241 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 59990 event pairs, 2320 based on Foata normal form. 3/7490 useless extension candidates. Maximal degree in co-relation 32338. Up to 7326 conditions per place. [2022-11-23 03:56:55,774 INFO L137 encePairwiseOnDemand]: 395/399 looper letters, 102 selfloop transitions, 11 changer transitions 0/130 dead transitions. [2022-11-23 03:56:55,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 130 transitions, 1106 flow [2022-11-23 03:56:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:56:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:56:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2022-11-23 03:56:55,793 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35756056808688386 [2022-11-23 03:56:55,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2022-11-23 03:56:55,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2022-11-23 03:56:55,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:55,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2022-11-23 03:56:55,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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 03:56:55,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:55,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:56:55,800 INFO L175 Difference]: Start difference. First operand has 63 places, 91 transitions, 611 flow. Second operand 3 states and 428 transitions. [2022-11-23 03:56:55,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 130 transitions, 1106 flow [2022-11-23 03:56:55,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 130 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:56:55,857 INFO L231 Difference]: Finished difference. Result has 65 places, 101 transitions, 773 flow [2022-11-23 03:56:55,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=65, PETRI_TRANSITIONS=101} [2022-11-23 03:56:55,860 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -36 predicate places. [2022-11-23 03:56:55,860 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 101 transitions, 773 flow [2022-11-23 03:56:55,864 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 03:56:55,864 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:55,864 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:55,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:56:55,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:55,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1667345626, now seen corresponding path program 1 times [2022-11-23 03:56:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:55,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218511656] [2022-11-23 03:56:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:56,438 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 03:56:56,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:56,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218511656] [2022-11-23 03:56:56,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218511656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:56,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:56,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:56:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754774584] [2022-11-23 03:56:56,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:56,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:56:56,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:56:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:56:56,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 399 [2022-11-23 03:56:56,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 101 transitions, 773 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 03:56:56,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:56,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 399 [2022-11-23 03:56:56,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:56:58,406 INFO L130 PetriNetUnfolder]: 5414/8680 cut-off events. [2022-11-23 03:56:58,407 INFO L131 PetriNetUnfolder]: For 15877/15927 co-relation queries the response was YES. [2022-11-23 03:56:58,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33592 conditions, 8680 events. 5414/8680 cut-off events. For 15877/15927 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 60925 event pairs, 1416 based on Foata normal form. 22/7518 useless extension candidates. Maximal degree in co-relation 33581. Up to 6799 conditions per place. [2022-11-23 03:56:58,455 INFO L137 encePairwiseOnDemand]: 395/399 looper letters, 132 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2022-11-23 03:56:58,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 161 transitions, 1405 flow [2022-11-23 03:56:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:56:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:56:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2022-11-23 03:56:58,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37218045112781956 [2022-11-23 03:56:58,459 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2022-11-23 03:56:58,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2022-11-23 03:56:58,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:56:58,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2022-11-23 03:56:58,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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 03:56:58,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:56:58,466 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:56:58,466 INFO L175 Difference]: Start difference. First operand has 65 places, 101 transitions, 773 flow. Second operand 4 states and 594 transitions. [2022-11-23 03:56:58,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 161 transitions, 1405 flow [2022-11-23 03:56:58,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 161 transitions, 1394 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:56:58,512 INFO L231 Difference]: Finished difference. Result has 68 places, 101 transitions, 798 flow [2022-11-23 03:56:58,513 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=798, PETRI_PLACES=68, PETRI_TRANSITIONS=101} [2022-11-23 03:56:58,513 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -33 predicate places. [2022-11-23 03:56:58,513 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 101 transitions, 798 flow [2022-11-23 03:56:58,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 03:56:58,514 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:56:58,514 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:58,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:56:58,515 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:56:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1676071754, now seen corresponding path program 1 times [2022-11-23 03:56:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:58,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738378713] [2022-11-23 03:56:58,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:58,823 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 03:56:58,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:58,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738378713] [2022-11-23 03:56:58,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738378713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:58,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:58,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:56:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306563050] [2022-11-23 03:56:58,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:58,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:56:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:56:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:56:58,833 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 399 [2022-11-23 03:56:58,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 798 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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 03:56:58,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:56:58,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 399 [2022-11-23 03:56:58,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:01,619 INFO L130 PetriNetUnfolder]: 9456/14704 cut-off events. [2022-11-23 03:57:01,619 INFO L131 PetriNetUnfolder]: For 25312/25790 co-relation queries the response was YES. [2022-11-23 03:57:01,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55360 conditions, 14704 events. 9456/14704 cut-off events. For 25312/25790 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 105305 event pairs, 2216 based on Foata normal form. 205/12660 useless extension candidates. Maximal degree in co-relation 55348. Up to 6145 conditions per place. [2022-11-23 03:57:01,716 INFO L137 encePairwiseOnDemand]: 395/399 looper letters, 161 selfloop transitions, 3 changer transitions 0/180 dead transitions. [2022-11-23 03:57:01,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 180 transitions, 1590 flow [2022-11-23 03:57:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:57:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:57:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2022-11-23 03:57:01,719 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37468671679197996 [2022-11-23 03:57:01,719 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2022-11-23 03:57:01,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2022-11-23 03:57:01,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:01,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2022-11-23 03:57:01,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states 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 03:57:01,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:57:01,726 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:57:01,727 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 798 flow. Second operand 4 states and 598 transitions. [2022-11-23 03:57:01,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 180 transitions, 1590 flow [2022-11-23 03:57:01,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 180 transitions, 1571 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 03:57:01,810 INFO L231 Difference]: Finished difference. Result has 71 places, 102 transitions, 802 flow [2022-11-23 03:57:01,810 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=802, PETRI_PLACES=71, PETRI_TRANSITIONS=102} [2022-11-23 03:57:01,811 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -30 predicate places. [2022-11-23 03:57:01,811 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 102 transitions, 802 flow [2022-11-23 03:57:01,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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 03:57:01,812 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:01,812 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:01,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:57:01,812 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1667424545, now seen corresponding path program 1 times [2022-11-23 03:57:01,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:01,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807611012] [2022-11-23 03:57:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:02,003 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 03:57:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:02,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807611012] [2022-11-23 03:57:02,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807611012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:02,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:57:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103760378] [2022-11-23 03:57:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:02,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:57:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:02,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:57:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:57:02,129 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 399 [2022-11-23 03:57:02,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 102 transitions, 802 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 03:57:02,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:02,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 399 [2022-11-23 03:57:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:04,436 INFO L130 PetriNetUnfolder]: 6742/10680 cut-off events. [2022-11-23 03:57:04,437 INFO L131 PetriNetUnfolder]: For 15268/15284 co-relation queries the response was YES. [2022-11-23 03:57:04,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40849 conditions, 10680 events. 6742/10680 cut-off events. For 15268/15284 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 72305 event pairs, 2324 based on Foata normal form. 160/9522 useless extension candidates. Maximal degree in co-relation 40835. Up to 4553 conditions per place. [2022-11-23 03:57:04,512 INFO L137 encePairwiseOnDemand]: 381/399 looper letters, 85 selfloop transitions, 51 changer transitions 0/137 dead transitions. [2022-11-23 03:57:04,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 137 transitions, 1328 flow [2022-11-23 03:57:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:57:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:57:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2022-11-23 03:57:04,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3458646616541353 [2022-11-23 03:57:04,516 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2022-11-23 03:57:04,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2022-11-23 03:57:04,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:04,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2022-11-23 03:57:04,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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 03:57:04,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:57:04,523 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:57:04,523 INFO L175 Difference]: Start difference. First operand has 71 places, 102 transitions, 802 flow. Second operand 4 states and 552 transitions. [2022-11-23 03:57:04,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 137 transitions, 1328 flow [2022-11-23 03:57:04,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 1318 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 03:57:04,598 INFO L231 Difference]: Finished difference. Result has 74 places, 116 transitions, 1129 flow [2022-11-23 03:57:04,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1129, PETRI_PLACES=74, PETRI_TRANSITIONS=116} [2022-11-23 03:57:04,599 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -27 predicate places. [2022-11-23 03:57:04,599 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 116 transitions, 1129 flow [2022-11-23 03:57:04,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 03:57:04,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:04,600 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:04,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:57:04,601 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:04,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 150555406, now seen corresponding path program 1 times [2022-11-23 03:57:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:04,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921514660] [2022-11-23 03:57:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:05,568 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 03:57:05,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:05,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921514660] [2022-11-23 03:57:05,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921514660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:05,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:05,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:57:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506660352] [2022-11-23 03:57:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:05,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:57:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:57:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:57:06,193 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 399 [2022-11-23 03:57:06,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 116 transitions, 1129 flow. Second operand has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states 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 03:57:06,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:06,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 399 [2022-11-23 03:57:06,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:09,228 INFO L130 PetriNetUnfolder]: 7360/11796 cut-off events. [2022-11-23 03:57:09,228 INFO L131 PetriNetUnfolder]: For 24942/25187 co-relation queries the response was YES. [2022-11-23 03:57:09,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48344 conditions, 11796 events. 7360/11796 cut-off events. For 24942/25187 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 84403 event pairs, 3096 based on Foata normal form. 26/10746 useless extension candidates. Maximal degree in co-relation 48329. Up to 6487 conditions per place. [2022-11-23 03:57:09,306 INFO L137 encePairwiseOnDemand]: 391/399 looper letters, 145 selfloop transitions, 31 changer transitions 1/198 dead transitions. [2022-11-23 03:57:09,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 198 transitions, 1992 flow [2022-11-23 03:57:09,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:57:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:57:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1151 transitions. [2022-11-23 03:57:09,312 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3205235310498468 [2022-11-23 03:57:09,312 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1151 transitions. [2022-11-23 03:57:09,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1151 transitions. [2022-11-23 03:57:09,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:09,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1151 transitions. [2022-11-23 03:57:09,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.88888888888889) internal successors, (1151), 9 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states 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 03:57:09,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states 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 03:57:09,323 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states 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 03:57:09,323 INFO L175 Difference]: Start difference. First operand has 74 places, 116 transitions, 1129 flow. Second operand 9 states and 1151 transitions. [2022-11-23 03:57:09,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 198 transitions, 1992 flow [2022-11-23 03:57:09,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 198 transitions, 1984 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:57:09,419 INFO L231 Difference]: Finished difference. Result has 84 places, 128 transitions, 1377 flow [2022-11-23 03:57:09,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1377, PETRI_PLACES=84, PETRI_TRANSITIONS=128} [2022-11-23 03:57:09,420 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -17 predicate places. [2022-11-23 03:57:09,420 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 128 transitions, 1377 flow [2022-11-23 03:57:09,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states 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 03:57:09,421 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:09,421 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:09,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:57:09,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash 150555286, now seen corresponding path program 1 times [2022-11-23 03:57:09,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:09,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142090659] [2022-11-23 03:57:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:09,726 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 03:57:09,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:09,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142090659] [2022-11-23 03:57:09,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142090659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:09,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:09,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:57:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308519121] [2022-11-23 03:57:09,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:09,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:57:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:57:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:57:09,967 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 399 [2022-11-23 03:57:09,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 128 transitions, 1377 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states 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 03:57:09,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:09,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 399 [2022-11-23 03:57:09,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:12,172 INFO L130 PetriNetUnfolder]: 6219/9870 cut-off events. [2022-11-23 03:57:12,173 INFO L131 PetriNetUnfolder]: For 21975/22007 co-relation queries the response was YES. [2022-11-23 03:57:12,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40578 conditions, 9870 events. 6219/9870 cut-off events. For 21975/22007 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 65971 event pairs, 2332 based on Foata normal form. 270/9716 useless extension candidates. Maximal degree in co-relation 40559. Up to 4125 conditions per place. [2022-11-23 03:57:12,251 INFO L137 encePairwiseOnDemand]: 380/399 looper letters, 121 selfloop transitions, 37 changer transitions 0/159 dead transitions. [2022-11-23 03:57:12,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 159 transitions, 1817 flow [2022-11-23 03:57:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:57:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:57:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2022-11-23 03:57:12,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3316624895572264 [2022-11-23 03:57:12,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 794 transitions. [2022-11-23 03:57:12,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 794 transitions. [2022-11-23 03:57:12,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:12,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 794 transitions. [2022-11-23 03:57:12,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states 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 03:57:12,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states 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 03:57:12,264 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states 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 03:57:12,265 INFO L175 Difference]: Start difference. First operand has 84 places, 128 transitions, 1377 flow. Second operand 6 states and 794 transitions. [2022-11-23 03:57:12,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 159 transitions, 1817 flow [2022-11-23 03:57:12,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 159 transitions, 1811 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-23 03:57:12,399 INFO L231 Difference]: Finished difference. Result has 90 places, 128 transitions, 1481 flow [2022-11-23 03:57:12,400 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1481, PETRI_PLACES=90, PETRI_TRANSITIONS=128} [2022-11-23 03:57:12,401 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -11 predicate places. [2022-11-23 03:57:12,401 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 128 transitions, 1481 flow [2022-11-23 03:57:12,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states 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 03:57:12,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:12,402 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:12,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:57:12,402 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1679970560, now seen corresponding path program 1 times [2022-11-23 03:57:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:12,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040341737] [2022-11-23 03:57:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:14,621 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 03:57:14,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:14,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040341737] [2022-11-23 03:57:14,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040341737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:14,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:14,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:57:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690130993] [2022-11-23 03:57:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:14,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:57:14,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:14,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:57:14,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:57:14,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 399 [2022-11-23 03:57:14,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 128 transitions, 1481 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 03:57:14,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:14,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 399 [2022-11-23 03:57:14,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:16,977 INFO L130 PetriNetUnfolder]: 6879/10872 cut-off events. [2022-11-23 03:57:16,977 INFO L131 PetriNetUnfolder]: For 30138/30175 co-relation queries the response was YES. [2022-11-23 03:57:17,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48271 conditions, 10872 events. 6879/10872 cut-off events. For 30138/30175 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 73643 event pairs, 2933 based on Foata normal form. 53/10535 useless extension candidates. Maximal degree in co-relation 48250. Up to 8231 conditions per place. [2022-11-23 03:57:17,061 INFO L137 encePairwiseOnDemand]: 391/399 looper letters, 131 selfloop transitions, 51 changer transitions 0/185 dead transitions. [2022-11-23 03:57:17,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 185 transitions, 2327 flow [2022-11-23 03:57:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:57:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:57:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2022-11-23 03:57:17,066 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-11-23 03:57:17,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2022-11-23 03:57:17,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2022-11-23 03:57:17,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:17,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2022-11-23 03:57:17,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:57:17,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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 03:57:17,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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 03:57:17,074 INFO L175 Difference]: Start difference. First operand has 90 places, 128 transitions, 1481 flow. Second operand 5 states and 703 transitions. [2022-11-23 03:57:17,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 185 transitions, 2327 flow [2022-11-23 03:57:17,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 185 transitions, 2232 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-11-23 03:57:17,319 INFO L231 Difference]: Finished difference. Result has 90 places, 142 transitions, 1687 flow [2022-11-23 03:57:17,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1687, PETRI_PLACES=90, PETRI_TRANSITIONS=142} [2022-11-23 03:57:17,319 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -11 predicate places. [2022-11-23 03:57:17,320 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 142 transitions, 1687 flow [2022-11-23 03:57:17,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 03:57:17,320 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:17,320 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:17,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 03:57:17,320 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1592246142, now seen corresponding path program 1 times [2022-11-23 03:57:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:17,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031036799] [2022-11-23 03:57:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:18,215 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 03:57:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:18,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031036799] [2022-11-23 03:57:18,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031036799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:18,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:18,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:57:18,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050025515] [2022-11-23 03:57:18,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:18,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:57:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:57:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:57:18,858 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 399 [2022-11-23 03:57:18,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 142 transitions, 1687 flow. Second operand has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states 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 03:57:18,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:18,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 399 [2022-11-23 03:57:18,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:22,290 INFO L130 PetriNetUnfolder]: 9196/14650 cut-off events. [2022-11-23 03:57:22,290 INFO L131 PetriNetUnfolder]: For 52771/53409 co-relation queries the response was YES. [2022-11-23 03:57:22,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67793 conditions, 14650 events. 9196/14650 cut-off events. For 52771/53409 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 107225 event pairs, 2611 based on Foata normal form. 82/14119 useless extension candidates. Maximal degree in co-relation 67771. Up to 7011 conditions per place. [2022-11-23 03:57:22,591 INFO L137 encePairwiseOnDemand]: 391/399 looper letters, 194 selfloop transitions, 44 changer transitions 0/269 dead transitions. [2022-11-23 03:57:22,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 269 transitions, 3285 flow [2022-11-23 03:57:22,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:57:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:57:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1148 transitions. [2022-11-23 03:57:22,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31968810916179335 [2022-11-23 03:57:22,598 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1148 transitions. [2022-11-23 03:57:22,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1148 transitions. [2022-11-23 03:57:22,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:22,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1148 transitions. [2022-11-23 03:57:22,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.55555555555556) internal successors, (1148), 9 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states 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 03:57:22,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states 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 03:57:22,610 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states 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 03:57:22,610 INFO L175 Difference]: Start difference. First operand has 90 places, 142 transitions, 1687 flow. Second operand 9 states and 1148 transitions. [2022-11-23 03:57:22,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 269 transitions, 3285 flow [2022-11-23 03:57:23,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 269 transitions, 3164 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:57:23,019 INFO L231 Difference]: Finished difference. Result has 97 places, 186 transitions, 2207 flow [2022-11-23 03:57:23,019 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2207, PETRI_PLACES=97, PETRI_TRANSITIONS=186} [2022-11-23 03:57:23,020 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -4 predicate places. [2022-11-23 03:57:23,020 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 186 transitions, 2207 flow [2022-11-23 03:57:23,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states 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 03:57:23,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:23,021 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:23,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 03:57:23,021 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1411691592, now seen corresponding path program 1 times [2022-11-23 03:57:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:23,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298553852] [2022-11-23 03:57:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:24,067 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 03:57:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:24,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298553852] [2022-11-23 03:57:24,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298553852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:24,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:24,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:57:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573901457] [2022-11-23 03:57:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:24,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:57:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:24,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:57:24,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:57:24,347 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 399 [2022-11-23 03:57:24,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 186 transitions, 2207 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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 03:57:24,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:24,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 399 [2022-11-23 03:57:24,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:28,755 INFO L130 PetriNetUnfolder]: 13844/21535 cut-off events. [2022-11-23 03:57:28,755 INFO L131 PetriNetUnfolder]: For 77339/77413 co-relation queries the response was YES. [2022-11-23 03:57:28,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102959 conditions, 21535 events. 13844/21535 cut-off events. For 77339/77413 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 158200 event pairs, 3266 based on Foata normal form. 106/21241 useless extension candidates. Maximal degree in co-relation 102935. Up to 13213 conditions per place. [2022-11-23 03:57:28,933 INFO L137 encePairwiseOnDemand]: 390/399 looper letters, 308 selfloop transitions, 29 changer transitions 0/338 dead transitions. [2022-11-23 03:57:28,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 338 transitions, 4595 flow [2022-11-23 03:57:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:57:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:57:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2022-11-23 03:57:28,938 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31686358754027927 [2022-11-23 03:57:28,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2022-11-23 03:57:28,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2022-11-23 03:57:28,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:28,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2022-11-23 03:57:28,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:57:28,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 399.0) internal successors, (3192), 8 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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 03:57:28,946 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 399.0) internal successors, (3192), 8 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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 03:57:28,947 INFO L175 Difference]: Start difference. First operand has 97 places, 186 transitions, 2207 flow. Second operand 7 states and 885 transitions. [2022-11-23 03:57:28,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 338 transitions, 4595 flow [2022-11-23 03:57:30,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 338 transitions, 4592 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:57:30,224 INFO L231 Difference]: Finished difference. Result has 106 places, 202 transitions, 2514 flow [2022-11-23 03:57:30,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2514, PETRI_PLACES=106, PETRI_TRANSITIONS=202} [2022-11-23 03:57:30,225 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2022-11-23 03:57:30,225 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 202 transitions, 2514 flow [2022-11-23 03:57:30,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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 03:57:30,226 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:30,226 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:30,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 03:57:30,227 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash 371254622, now seen corresponding path program 2 times [2022-11-23 03:57:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:30,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081315967] [2022-11-23 03:57:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:32,909 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 03:57:32,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:32,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081315967] [2022-11-23 03:57:32,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081315967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:32,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:32,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:57:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766244091] [2022-11-23 03:57:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:32,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:57:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:32,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:57:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:57:32,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 399 [2022-11-23 03:57:32,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 202 transitions, 2514 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 03:57:32,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:32,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 399 [2022-11-23 03:57:32,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:41,142 INFO L130 PetriNetUnfolder]: 20111/31340 cut-off events. [2022-11-23 03:57:41,142 INFO L131 PetriNetUnfolder]: For 139444/139548 co-relation queries the response was YES. [2022-11-23 03:57:41,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154835 conditions, 31340 events. 20111/31340 cut-off events. For 139444/139548 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 246823 event pairs, 2855 based on Foata normal form. 190/31101 useless extension candidates. Maximal degree in co-relation 154806. Up to 14564 conditions per place. [2022-11-23 03:57:41,385 INFO L137 encePairwiseOnDemand]: 391/399 looper letters, 339 selfloop transitions, 77 changer transitions 0/419 dead transitions. [2022-11-23 03:57:41,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 419 transitions, 6061 flow [2022-11-23 03:57:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:57:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:57:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2022-11-23 03:57:41,390 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3493734335839599 [2022-11-23 03:57:41,390 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2022-11-23 03:57:41,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2022-11-23 03:57:41,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:41,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2022-11-23 03:57:41,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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 03:57:41,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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 03:57:41,397 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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 03:57:41,397 INFO L175 Difference]: Start difference. First operand has 106 places, 202 transitions, 2514 flow. Second operand 5 states and 697 transitions. [2022-11-23 03:57:41,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 419 transitions, 6061 flow [2022-11-23 03:57:44,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 419 transitions, 5997 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-23 03:57:44,495 INFO L231 Difference]: Finished difference. Result has 109 places, 232 transitions, 3060 flow [2022-11-23 03:57:44,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3060, PETRI_PLACES=109, PETRI_TRANSITIONS=232} [2022-11-23 03:57:44,495 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 8 predicate places. [2022-11-23 03:57:44,496 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 232 transitions, 3060 flow [2022-11-23 03:57:44,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 03:57:44,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:44,496 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:44,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 03:57:44,497 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash 372251768, now seen corresponding path program 1 times [2022-11-23 03:57:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:44,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154938241] [2022-11-23 03:57:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:44,621 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 03:57:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:44,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154938241] [2022-11-23 03:57:44,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154938241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:44,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:44,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:57:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937612117] [2022-11-23 03:57:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:44,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:57:44,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:57:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:57:44,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 399 [2022-11-23 03:57:44,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 232 transitions, 3060 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 03:57:44,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:44,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 399 [2022-11-23 03:57:44,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:57:52,684 INFO L130 PetriNetUnfolder]: 19347/29573 cut-off events. [2022-11-23 03:57:52,684 INFO L131 PetriNetUnfolder]: For 158623/158671 co-relation queries the response was YES. [2022-11-23 03:57:52,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152111 conditions, 29573 events. 19347/29573 cut-off events. For 158623/158671 co-relation queries the response was YES. Maximal size of possible extension queue 1781. Compared 222720 event pairs, 8514 based on Foata normal form. 444/29588 useless extension candidates. Maximal degree in co-relation 152080. Up to 23076 conditions per place. [2022-11-23 03:57:52,943 INFO L137 encePairwiseOnDemand]: 382/399 looper letters, 55 selfloop transitions, 44 changer transitions 150/250 dead transitions. [2022-11-23 03:57:52,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 250 transitions, 3747 flow [2022-11-23 03:57:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:57:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:57:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2022-11-23 03:57:52,946 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.33959899749373434 [2022-11-23 03:57:52,946 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2022-11-23 03:57:52,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2022-11-23 03:57:52,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:52,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2022-11-23 03:57:52,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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 03:57:52,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:57:52,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:57:52,952 INFO L175 Difference]: Start difference. First operand has 109 places, 232 transitions, 3060 flow. Second operand 4 states and 542 transitions. [2022-11-23 03:57:52,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 250 transitions, 3747 flow [2022-11-23 03:57:56,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 250 transitions, 3746 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:57:56,416 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 1310 flow [2022-11-23 03:57:56,417 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=3049, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1310, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2022-11-23 03:57:56,417 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 10 predicate places. [2022-11-23 03:57:56,418 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 1310 flow [2022-11-23 03:57:56,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 03:57:56,418 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:56,418 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:56,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 03:57:56,419 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:57:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash -623030462, now seen corresponding path program 2 times [2022-11-23 03:57:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:56,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251071743] [2022-11-23 03:57:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:58,163 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 03:57:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:58,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251071743] [2022-11-23 03:57:58,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251071743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:58,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:58,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:57:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565754259] [2022-11-23 03:57:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:58,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:57:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:58,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:57:58,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:57:58,422 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 399 [2022-11-23 03:57:58,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 1310 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states 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 03:57:58,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:57:58,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 399 [2022-11-23 03:57:58,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:58:01,242 INFO L130 PetriNetUnfolder]: 5586/8944 cut-off events. [2022-11-23 03:58:01,242 INFO L131 PetriNetUnfolder]: For 37762/37783 co-relation queries the response was YES. [2022-11-23 03:58:01,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40584 conditions, 8944 events. 5586/8944 cut-off events. For 37762/37783 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 59575 event pairs, 1156 based on Foata normal form. 101/9045 useless extension candidates. Maximal degree in co-relation 40552. Up to 5557 conditions per place. [2022-11-23 03:58:01,342 INFO L137 encePairwiseOnDemand]: 387/399 looper letters, 111 selfloop transitions, 46 changer transitions 6/164 dead transitions. [2022-11-23 03:58:01,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 164 transitions, 2400 flow [2022-11-23 03:58:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:58:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:58:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2022-11-23 03:58:01,345 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30994152046783624 [2022-11-23 03:58:01,345 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2022-11-23 03:58:01,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2022-11-23 03:58:01,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:58:01,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2022-11-23 03:58:01,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.66666666666667) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states 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 03:58:01,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states 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 03:58:01,351 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states 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 03:58:01,351 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 1310 flow. Second operand 9 states and 1113 transitions. [2022-11-23 03:58:01,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 164 transitions, 2400 flow [2022-11-23 03:58:01,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 164 transitions, 2086 flow, removed 67 selfloop flow, removed 12 redundant places. [2022-11-23 03:58:01,541 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 1631 flow [2022-11-23 03:58:01,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1631, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2022-11-23 03:58:01,541 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2022-11-23 03:58:01,541 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 1631 flow [2022-11-23 03:58:01,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states 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 03:58:01,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:58:01,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:01,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 03:58:01,542 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:58:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash 144693194, now seen corresponding path program 1 times [2022-11-23 03:58:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:01,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083966971] [2022-11-23 03:58:01,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:01,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,183 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 03:58:02,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:02,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083966971] [2022-11-23 03:58:02,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083966971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:02,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:02,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:58:02,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043266150] [2022-11-23 03:58:02,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:02,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:58:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:02,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:58:02,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:58:02,571 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 399 [2022-11-23 03:58:02,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 1631 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states 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 03:58:02,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:58:02,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 399 [2022-11-23 03:58:02,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:58:04,587 INFO L130 PetriNetUnfolder]: 4376/7018 cut-off events. [2022-11-23 03:58:04,587 INFO L131 PetriNetUnfolder]: For 25824/25833 co-relation queries the response was YES. [2022-11-23 03:58:04,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27854 conditions, 7018 events. 4376/7018 cut-off events. For 25824/25833 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 45251 event pairs, 2123 based on Foata normal form. 545/7563 useless extension candidates. Maximal degree in co-relation 27823. Up to 4659 conditions per place. [2022-11-23 03:58:04,627 INFO L137 encePairwiseOnDemand]: 393/399 looper letters, 32 selfloop transitions, 7 changer transitions 81/121 dead transitions. [2022-11-23 03:58:04,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 121 transitions, 1681 flow [2022-11-23 03:58:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:58:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:58:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2022-11-23 03:58:04,630 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3007518796992481 [2022-11-23 03:58:04,630 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2022-11-23 03:58:04,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2022-11-23 03:58:04,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:58:04,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2022-11-23 03:58:04,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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 03:58:04,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 399.0) internal successors, (3192), 8 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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 03:58:04,638 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 399.0) internal successors, (3192), 8 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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 03:58:04,639 INFO L175 Difference]: Start difference. First operand has 104 places, 119 transitions, 1631 flow. Second operand 7 states and 840 transitions. [2022-11-23 03:58:04,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 121 transitions, 1681 flow [2022-11-23 03:58:04,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 121 transitions, 1604 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-11-23 03:58:04,761 INFO L231 Difference]: Finished difference. Result has 94 places, 36 transitions, 330 flow [2022-11-23 03:58:04,761 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=94, PETRI_TRANSITIONS=36} [2022-11-23 03:58:04,762 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -7 predicate places. [2022-11-23 03:58:04,762 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 36 transitions, 330 flow [2022-11-23 03:58:04,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states 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 03:58:04,762 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:58:04,762 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 03:58:04,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 03:58:04,763 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:58:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash -679090983, now seen corresponding path program 1 times [2022-11-23 03:58:04,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:04,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337438458] [2022-11-23 03:58:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:05,037 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 03:58:05,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:05,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337438458] [2022-11-23 03:58:05,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337438458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:05,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:05,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:58:05,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940855305] [2022-11-23 03:58:05,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:05,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:58:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:58:05,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:58:05,050 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 399 [2022-11-23 03:58:05,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 36 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 03:58:05,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:58:05,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 399 [2022-11-23 03:58:05,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:58:05,375 INFO L130 PetriNetUnfolder]: 524/949 cut-off events. [2022-11-23 03:58:05,375 INFO L131 PetriNetUnfolder]: For 4559/4664 co-relation queries the response was YES. [2022-11-23 03:58:05,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 949 events. 524/949 cut-off events. For 4559/4664 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4621 event pairs, 227 based on Foata normal form. 48/994 useless extension candidates. Maximal degree in co-relation 3743. Up to 812 conditions per place. [2022-11-23 03:58:05,384 INFO L137 encePairwiseOnDemand]: 394/399 looper letters, 44 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2022-11-23 03:58:05,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 53 transitions, 544 flow [2022-11-23 03:58:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:58:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:58:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-11-23 03:58:05,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3533834586466165 [2022-11-23 03:58:05,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2022-11-23 03:58:05,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2022-11-23 03:58:05,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:58:05,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2022-11-23 03:58:05,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 03:58:05,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:58:05,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 03:58:05,391 INFO L175 Difference]: Start difference. First operand has 94 places, 36 transitions, 330 flow. Second operand 3 states and 423 transitions. [2022-11-23 03:58:05,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 53 transitions, 544 flow [2022-11-23 03:58:05,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 412 flow, removed 15 selfloop flow, removed 22 redundant places. [2022-11-23 03:58:05,398 INFO L231 Difference]: Finished difference. Result has 65 places, 37 transitions, 236 flow [2022-11-23 03:58:05,399 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2022-11-23 03:58:05,401 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -36 predicate places. [2022-11-23 03:58:05,401 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 236 flow [2022-11-23 03:58:05,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 03:58:05,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:58:05,402 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 03:58:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-23 03:58:05,403 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:58:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash -553825553, now seen corresponding path program 1 times [2022-11-23 03:58:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:05,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907877416] [2022-11-23 03:58:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:05,743 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 03:58:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:05,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907877416] [2022-11-23 03:58:05,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907877416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:05,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:05,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:58:05,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918210763] [2022-11-23 03:58:05,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:05,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:58:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:05,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:58:05,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:58:05,757 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 399 [2022-11-23 03:58:05,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 37 transitions, 236 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 03:58:05,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:58:05,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 399 [2022-11-23 03:58:05,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:58:05,960 INFO L130 PetriNetUnfolder]: 261/551 cut-off events. [2022-11-23 03:58:05,960 INFO L131 PetriNetUnfolder]: For 1229/1238 co-relation queries the response was YES. [2022-11-23 03:58:05,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 551 events. 261/551 cut-off events. For 1229/1238 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2633 event pairs, 36 based on Foata normal form. 59/607 useless extension candidates. Maximal degree in co-relation 2123. Up to 238 conditions per place. [2022-11-23 03:58:05,962 INFO L137 encePairwiseOnDemand]: 394/399 looper letters, 51 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2022-11-23 03:58:05,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 509 flow [2022-11-23 03:58:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:58:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:58:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-11-23 03:58:05,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35213032581453635 [2022-11-23 03:58:05,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-11-23 03:58:05,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-11-23 03:58:05,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:58:05,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-11-23 03:58:05,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 03:58:05,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:58:05,970 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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 03:58:05,970 INFO L175 Difference]: Start difference. First operand has 65 places, 37 transitions, 236 flow. Second operand 4 states and 562 transitions. [2022-11-23 03:58:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 509 flow [2022-11-23 03:58:05,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 499 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-23 03:58:05,974 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 268 flow [2022-11-23 03:58:05,974 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2022-11-23 03:58:05,975 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -33 predicate places. [2022-11-23 03:58:05,975 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 40 transitions, 268 flow [2022-11-23 03:58:05,976 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 03:58:05,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:58:05,976 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:05,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-23 03:58:05,977 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:58:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash 529070987, now seen corresponding path program 1 times [2022-11-23 03:58:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:05,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724830799] [2022-11-23 03:58:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:06,395 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 03:58:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724830799] [2022-11-23 03:58:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724830799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:58:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499265477] [2022-11-23 03:58:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:06,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:58:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:58:06,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:58:06,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 399 [2022-11-23 03:58:06,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 40 transitions, 268 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 03:58:06,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:58:06,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 399 [2022-11-23 03:58:06,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:58:06,612 INFO L130 PetriNetUnfolder]: 201/422 cut-off events. [2022-11-23 03:58:06,612 INFO L131 PetriNetUnfolder]: For 1328/1337 co-relation queries the response was YES. [2022-11-23 03:58:06,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 422 events. 201/422 cut-off events. For 1328/1337 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1933 event pairs, 27 based on Foata normal form. 33/452 useless extension candidates. Maximal degree in co-relation 1793. Up to 193 conditions per place. [2022-11-23 03:58:06,614 INFO L137 encePairwiseOnDemand]: 394/399 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2022-11-23 03:58:06,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 63 transitions, 527 flow [2022-11-23 03:58:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:58:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:58:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2022-11-23 03:58:06,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3468671679197995 [2022-11-23 03:58:06,615 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2022-11-23 03:58:06,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2022-11-23 03:58:06,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:58:06,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2022-11-23 03:58:06,616 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 03:58:06,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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 03:58:06,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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 03:58:06,618 INFO L175 Difference]: Start difference. First operand has 68 places, 40 transitions, 268 flow. Second operand 5 states and 692 transitions. [2022-11-23 03:58:06,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 63 transitions, 527 flow [2022-11-23 03:58:06,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 479 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-23 03:58:06,622 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 257 flow [2022-11-23 03:58:06,622 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2022-11-23 03:58:06,622 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -33 predicate places. [2022-11-23 03:58:06,622 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 40 transitions, 257 flow [2022-11-23 03:58:06,623 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 03:58:06,623 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:58:06,623 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 03:58:06,624 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 03:58:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1890869936, now seen corresponding path program 1 times [2022-11-23 03:58:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:06,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953405276] [2022-11-23 03:58:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:58:06,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:58:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:58:06,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:58:06,987 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:58:06,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2022-11-23 03:58:06,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2022-11-23 03:58:06,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2022-11-23 03:58:06,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2022-11-23 03:58:06,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2022-11-23 03:58:06,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2022-11-23 03:58:06,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2022-11-23 03:58:06,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2022-11-23 03:58:06,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2022-11-23 03:58:06,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2022-11-23 03:58:06,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2022-11-23 03:58:06,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2022-11-23 03:58:06,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2022-11-23 03:58:06,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2022-11-23 03:58:06,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2022-11-23 03:58:06,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2022-11-23 03:58:06,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2022-11-23 03:58:06,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2022-11-23 03:58:06,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2022-11-23 03:58:06,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2022-11-23 03:58:06,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2022-11-23 03:58:06,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2022-11-23 03:58:06,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2022-11-23 03:58:06,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2022-11-23 03:58:06,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2022-11-23 03:58:06,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2022-11-23 03:58:06,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2022-11-23 03:58:06,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2022-11-23 03:58:06,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2022-11-23 03:58:06,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2022-11-23 03:58:06,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2022-11-23 03:58:06,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2022-11-23 03:58:06,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2022-11-23 03:58:06,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2022-11-23 03:58:06,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2022-11-23 03:58:07,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2022-11-23 03:58:07,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2022-11-23 03:58:07,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2022-11-23 03:58:07,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2022-11-23 03:58:07,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2022-11-23 03:58:07,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2022-11-23 03:58:07,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2022-11-23 03:58:07,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2022-11-23 03:58:07,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2022-11-23 03:58:07,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2022-11-23 03:58:07,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2022-11-23 03:58:07,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2022-11-23 03:58:07,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2022-11-23 03:58:07,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2022-11-23 03:58:07,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2022-11-23 03:58:07,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2022-11-23 03:58:07,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2022-11-23 03:58:07,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2022-11-23 03:58:07,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2022-11-23 03:58:07,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2022-11-23 03:58:07,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2022-11-23 03:58:07,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2022-11-23 03:58:07,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2022-11-23 03:58:07,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2022-11-23 03:58:07,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2022-11-23 03:58:07,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2022-11-23 03:58:07,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 03:58:07,007 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:07,015 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:58:07,015 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:58:07,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:58:07 BasicIcfg [2022-11-23 03:58:07,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:58:07,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:58:07,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:58:07,164 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:58:07,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:43" (3/4) ... [2022-11-23 03:58:07,168 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 03:58:07,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:58:07,169 INFO L158 Benchmark]: Toolchain (without parser) took 146544.45ms. Allocated memory was 167.8MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 139.3MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-23 03:58:07,170 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 123.7MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:58:07,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 762.18ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 112.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 03:58:07,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.17ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 109.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 03:58:07,171 INFO L158 Benchmark]: Boogie Preprocessor took 95.79ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:58:07,171 INFO L158 Benchmark]: RCFGBuilder took 2296.61ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 107.1MB in the beginning and 121.7MB in the end (delta: -14.5MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2022-11-23 03:58:07,171 INFO L158 Benchmark]: TraceAbstraction took 143262.33ms. Allocated memory was 201.3MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 120.6MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 985.2MB. Max. memory is 16.1GB. [2022-11-23 03:58:07,171 INFO L158 Benchmark]: Witness Printer took 5.15ms. Allocated memory is still 8.5GB. Free memory is still 7.4GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:58:07,173 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.32ms. Allocated memory is still 123.7MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 762.18ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 112.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.17ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 109.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.79ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2296.61ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 107.1MB in the beginning and 121.7MB in the end (delta: -14.5MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. * TraceAbstraction took 143262.33ms. Allocated memory was 201.3MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 120.6MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 985.2MB. Max. memory is 16.1GB. * Witness Printer took 5.15ms. Allocated memory is still 8.5GB. Free memory is still 7.4GB. 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: 44.0s, 205 PlacesBefore, 101 PlacesAfterwards, 197 TransitionsBefore, 92 TransitionsAfterwards, 9828 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 121 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 199 TotalNumberOfCompositions, 41797 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17286, independent: 16752, independent conditional: 0, independent unconditional: 16752, dependent: 461, dependent conditional: 0, dependent unconditional: 461, unknown: 73, unknown conditional: 0, unknown unconditional: 73] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6434, independent: 6332, independent conditional: 0, independent unconditional: 6332, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6434, independent: 5121, independent conditional: 0, independent unconditional: 5121, dependent: 1313, dependent conditional: 0, dependent unconditional: 1313, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1313, independent: 1211, independent conditional: 0, independent unconditional: 1211, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7910, independent: 6612, independent conditional: 0, independent unconditional: 6612, dependent: 875, dependent conditional: 0, dependent unconditional: 875, unknown: 422, unknown conditional: 0, unknown unconditional: 422] ], Cache Queries: [ total: 17286, independent: 10420, independent conditional: 0, independent unconditional: 10420, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 6491, unknown conditional: 0, unknown unconditional: 6491] , Statistics on independence cache: Total cache size (in pairs): 1233, Positive cache size: 1197, Positive conditional cache size: 0, Positive unconditional cache size: 1197, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 8, Unknown conditional cache size: 0, Unknown unconditional cache size: 8 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1777; [L854] FCALL, FORK 0 pthread_create(&t1777, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1777, ((void *)0), P0, ((void *)0))=9, t1777={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t1778; [L856] FCALL, FORK 0 pthread_create(&t1778, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1778, ((void *)0), P1, ((void *)0))=10, t1777={7:0}, t1778={8:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 __unbuffered_p1_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t1779; [L858] FCALL, FORK 0 pthread_create(&t1779, ((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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1779, ((void *)0), P2, ((void *)0))=11, t1777={7:0}, t1778={8:0}, t1779={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 \read(y) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L828] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1777={7:0}, t1778={8:0}, t1779={5:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 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=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=7, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: -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: -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: -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: -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: -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: -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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 265 locations, 109 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: 142.8s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 80.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2731 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2069 mSDsluCounter, 738 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 550 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6037 IncrementalHoareTripleChecker+Invalid, 6447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 188 mSDtfsCounter, 6037 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3060occurred in iteration=18, InterpolantAutomatonStates: 119, 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, 1.7s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 3603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 03:58:07,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f --- 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 03:58:10,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:58:10,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:58:10,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:58:10,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:58:10,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:58:10,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:58:10,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:58:10,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:58:10,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:58:10,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:58:10,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:58:10,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:58:10,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:58:10,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:58:10,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:58:10,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:58:10,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:58:10,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:58:10,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:58:10,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:58:10,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:58:10,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:58:10,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:58:10,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:58:10,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:58:10,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:58:10,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:58:10,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:58:10,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:58:10,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:58:10,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:58:10,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:58:10,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:58:10,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:58:10,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:58:10,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:58:10,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:58:10,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:58:10,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:58:10,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:58:10,573 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 03:58:10,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:58:10,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:58:10,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:58:10,620 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:58:10,621 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:58:10,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:58:10,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:58:10,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:58:10,623 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:58:10,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:58:10,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:58:10,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:58:10,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:58:10,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:58:10,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:58:10,627 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:58:10,628 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:58:10,628 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:58:10,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:58:10,629 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:58:10,629 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 03:58:10,629 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 03:58:10,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:58:10,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:58:10,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:58:10,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:58:10,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:58:10,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:10,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:58:10,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:58:10,633 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 03:58:10,633 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 03:58:10,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:58:10,634 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:58:10,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:58:10,635 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 03:58:10,635 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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 -> e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f [2022-11-23 03:58:11,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:58:11,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:58:11,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:58:11,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:58:11,142 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:58:11,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i [2022-11-23 03:58:14,639 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:58:14,952 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:58:14,953 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i [2022-11-23 03:58:14,970 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data/1504ffca4/916c373ddf2843298a29ed34caccf3ef/FLAGbd67eeca8 [2022-11-23 03:58:14,985 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/data/1504ffca4/916c373ddf2843298a29ed34caccf3ef [2022-11-23 03:58:14,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:58:14,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:58:14,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:14,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:58:14,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:58:14,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:14" (1/1) ... [2022-11-23 03:58:14,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33098dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:14, skipping insertion in model container [2022-11-23 03:58:14,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:14" (1/1) ... [2022-11-23 03:58:15,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:58:15,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:58:15,292 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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i[995,1008] [2022-11-23 03:58:15,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:15,696 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:58:15,715 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_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i[995,1008] [2022-11-23 03:58:15,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:15,904 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:58:15,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15 WrapperNode [2022-11-23 03:58:15,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:15,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:15,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:58:15,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:58:15,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:15,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:15,973 INFO L138 Inliner]: procedures = 180, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2022-11-23 03:58:15,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:15,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:58:15,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:58:15,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:58:15,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:15,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:15,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:15,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:16,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:16,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:16,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:16,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:16,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:58:16,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:58:16,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:58:16,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:58:16,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (1/1) ... [2022-11-23 03:58:16,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:16,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:16,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:58:16,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:58:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 03:58:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:58:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:58:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:58:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:58:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 03:58:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 03:58:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-23 03:58:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:58:16,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:58:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:58:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:58:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:58:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:58:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:58:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:58:16,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:58:16,192 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 03:58:16,451 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:58:16,453 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:58:17,716 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:58:18,936 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:58:18,936 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:58:18,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:18 BoogieIcfgContainer [2022-11-23 03:58:18,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:58:18,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:58:18,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:58:18,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:58:18,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:58:14" (1/3) ... [2022-11-23 03:58:18,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36280b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:18, skipping insertion in model container [2022-11-23 03:58:18,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:15" (2/3) ... [2022-11-23 03:58:18,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36280b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:18, skipping insertion in model container [2022-11-23 03:58:18,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:18" (3/3) ... [2022-11-23 03:58:18,956 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.oepc.i [2022-11-23 03:58:18,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:58:18,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-11-23 03:58:18,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:58:19,366 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:58:19,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 201 transitions, 417 flow [2022-11-23 03:58:19,544 INFO L130 PetriNetUnfolder]: 2/198 cut-off events. [2022-11-23 03:58:19,544 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:58:19,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 378 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-23 03:58:19,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 201 transitions, 417 flow [2022-11-23 03:58:19,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 198 transitions, 405 flow [2022-11-23 03:58:19,566 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:58:19,585 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 198 transitions, 405 flow [2022-11-23 03:58:19,589 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 198 transitions, 405 flow [2022-11-23 03:58:19,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 198 transitions, 405 flow [2022-11-23 03:58:19,699 INFO L130 PetriNetUnfolder]: 2/198 cut-off events. [2022-11-23 03:58:19,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:58:19,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 378 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-23 03:58:19,709 INFO L119 LiptonReduction]: Number of co-enabled transitions 9828 [2022-11-23 03:58:34,599 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 187 DAG size of output: 185 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 03:58:50,348 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 199 DAG size of output: 197 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 03:59:02,043 WARN L233 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 227 DAG size of output: 225 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 04:00:10,035 INFO L134 LiptonReduction]: Checked pairs total: 38352 [2022-11-23 04:00:10,035 INFO L136 LiptonReduction]: Total number of compositions: 200 [2022-11-23 04:00:10,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 04:00:10,059 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25e6fb7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 04:00:10,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-11-23 04:00:10,061 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 04:00:10,062 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:00:10,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:10,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 04:00:10,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1331, now seen corresponding path program 1 times [2022-11-23 04:00:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:10,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662089780] [2022-11-23 04:00:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:10,086 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 04:00:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:10,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:10,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:10,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 04:00:10,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:10,755 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 04:00:10,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:10,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:00:10,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662089780] [2022-11-23 04:00:10,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662089780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:10,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:00:10,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 04:00:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465006935] [2022-11-23 04:00:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:10,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 04:00:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:00:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 04:00:10,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 04:00:10,817 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 401 [2022-11-23 04:00:10,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 193 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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 04:00:10,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:00:10,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 401 [2022-11-23 04:00:10,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:00:16,912 INFO L130 PetriNetUnfolder]: 13766/19838 cut-off events. [2022-11-23 04:00:16,912 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-23 04:00:16,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39277 conditions, 19838 events. 13766/19838 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 137277 event pairs, 13766 based on Foata normal form. 0/8612 useless extension candidates. Maximal degree in co-relation 39266. Up to 19343 conditions per place. [2022-11-23 04:00:17,094 INFO L137 encePairwiseOnDemand]: 357/401 looper letters, 42 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-11-23 04:00:17,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 189 flow [2022-11-23 04:00:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 04:00:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 04:00:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 356 transitions. [2022-11-23 04:00:17,113 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44389027431421446 [2022-11-23 04:00:17,114 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 356 transitions. [2022-11-23 04:00:17,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 356 transitions. [2022-11-23 04:00:17,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:17,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 356 transitions. [2022-11-23 04:00:17,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 178.0) internal successors, (356), 2 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 04:00:17,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states 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 04:00:17,136 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states 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 04:00:17,138 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 193 flow. Second operand 2 states and 356 transitions. [2022-11-23 04:00:17,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 189 flow [2022-11-23 04:00:17,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 04:00:17,161 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2022-11-23 04:00:17,164 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-11-23 04:00:17,169 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -45 predicate places. [2022-11-23 04:00:17,169 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2022-11-23 04:00:17,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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 04:00:17,172 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:17,172 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 04:00:17,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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)] Ended with exit code 0 [2022-11-23 04:00:17,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:17,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1316191, now seen corresponding path program 1 times [2022-11-23 04:00:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:17,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351478581] [2022-11-23 04:00:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:17,390 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 04:00:17,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:17,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:17,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:18,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 04:00:18,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:18,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 04:00:18,489 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 04:00:18,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:18,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:00:18,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351478581] [2022-11-23 04:00:18,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351478581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:18,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:00:18,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 04:00:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134370993] [2022-11-23 04:00:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 04:00:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:00:18,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 04:00:18,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 04:00:18,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 401 [2022-11-23 04:00:18,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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 04:00:18,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:00:18,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 401 [2022-11-23 04:00:18,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:00:21,529 INFO L130 PetriNetUnfolder]: 5696/8334 cut-off events. [2022-11-23 04:00:21,530 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:00:21,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16528 conditions, 8334 events. 5696/8334 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 51983 event pairs, 5696 based on Foata normal form. 404/5008 useless extension candidates. Maximal degree in co-relation 16525. Up to 8133 conditions per place. [2022-11-23 04:00:21,594 INFO L137 encePairwiseOnDemand]: 392/401 looper letters, 34 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2022-11-23 04:00:21,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 156 flow [2022-11-23 04:00:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:00:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:00:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-23 04:00:21,601 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36741479634247715 [2022-11-23 04:00:21,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-23 04:00:21,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-23 04:00:21,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:21,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-23 04:00:21,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:00:21,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 04:00:21,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 04:00:21,612 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 442 transitions. [2022-11-23 04:00:21,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 156 flow [2022-11-23 04:00:21,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 04:00:21,615 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2022-11-23 04:00:21,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-23 04:00:21,616 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -51 predicate places. [2022-11-23 04:00:21,617 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2022-11-23 04:00:21,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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 04:00:21,623 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:21,623 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 04:00:21,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:21,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:21,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1316190, now seen corresponding path program 1 times [2022-11-23 04:00:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:21,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176437998] [2022-11-23 04:00:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:21,840 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 04:00:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:21,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:21,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:22,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 04:00:22,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:22,538 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 04:00:22,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 04:00:22,571 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 04:00:22,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:22,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:00:22,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176437998] [2022-11-23 04:00:22,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176437998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:22,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:00:22,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 04:00:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633762153] [2022-11-23 04:00:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:22,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 04:00:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:00:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 04:00:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 04:00:22,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 401 [2022-11-23 04:00:22,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:00:22,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:00:22,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 401 [2022-11-23 04:00:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:00:24,184 INFO L130 PetriNetUnfolder]: 2786/4092 cut-off events. [2022-11-23 04:00:24,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 04:00:24,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8193 conditions, 4092 events. 2786/4092 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 22497 event pairs, 1618 based on Foata normal form. 177/3069 useless extension candidates. Maximal degree in co-relation 8189. Up to 2945 conditions per place. [2022-11-23 04:00:24,215 INFO L137 encePairwiseOnDemand]: 388/401 looper letters, 40 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-23 04:00:24,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 182 flow [2022-11-23 04:00:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:00:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:00:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-11-23 04:00:24,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36824605153782214 [2022-11-23 04:00:24,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2022-11-23 04:00:24,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2022-11-23 04:00:24,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:24,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2022-11-23 04:00:24,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 04:00:24,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 04:00:24,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 04:00:24,228 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 443 transitions. [2022-11-23 04:00:24,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 182 flow [2022-11-23 04:00:24,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 04:00:24,231 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 103 flow [2022-11-23 04:00:24,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-11-23 04:00:24,232 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -52 predicate places. [2022-11-23 04:00:24,232 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 103 flow [2022-11-23 04:00:24,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:00:24,233 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:24,233 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:24,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:24,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:24,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1576130934, now seen corresponding path program 1 times [2022-11-23 04:00:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:24,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468426300] [2022-11-23 04:00:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:24,449 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 04:00:24,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:24,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:24,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:25,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 04:00:25,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:25,195 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 04:00:25,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:25,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:00:25,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468426300] [2022-11-23 04:00:25,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468426300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:25,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:00:25,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 04:00:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465992658] [2022-11-23 04:00:25,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:25,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 04:00:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:00:25,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 04:00:25,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 04:00:25,216 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 401 [2022-11-23 04:00:25,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 04:00:25,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:00:25,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 401 [2022-11-23 04:00:25,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:00:25,961 INFO L130 PetriNetUnfolder]: 949/1585 cut-off events. [2022-11-23 04:00:25,961 INFO L131 PetriNetUnfolder]: For 125/159 co-relation queries the response was YES. [2022-11-23 04:00:25,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3524 conditions, 1585 events. 949/1585 cut-off events. For 125/159 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8801 event pairs, 376 based on Foata normal form. 18/1333 useless extension candidates. Maximal degree in co-relation 3519. Up to 1462 conditions per place. [2022-11-23 04:00:25,972 INFO L137 encePairwiseOnDemand]: 396/401 looper letters, 42 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-11-23 04:00:25,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 227 flow [2022-11-23 04:00:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 04:00:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 04:00:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2022-11-23 04:00:25,975 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3657522859517872 [2022-11-23 04:00:25,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2022-11-23 04:00:25,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2022-11-23 04:00:25,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:25,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2022-11-23 04:00:25,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 04:00:25,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 04:00:25,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 04:00:25,983 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 103 flow. Second operand 3 states and 440 transitions. [2022-11-23 04:00:25,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 227 flow [2022-11-23 04:00:25,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 04:00:25,987 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 125 flow [2022-11-23 04:00:25,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-23 04:00:25,989 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -51 predicate places. [2022-11-23 04:00:25,989 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 125 flow [2022-11-23 04:00:25,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 04:00:25,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:25,990 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:26,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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)] Forceful destruction successful, exit code 0 [2022-11-23 04:00:26,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:26,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash 437893947, now seen corresponding path program 1 times [2022-11-23 04:00:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:26,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961252136] [2022-11-23 04:00:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:26,205 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 04:00:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:26,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:26,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:26,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 04:00:26,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:26,862 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 04:00:26,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:26,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:00:26,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961252136] [2022-11-23 04:00:26,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961252136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:26,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:00:26,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 04:00:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406702967] [2022-11-23 04:00:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:26,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 04:00:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:00:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 04:00:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 04:00:26,894 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 401 [2022-11-23 04:00:26,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 04:00:26,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:00:26,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 401 [2022-11-23 04:00:26,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:00:27,405 INFO L130 PetriNetUnfolder]: 212/431 cut-off events. [2022-11-23 04:00:27,406 INFO L131 PetriNetUnfolder]: For 70/74 co-relation queries the response was YES. [2022-11-23 04:00:27,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 431 events. 212/431 cut-off events. For 70/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1837 event pairs, 68 based on Foata normal form. 21/399 useless extension candidates. Maximal degree in co-relation 1062. Up to 246 conditions per place. [2022-11-23 04:00:27,408 INFO L137 encePairwiseOnDemand]: 396/401 looper letters, 50 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-11-23 04:00:27,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 295 flow [2022-11-23 04:00:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 04:00:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 04:00:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2022-11-23 04:00:27,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3628428927680798 [2022-11-23 04:00:27,413 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2022-11-23 04:00:27,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2022-11-23 04:00:27,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:27,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2022-11-23 04:00:27,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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 04:00:27,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 401.0) internal successors, (2005), 5 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states 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 04:00:27,420 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 401.0) internal successors, (2005), 5 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states 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 04:00:27,420 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 125 flow. Second operand 4 states and 582 transitions. [2022-11-23 04:00:27,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 295 flow [2022-11-23 04:00:27,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 04:00:27,423 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 161 flow [2022-11-23 04:00:27,423 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-11-23 04:00:27,424 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -48 predicate places. [2022-11-23 04:00:27,424 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 161 flow [2022-11-23 04:00:27,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 04:00:27,425 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:27,425 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 04:00:27,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:27,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:27,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:27,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:27,639 INFO L85 PathProgramCache]: Analyzing trace with hash -172401078, now seen corresponding path program 1 times [2022-11-23 04:00:27,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:27,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206086666] [2022-11-23 04:00:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:27,640 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 04:00:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:27,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:27,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:28,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 04:00:28,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:28,289 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 04:00:28,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:28,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:00:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206086666] [2022-11-23 04:00:28,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206086666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:28,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:00:28,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 04:00:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5099308] [2022-11-23 04:00:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:28,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 04:00:28,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:00:28,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 04:00:28,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 04:00:28,318 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 401 [2022-11-23 04:00:28,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 04:00:28,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:00:28,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 401 [2022-11-23 04:00:28,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:00:28,993 INFO L130 PetriNetUnfolder]: 114/227 cut-off events. [2022-11-23 04:00:28,994 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-11-23 04:00:28,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 227 events. 114/227 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 779 event pairs, 40 based on Foata normal form. 8/228 useless extension candidates. Maximal degree in co-relation 633. Up to 92 conditions per place. [2022-11-23 04:00:28,995 INFO L137 encePairwiseOnDemand]: 396/401 looper letters, 40 selfloop transitions, 10 changer transitions 1/54 dead transitions. [2022-11-23 04:00:28,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 275 flow [2022-11-23 04:00:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 04:00:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 04:00:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2022-11-23 04:00:28,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35261845386533663 [2022-11-23 04:00:28,999 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2022-11-23 04:00:28,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2022-11-23 04:00:29,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:29,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2022-11-23 04:00:29,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:00:29,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 401.0) internal successors, (2406), 6 states have internal predecessors, (2406), 0 states have call successors, (0), 0 states 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 04:00:29,008 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 401.0) internal successors, (2406), 6 states have internal predecessors, (2406), 0 states have call successors, (0), 0 states 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 04:00:29,008 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 161 flow. Second operand 5 states and 707 transitions. [2022-11-23 04:00:29,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 275 flow [2022-11-23 04:00:29,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 259 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-23 04:00:29,011 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 139 flow [2022-11-23 04:00:29,011 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-11-23 04:00:29,012 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -54 predicate places. [2022-11-23 04:00:29,012 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 139 flow [2022-11-23 04:00:29,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 04:00:29,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:29,013 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:29,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:29,227 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1277309170, now seen corresponding path program 1 times [2022-11-23 04:00:29,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:29,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41304193] [2022-11-23 04:00:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:29,229 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 04:00:29,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:29,231 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:29,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:29,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 04:00:29,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:36,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 309 [2022-11-23 04:00:38,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-23 04:00:38,068 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 04:00:38,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:38,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 04:00:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41304193] [2022-11-23 04:00:38,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41304193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:38,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:00:38,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 04:00:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378785575] [2022-11-23 04:00:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:38,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 04:00:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 04:00:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 04:00:38,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 04:00:38,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 401 [2022-11-23 04:00:38,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 04:00:38,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:00:38,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 401 [2022-11-23 04:00:38,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:00:38,747 INFO L130 PetriNetUnfolder]: 168/348 cut-off events. [2022-11-23 04:00:38,747 INFO L131 PetriNetUnfolder]: For 393/393 co-relation queries the response was YES. [2022-11-23 04:00:38,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 348 events. 168/348 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1381 event pairs, 27 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 921. Up to 231 conditions per place. [2022-11-23 04:00:38,750 INFO L137 encePairwiseOnDemand]: 397/401 looper letters, 45 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2022-11-23 04:00:38,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 291 flow [2022-11-23 04:00:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 04:00:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 04:00:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2022-11-23 04:00:38,755 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3396508728179551 [2022-11-23 04:00:38,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2022-11-23 04:00:38,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2022-11-23 04:00:38,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:38,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2022-11-23 04:00:38,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 04:00:38,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 401.0) internal successors, (2406), 6 states have internal predecessors, (2406), 0 states have call successors, (0), 0 states 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 04:00:38,763 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 401.0) internal successors, (2406), 6 states have internal predecessors, (2406), 0 states have call successors, (0), 0 states 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 04:00:38,763 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 139 flow. Second operand 5 states and 681 transitions. [2022-11-23 04:00:38,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 291 flow [2022-11-23 04:00:38,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 259 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-23 04:00:38,768 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 117 flow [2022-11-23 04:00:38,768 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-23 04:00:38,769 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -55 predicate places. [2022-11-23 04:00:38,769 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 117 flow [2022-11-23 04:00:38,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 04:00:38,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:38,770 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:38,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:38,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:38,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-23 04:00:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1153512485, now seen corresponding path program 1 times [2022-11-23 04:00:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 04:00:38,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612491678] [2022-11-23 04:00:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:38,985 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 04:00:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 04:00:38,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:38,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4be3f7c-9ae0-4c2b-9f85-537ddd469328/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 04:00:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:39,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 04:00:39,674 INFO L286 TraceCheckSpWp]: Computing forward predicates...