./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:02:04,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:02:04,483 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:02:04,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:02:04,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:02:04,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:02:04,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:02:04,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:02:04,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:02:04,514 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:02:04,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:02:04,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:02:04,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:02:04,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:02:04,516 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:02:04,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:02:04,517 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:02:04,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:02:04,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:02:04,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:02:04,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:02:04,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:02:04,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:02:04,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:02:04,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:02:04,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:02:04,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:02:04,524 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:02:04,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:02:04,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:02:04,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:02:04,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:02:04,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:02:04,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:02:04,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:02:04,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:02:04,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:02:04,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:02:04,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:02:04,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:02:04,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:02:04,528 INFO L153 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_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/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_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2023-11-29 01:02:04,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:02:04,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:02:04,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:02:04,782 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:02:04,783 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:02:04,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-29 01:02:07,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:02:07,829 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:02:07,829 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-29 01:02:07,846 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data/8e28fe595/f7163ce4ed3846de8ef544779808cfe3/FLAG03d6b6346 [2023-11-29 01:02:07,861 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data/8e28fe595/f7163ce4ed3846de8ef544779808cfe3 [2023-11-29 01:02:07,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:02:07,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:02:07,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:02:07,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:02:07,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:02:07,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:02:07" (1/1) ... [2023-11-29 01:02:07,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1548a947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:07, skipping insertion in model container [2023-11-29 01:02:07,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:02:07" (1/1) ... [2023-11-29 01:02:07,939 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:02:08,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:02:08,298 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:02:08,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:02:08,385 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:02:08,385 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:02:08,393 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:02:08,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08 WrapperNode [2023-11-29 01:02:08,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:02:08,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:02:08,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:02:08,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:02:08,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,448 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-29 01:02:08,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:02:08,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:02:08,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:02:08,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:02:08,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,484 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 01:02:08,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:02:08,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:02:08,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:02:08,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:02:08,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (1/1) ... [2023-11-29 01:02:08,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:02:08,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:02:08,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:02:08,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:02:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:02:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:02:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:02:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 01:02:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 01:02:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:02:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:02:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:02:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 01:02:08,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 01:02:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 01:02:08,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 01:02:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 01:02:08,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 01:02:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:02:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:02:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:02:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 01:02:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 01:02:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:02:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:02:08,577 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:02:08,710 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:02:08,712 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:02:08,981 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:02:09,180 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:02:09,181 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:02:09,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:02:09 BoogieIcfgContainer [2023-11-29 01:02:09,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:02:09,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:02:09,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:02:09,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:02:09,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:02:07" (1/3) ... [2023-11-29 01:02:09,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cd8f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:02:09, skipping insertion in model container [2023-11-29 01:02:09,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:08" (2/3) ... [2023-11-29 01:02:09,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cd8f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:02:09, skipping insertion in model container [2023-11-29 01:02:09,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:02:09" (3/3) ... [2023-11-29 01:02:09,190 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-11-29 01:02:09,208 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:02:09,208 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 01:02:09,208 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:02:09,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 01:02:09,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-29 01:02:09,317 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-29 01:02:09,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:02:09,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-29 01:02:09,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-29 01:02:09,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-29 01:02:09,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:02:09,342 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;@362d568f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:02:09,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 01:02:09,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:02:09,346 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 01:02:09,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:02:09,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:09,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:02:09,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:09,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 11947, now seen corresponding path program 1 times [2023-11-29 01:02:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:09,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657945985] [2023-11-29 01:02:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:09,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657945985] [2023-11-29 01:02:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657945985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:09,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:09,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:02:09,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279232991] [2023-11-29 01:02:09,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:09,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:09,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:09,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:09,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:09,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:09,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:09,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:09,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:09,931 INFO L124 PetriNetUnfolderBase]: 518/1012 cut-off events. [2023-11-29 01:02:09,932 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 01:02:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 1012 events. 518/1012 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7317 event pairs, 400 based on Foata normal form. 60/981 useless extension candidates. Maximal degree in co-relation 1827. Up to 628 conditions per place. [2023-11-29 01:02:09,943 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 01:02:09,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 173 flow [2023-11-29 01:02:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:09,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:09,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:09,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:09,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:09,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:09,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:09,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:09,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:09,964 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:09,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 173 flow [2023-11-29 01:02:09,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:02:09,970 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 01:02:09,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 01:02:09,974 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-29 01:02:09,975 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 01:02:09,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:09,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:09,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:02:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:02:09,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:09,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 11948, now seen corresponding path program 1 times [2023-11-29 01:02:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512382573] [2023-11-29 01:02:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:10,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512382573] [2023-11-29 01:02:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512382573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:02:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230371454] [2023-11-29 01:02:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:10,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:10,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-29 01:02:10,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:10,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-29 01:02:10,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:10,319 INFO L124 PetriNetUnfolderBase]: 518/1011 cut-off events. [2023-11-29 01:02:10,319 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 01:02:10,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 1011 events. 518/1011 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7342 event pairs, 400 based on Foata normal form. 1/921 useless extension candidates. Maximal degree in co-relation 1857. Up to 627 conditions per place. [2023-11-29 01:02:10,332 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 01:02:10,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 170 flow [2023-11-29 01:02:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:10,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:10,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:10,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:10,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:10,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:10,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,339 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:10,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 170 flow [2023-11-29 01:02:10,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:10,343 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 01:02:10,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 01:02:10,345 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-29 01:02:10,345 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 01:02:10,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:10,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:02:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:02:10,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:10,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash 356272451, now seen corresponding path program 1 times [2023-11-29 01:02:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:10,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432459942] [2023-11-29 01:02:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432459942] [2023-11-29 01:02:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432459942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690865600] [2023-11-29 01:02:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:10,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:10,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:10,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:10,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:10,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:10,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:10,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:10,610 INFO L124 PetriNetUnfolderBase]: 519/1010 cut-off events. [2023-11-29 01:02:10,610 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 01:02:10,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1010 events. 519/1010 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7207 event pairs, 318 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1859. Up to 627 conditions per place. [2023-11-29 01:02:10,617 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 01:02:10,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 170 flow [2023-11-29 01:02:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-29 01:02:10,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-29 01:02:10,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-29 01:02:10,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-29 01:02:10,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:10,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-29 01:02:10,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,622 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-29 01:02:10,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 170 flow [2023-11-29 01:02:10,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:10,625 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 01:02:10,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 01:02:10,626 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-29 01:02:10,626 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 01:02:10,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:10,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:02:10,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:02:10,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:10,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash 356272452, now seen corresponding path program 1 times [2023-11-29 01:02:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:10,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603434689] [2023-11-29 01:02:10,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:10,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603434689] [2023-11-29 01:02:10,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603434689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:10,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:10,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53522105] [2023-11-29 01:02:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:10,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:10,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:10,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-29 01:02:10,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:10,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-29 01:02:10,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:10,886 INFO L124 PetriNetUnfolderBase]: 518/1006 cut-off events. [2023-11-29 01:02:10,886 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 01:02:10,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 1006 events. 518/1006 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7261 event pairs, 399 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 1854. Up to 624 conditions per place. [2023-11-29 01:02:10,894 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 01:02:10,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 166 flow [2023-11-29 01:02:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:10,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:10,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:10,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:10,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:10,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:10,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,899 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:10,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 166 flow [2023-11-29 01:02:10,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:10,901 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 01:02:10,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-29 01:02:10,902 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-29 01:02:10,903 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 01:02:10,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:10,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:10,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:02:10,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:10,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash 848762663, now seen corresponding path program 1 times [2023-11-29 01:02:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:10,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161424406] [2023-11-29 01:02:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:10,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161424406] [2023-11-29 01:02:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161424406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:10,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:10,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035060701] [2023-11-29 01:02:10,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:10,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:10,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-29 01:02:10,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:10,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:10,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-29 01:02:10,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:11,186 INFO L124 PetriNetUnfolderBase]: 518/1001 cut-off events. [2023-11-29 01:02:11,186 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 01:02:11,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1001 events. 518/1001 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7188 event pairs, 218 based on Foata normal form. 6/931 useless extension candidates. Maximal degree in co-relation 1849. Up to 612 conditions per place. [2023-11-29 01:02:11,195 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-29 01:02:11,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 164 flow [2023-11-29 01:02:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:11,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:11,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:11,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:11,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:11,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:11,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,199 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:11,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 164 flow [2023-11-29 01:02:11,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:11,202 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-29 01:02:11,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-29 01:02:11,202 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-29 01:02:11,203 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-29 01:02:11,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:11,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:11,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:02:11,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:11,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash 848762662, now seen corresponding path program 1 times [2023-11-29 01:02:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:11,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709523072] [2023-11-29 01:02:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709523072] [2023-11-29 01:02:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709523072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:11,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:11,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593430757] [2023-11-29 01:02:11,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:11,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:11,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:11,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:11,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:11,461 INFO L124 PetriNetUnfolderBase]: 525/993 cut-off events. [2023-11-29 01:02:11,462 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 01:02:11,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 993 events. 525/993 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6871 event pairs, 412 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1858. Up to 625 conditions per place. [2023-11-29 01:02:11,470 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-29 01:02:11,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 164 flow [2023-11-29 01:02:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-29 01:02:11,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-29 01:02:11,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-29 01:02:11,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-29 01:02:11,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:11,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-29 01:02:11,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,474 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 111 transitions. [2023-11-29 01:02:11,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 164 flow [2023-11-29 01:02:11,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:11,477 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-29 01:02:11,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-29 01:02:11,478 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2023-11-29 01:02:11,478 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-29 01:02:11,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:11,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:11,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:02:11,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:11,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1016354215, now seen corresponding path program 1 times [2023-11-29 01:02:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:11,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756626036] [2023-11-29 01:02:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756626036] [2023-11-29 01:02:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756626036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:11,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:02:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120646984] [2023-11-29 01:02:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:11,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:11,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 53 [2023-11-29 01:02:11,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:11,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 53 [2023-11-29 01:02:11,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:11,801 INFO L124 PetriNetUnfolderBase]: 407/806 cut-off events. [2023-11-29 01:02:11,801 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 01:02:11,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 806 events. 407/806 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5434 event pairs, 74 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 1487. Up to 496 conditions per place. [2023-11-29 01:02:11,808 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-11-29 01:02:11,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 176 flow [2023-11-29 01:02:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 01:02:11,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2023-11-29 01:02:11,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 01:02:11,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 01:02:11,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:11,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 01:02:11,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,812 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 119 transitions. [2023-11-29 01:02:11,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 176 flow [2023-11-29 01:02:11,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:11,814 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2023-11-29 01:02:11,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-11-29 01:02:11,815 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-29 01:02:11,815 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2023-11-29 01:02:11,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:11,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:11,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:11,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:02:11,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:11,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1417980429, now seen corresponding path program 1 times [2023-11-29 01:02:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505137483] [2023-11-29 01:02:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:12,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505137483] [2023-11-29 01:02:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505137483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:12,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:12,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:02:12,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049883511] [2023-11-29 01:02:12,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:12,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:02:12,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:02:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:02:12,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-29 01:02:12,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:12,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:12,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-29 01:02:12,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:12,661 INFO L124 PetriNetUnfolderBase]: 362/707 cut-off events. [2023-11-29 01:02:12,661 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 01:02:12,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 707 events. 362/707 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4746 event pairs, 112 based on Foata normal form. 24/715 useless extension candidates. Maximal degree in co-relation 1339. Up to 485 conditions per place. [2023-11-29 01:02:12,667 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 20 selfloop transitions, 3 changer transitions 7/48 dead transitions. [2023-11-29 01:02:12,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 168 flow [2023-11-29 01:02:12,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:02:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:02:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2023-11-29 01:02:12,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691823899371069 [2023-11-29 01:02:12,669 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 181 transitions. [2023-11-29 01:02:12,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 181 transitions. [2023-11-29 01:02:12,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:12,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 181 transitions. [2023-11-29 01:02:12,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:12,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:12,671 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:12,672 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 6 states and 181 transitions. [2023-11-29 01:02:12,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 168 flow [2023-11-29 01:02:12,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:12,674 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 86 flow [2023-11-29 01:02:12,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-11-29 01:02:12,674 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2023-11-29 01:02:12,675 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 86 flow [2023-11-29 01:02:12,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:12,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:12,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:12,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:02:12,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:12,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1417979148, now seen corresponding path program 1 times [2023-11-29 01:02:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790375635] [2023-11-29 01:02:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:12,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790375635] [2023-11-29 01:02:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790375635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:12,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:02:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525177391] [2023-11-29 01:02:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:12,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:02:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:02:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:02:12,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-29 01:02:12,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:12,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:12,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-29 01:02:12,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:13,167 INFO L124 PetriNetUnfolderBase]: 1014/1726 cut-off events. [2023-11-29 01:02:13,168 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:02:13,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1726 events. 1014/1726 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10604 event pairs, 94 based on Foata normal form. 60/1780 useless extension candidates. Maximal degree in co-relation 3315. Up to 1015 conditions per place. [2023-11-29 01:02:13,183 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 37 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2023-11-29 01:02:13,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 222 flow [2023-11-29 01:02:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:02:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:02:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2023-11-29 01:02:13,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6839622641509434 [2023-11-29 01:02:13,184 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 145 transitions. [2023-11-29 01:02:13,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 145 transitions. [2023-11-29 01:02:13,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:13,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 145 transitions. [2023-11-29 01:02:13,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,186 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 4 states and 145 transitions. [2023-11-29 01:02:13,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 222 flow [2023-11-29 01:02:13,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:02:13,188 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2023-11-29 01:02:13,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-29 01:02:13,189 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2023-11-29 01:02:13,189 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2023-11-29 01:02:13,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:13,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:13,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:02:13,190 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:13,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:13,191 INFO L85 PathProgramCache]: Analyzing trace with hash 377108593, now seen corresponding path program 1 times [2023-11-29 01:02:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971514101] [2023-11-29 01:02:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971514101] [2023-11-29 01:02:13,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971514101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:13,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:02:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108357743] [2023-11-29 01:02:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:02:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:13,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:02:13,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:02:13,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-29 01:02:13,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:13,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-29 01:02:13,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:13,661 INFO L124 PetriNetUnfolderBase]: 688/1196 cut-off events. [2023-11-29 01:02:13,662 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2023-11-29 01:02:13,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 1196 events. 688/1196 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6541 event pairs, 34 based on Foata normal form. 54/1244 useless extension candidates. Maximal degree in co-relation 2738. Up to 553 conditions per place. [2023-11-29 01:02:13,671 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 46 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2023-11-29 01:02:13,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 308 flow [2023-11-29 01:02:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:02:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:02:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-29 01:02:13,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867924528301886 [2023-11-29 01:02:13,673 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-29 01:02:13,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-29 01:02:13,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:13,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-29 01:02:13,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,676 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,676 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 182 transitions. [2023-11-29 01:02:13,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 308 flow [2023-11-29 01:02:13,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 298 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:13,679 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2023-11-29 01:02:13,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-11-29 01:02:13,680 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-29 01:02:13,680 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2023-11-29 01:02:13,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:13,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:13,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:02:13,681 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:13,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -458546662, now seen corresponding path program 1 times [2023-11-29 01:02:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478507812] [2023-11-29 01:02:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:13,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478507812] [2023-11-29 01:02:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478507812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:13,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:02:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032951713] [2023-11-29 01:02:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:13,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:02:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:02:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:02:13,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-29 01:02:13,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:13,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:13,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-29 01:02:13,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:14,101 INFO L124 PetriNetUnfolderBase]: 369/639 cut-off events. [2023-11-29 01:02:14,101 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2023-11-29 01:02:14,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 639 events. 369/639 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2766 event pairs, 23 based on Foata normal form. 32/665 useless extension candidates. Maximal degree in co-relation 1694. Up to 228 conditions per place. [2023-11-29 01:02:14,107 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 41 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2023-11-29 01:02:14,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 323 flow [2023-11-29 01:02:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:02:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:02:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-29 01:02:14,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6446540880503144 [2023-11-29 01:02:14,108 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-29 01:02:14,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-29 01:02:14,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:14,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-29 01:02:14,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,111 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,111 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 205 transitions. [2023-11-29 01:02:14,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 323 flow [2023-11-29 01:02:14,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 01:02:14,115 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2023-11-29 01:02:14,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-11-29 01:02:14,116 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2023-11-29 01:02:14,116 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2023-11-29 01:02:14,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:14,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:02:14,117 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:14,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2110421383, now seen corresponding path program 1 times [2023-11-29 01:02:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:14,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520672205] [2023-11-29 01:02:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:14,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:14,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520672205] [2023-11-29 01:02:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520672205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:02:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343578117] [2023-11-29 01:02:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:14,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:02:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:02:14,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:02:14,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:14,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:14,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:14,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:14,596 INFO L124 PetriNetUnfolderBase]: 487/984 cut-off events. [2023-11-29 01:02:14,596 INFO L125 PetriNetUnfolderBase]: For 458/476 co-relation queries the response was YES. [2023-11-29 01:02:14,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 984 events. 487/984 cut-off events. For 458/476 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5365 event pairs, 215 based on Foata normal form. 8/921 useless extension candidates. Maximal degree in co-relation 2234. Up to 391 conditions per place. [2023-11-29 01:02:14,601 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 27 selfloop transitions, 2 changer transitions 13/65 dead transitions. [2023-11-29 01:02:14,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 310 flow [2023-11-29 01:02:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:02:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:02:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2023-11-29 01:02:14,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6716981132075471 [2023-11-29 01:02:14,602 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 178 transitions. [2023-11-29 01:02:14,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 178 transitions. [2023-11-29 01:02:14,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:14,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 178 transitions. [2023-11-29 01:02:14,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,605 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,605 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 5 states and 178 transitions. [2023-11-29 01:02:14,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 310 flow [2023-11-29 01:02:14,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 246 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 01:02:14,609 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 125 flow [2023-11-29 01:02:14,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-11-29 01:02:14,610 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2023-11-29 01:02:14,610 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 125 flow [2023-11-29 01:02:14,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:14,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:14,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:02:14,610 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:14,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 901605145, now seen corresponding path program 2 times [2023-11-29 01:02:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693403056] [2023-11-29 01:02:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693403056] [2023-11-29 01:02:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693403056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:02:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073197183] [2023-11-29 01:02:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:14,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:02:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:14,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:02:14,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:02:14,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:14,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:14,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:14,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:14,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:15,037 INFO L124 PetriNetUnfolderBase]: 355/738 cut-off events. [2023-11-29 01:02:15,037 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 01:02:15,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 738 events. 355/738 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3767 event pairs, 179 based on Foata normal form. 8/703 useless extension candidates. Maximal degree in co-relation 1472. Up to 337 conditions per place. [2023-11-29 01:02:15,040 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 21 selfloop transitions, 2 changer transitions 14/60 dead transitions. [2023-11-29 01:02:15,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 237 flow [2023-11-29 01:02:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:02:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:02:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2023-11-29 01:02:15,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6528301886792452 [2023-11-29 01:02:15,042 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 173 transitions. [2023-11-29 01:02:15,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 173 transitions. [2023-11-29 01:02:15,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:15,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 173 transitions. [2023-11-29 01:02:15,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:15,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:15,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:15,044 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 125 flow. Second operand 5 states and 173 transitions. [2023-11-29 01:02:15,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 237 flow [2023-11-29 01:02:15,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 223 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 01:02:15,046 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 127 flow [2023-11-29 01:02:15,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-11-29 01:02:15,047 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2023-11-29 01:02:15,047 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 127 flow [2023-11-29 01:02:15,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:15,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:15,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:15,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:02:15,048 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:15,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash 548417895, now seen corresponding path program 3 times [2023-11-29 01:02:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299495830] [2023-11-29 01:02:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:15,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299495830] [2023-11-29 01:02:15,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299495830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:15,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:15,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:02:15,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189446811] [2023-11-29 01:02:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:15,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:02:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:15,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:02:15,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:02:15,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-29 01:02:15,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 127 flow. Second operand has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:15,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:15,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-29 01:02:15,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:16,243 INFO L124 PetriNetUnfolderBase]: 269/546 cut-off events. [2023-11-29 01:02:16,243 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 01:02:16,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 546 events. 269/546 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2538 event pairs, 115 based on Foata normal form. 8/517 useless extension candidates. Maximal degree in co-relation 1082. Up to 225 conditions per place. [2023-11-29 01:02:16,246 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 20 selfloop transitions, 3 changer transitions 16/63 dead transitions. [2023-11-29 01:02:16,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 249 flow [2023-11-29 01:02:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:02:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 01:02:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2023-11-29 01:02:16,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6361185983827493 [2023-11-29 01:02:16,248 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 236 transitions. [2023-11-29 01:02:16,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 236 transitions. [2023-11-29 01:02:16,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:16,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 236 transitions. [2023-11-29 01:02:16,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:16,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:16,251 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:16,251 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 127 flow. Second operand 7 states and 236 transitions. [2023-11-29 01:02:16,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 249 flow [2023-11-29 01:02:16,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 235 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 01:02:16,253 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 134 flow [2023-11-29 01:02:16,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-11-29 01:02:16,254 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-29 01:02:16,254 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 134 flow [2023-11-29 01:02:16,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:16,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:16,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:16,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:02:16,255 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:16,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:16,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1393954979, now seen corresponding path program 4 times [2023-11-29 01:02:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848595010] [2023-11-29 01:02:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:02:16,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:02:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:02:16,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:02:16,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:02:16,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 01:02:16,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 01:02:16,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 01:02:16,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 01:02:16,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 01:02:16,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 01:02:16,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 01:02:16,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 01:02:16,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 01:02:16,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 01:02:16,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 01:02:16,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 01:02:16,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 01:02:16,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:02:16,370 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:16,375 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:02:16,375 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:02:16,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 01:02:16,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 01:02:16,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 01:02:16,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:02:16,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:02:16,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:02:16 BasicIcfg [2023-11-29 01:02:16,445 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:02:16,446 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:02:16,446 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:02:16,446 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:02:16,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:02:09" (3/4) ... [2023-11-29 01:02:16,448 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:02:16,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:02:16,450 INFO L158 Benchmark]: Toolchain (without parser) took 8584.90ms. Allocated memory was 167.8MB in the beginning and 297.8MB in the end (delta: 130.0MB). Free memory was 121.2MB in the beginning and 154.0MB in the end (delta: -32.8MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2023-11-29 01:02:16,450 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory was 141.4MB in the beginning and 141.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:02:16,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.64ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 98.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 01:02:16,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.15ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:02:16,451 INFO L158 Benchmark]: Boogie Preprocessor took 56.27ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 91.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:02:16,452 INFO L158 Benchmark]: RCFGBuilder took 674.61ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 124.0MB in the end (delta: -32.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2023-11-29 01:02:16,452 INFO L158 Benchmark]: TraceAbstraction took 7261.73ms. Allocated memory was 167.8MB in the beginning and 297.8MB in the end (delta: 130.0MB). Free memory was 123.0MB in the beginning and 154.0MB in the end (delta: -31.0MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2023-11-29 01:02:16,453 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 297.8MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:02:16,454 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory was 141.4MB in the beginning and 141.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.64ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 98.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.15ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.27ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 91.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 674.61ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 124.0MB in the end (delta: -32.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7261.73ms. Allocated memory was 167.8MB in the beginning and 297.8MB in the end (delta: 130.0MB). Free memory was 123.0MB in the beginning and 154.0MB in the end (delta: -31.0MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 297.8MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 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) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 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 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L17] 0 __assert_fail ("0", "safe030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 77 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 537 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 439 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1158 IncrementalHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 11 mSDtfsCounter, 1158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=11, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 [2023-11-29 01:02:16,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:02:18,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:02:18,467 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 01:02:18,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:02:18,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:02:18,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:02:18,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:02:18,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:02:18,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:02:18,506 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:02:18,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:02:18,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:02:18,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:02:18,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:02:18,509 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:02:18,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:02:18,510 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:02:18,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:02:18,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:02:18,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:02:18,512 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:02:18,513 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:02:18,514 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:02:18,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:02:18,514 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:02:18,515 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:02:18,515 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:02:18,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:02:18,516 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:02:18,517 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:02:18,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:02:18,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:02:18,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:02:18,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:02:18,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:02:18,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:02:18,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:02:18,519 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:02:18,519 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:02:18,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:02:18,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:02:18,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:02:18,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:02:18,520 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:02:18,521 INFO L153 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_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/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_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2023-11-29 01:02:18,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:02:18,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:02:18,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:02:18,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:02:18,814 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:02:18,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-29 01:02:21,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:02:21,889 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:02:21,890 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-29 01:02:21,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data/8967f1d53/e6fd7e5027b54334ab11bd21ff58c258/FLAG346a2eb89 [2023-11-29 01:02:21,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/data/8967f1d53/e6fd7e5027b54334ab11bd21ff58c258 [2023-11-29 01:02:21,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:02:21,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:02:21,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:02:21,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:02:21,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:02:21,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:02:21" (1/1) ... [2023-11-29 01:02:21,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5ca426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:21, skipping insertion in model container [2023-11-29 01:02:21,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:02:21" (1/1) ... [2023-11-29 01:02:21,986 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:02:22,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:02:22,318 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:02:22,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:02:22,437 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:02:22,437 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:02:22,445 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:02:22,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22 WrapperNode [2023-11-29 01:02:22,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:02:22,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:02:22,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:02:22,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:02:22,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,520 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-29 01:02:22,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:02:22,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:02:22,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:02:22,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:02:22,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,558 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 01:02:22,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:02:22,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:02:22,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:02:22,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:02:22,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (1/1) ... [2023-11-29 01:02:22,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:02:22,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:02:22,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:02:22,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:02:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 01:02:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:02:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:02:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:02:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:02:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:02:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:02:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 01:02:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:02:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:02:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:02:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 01:02:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 01:02:22,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 01:02:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 01:02:22,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 01:02:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 01:02:22,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 01:02:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 01:02:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:02:22,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:02:22,676 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:02:22,878 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:02:22,881 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:02:23,238 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:02:23,461 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:02:23,461 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:02:23,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:02:23 BoogieIcfgContainer [2023-11-29 01:02:23,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:02:23,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:02:23,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:02:23,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:02:23,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:02:21" (1/3) ... [2023-11-29 01:02:23,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a654db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:02:23, skipping insertion in model container [2023-11-29 01:02:23,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:02:22" (2/3) ... [2023-11-29 01:02:23,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a654db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:02:23, skipping insertion in model container [2023-11-29 01:02:23,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:02:23" (3/3) ... [2023-11-29 01:02:23,471 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-11-29 01:02:23,491 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:02:23,491 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 01:02:23,491 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:02:23,550 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 01:02:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-29 01:02:23,621 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-29 01:02:23,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:02:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-29 01:02:23,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-29 01:02:23,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-29 01:02:23,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:02:23,647 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;@6aa5c1e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:02:23,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 01:02:23,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:02:23,651 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 01:02:23,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:02:23,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:23,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:02:23,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:23,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 12011, now seen corresponding path program 1 times [2023-11-29 01:02:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458042344] [2023-11-29 01:02:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:23,671 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 [2023-11-29 01:02:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:23,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:23,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:23,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:02:23,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:23,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:02:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:23,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:23,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458042344] [2023-11-29 01:02:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458042344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:02:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594933530] [2023-11-29 01:02:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:23,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:23,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:23,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:23,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:23,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:23,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:23,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:24,175 INFO L124 PetriNetUnfolderBase]: 518/1012 cut-off events. [2023-11-29 01:02:24,175 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 01:02:24,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 1012 events. 518/1012 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7341 event pairs, 400 based on Foata normal form. 60/977 useless extension candidates. Maximal degree in co-relation 1827. Up to 628 conditions per place. [2023-11-29 01:02:24,187 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 01:02:24,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 173 flow [2023-11-29 01:02:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:24,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:24,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:24,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:24,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:24,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:24,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,208 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:24,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 173 flow [2023-11-29 01:02:24,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:02:24,214 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 01:02:24,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 01:02:24,219 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-29 01:02:24,219 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 01:02:24,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:24,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:02:24,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:02:24,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:24,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:24,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:24,421 INFO L85 PathProgramCache]: Analyzing trace with hash 12012, now seen corresponding path program 1 times [2023-11-29 01:02:24,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:24,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095344638] [2023-11-29 01:02:24,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:24,422 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 [2023-11-29 01:02:24,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:24,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:24,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:24,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:02:24,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:24,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:02:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:24,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:24,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095344638] [2023-11-29 01:02:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095344638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:24,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:02:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941178028] [2023-11-29 01:02:24,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:24,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:24,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:24,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:24,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:24,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-29 01:02:24,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:24,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-29 01:02:24,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:24,783 INFO L124 PetriNetUnfolderBase]: 518/1011 cut-off events. [2023-11-29 01:02:24,783 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 01:02:24,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 1011 events. 518/1011 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7336 event pairs, 400 based on Foata normal form. 1/917 useless extension candidates. Maximal degree in co-relation 1857. Up to 627 conditions per place. [2023-11-29 01:02:24,792 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 01:02:24,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 170 flow [2023-11-29 01:02:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:24,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:24,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:24,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:24,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:24,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:24,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,798 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:24,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 170 flow [2023-11-29 01:02:24,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:24,803 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 01:02:24,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 01:02:24,804 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-29 01:02:24,804 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 01:02:24,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:24,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:24,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:02:24,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 01:02:25,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:25,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:25,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:25,006 INFO L85 PathProgramCache]: Analyzing trace with hash 358182983, now seen corresponding path program 1 times [2023-11-29 01:02:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324443465] [2023-11-29 01:02:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:25,007 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 [2023-11-29 01:02:25,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:25,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:25,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:25,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:02:25,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:25,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:02:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:25,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:25,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324443465] [2023-11-29 01:02:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324443465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:25,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:25,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460968509] [2023-11-29 01:02:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:25,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:25,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:25,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:25,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:25,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:25,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:25,350 INFO L124 PetriNetUnfolderBase]: 519/1010 cut-off events. [2023-11-29 01:02:25,351 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 01:02:25,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1010 events. 519/1010 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7279 event pairs, 318 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1859. Up to 627 conditions per place. [2023-11-29 01:02:25,361 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 01:02:25,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 170 flow [2023-11-29 01:02:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-29 01:02:25,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-29 01:02:25,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-29 01:02:25,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-29 01:02:25,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:25,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-29 01:02:25,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,366 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-29 01:02:25,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 170 flow [2023-11-29 01:02:25,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:25,369 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 01:02:25,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 01:02:25,370 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-29 01:02:25,370 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 01:02:25,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:25,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:02:25,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 01:02:25,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:25,572 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:25,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash 358182984, now seen corresponding path program 1 times [2023-11-29 01:02:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:25,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492010404] [2023-11-29 01:02:25,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:25,573 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 [2023-11-29 01:02:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:25,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:25,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:25,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:02:25,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:25,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:02:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:25,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:25,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492010404] [2023-11-29 01:02:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492010404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617020599] [2023-11-29 01:02:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:25,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:25,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:25,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-29 01:02:25,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:25,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-29 01:02:25,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:25,895 INFO L124 PetriNetUnfolderBase]: 518/1006 cut-off events. [2023-11-29 01:02:25,895 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 01:02:25,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 1006 events. 518/1006 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7366 event pairs, 399 based on Foata normal form. 2/918 useless extension candidates. Maximal degree in co-relation 1854. Up to 624 conditions per place. [2023-11-29 01:02:25,903 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 01:02:25,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 166 flow [2023-11-29 01:02:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:25,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:25,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:25,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:25,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:25,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:25,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,908 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:25,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 166 flow [2023-11-29 01:02:25,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:25,912 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 01:02:25,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-29 01:02:25,913 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-29 01:02:25,913 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 01:02:25,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:25,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:25,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:25,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 01:02:26,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:26,115 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:26,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1930844768, now seen corresponding path program 1 times [2023-11-29 01:02:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954244983] [2023-11-29 01:02:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:26,116 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 [2023-11-29 01:02:26,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:26,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:26,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:26,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:02:26,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:26,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:02:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:26,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:26,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954244983] [2023-11-29 01:02:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954244983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046806561] [2023-11-29 01:02:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:26,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:26,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:26,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:26,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:26,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:26,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:26,477 INFO L124 PetriNetUnfolderBase]: 525/1008 cut-off events. [2023-11-29 01:02:26,477 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 01:02:26,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 1008 events. 525/1008 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7238 event pairs, 218 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1869. Up to 625 conditions per place. [2023-11-29 01:02:26,484 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-29 01:02:26,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 166 flow [2023-11-29 01:02:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-29 01:02:26,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-29 01:02:26,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-29 01:02:26,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-29 01:02:26,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:26,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-29 01:02:26,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:26,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:26,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:26,489 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 111 transitions. [2023-11-29 01:02:26,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 166 flow [2023-11-29 01:02:26,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:26,492 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-29 01:02:26,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-29 01:02:26,493 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-29 01:02:26,493 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-29 01:02:26,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:26,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:26,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:26,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 01:02:26,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:26,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:26,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1930844769, now seen corresponding path program 1 times [2023-11-29 01:02:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328906345] [2023-11-29 01:02:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:26,697 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 [2023-11-29 01:02:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:26,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:26,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:26,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:02:26,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:26,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:02:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:26,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:26,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:26,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328906345] [2023-11-29 01:02:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328906345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:02:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595360595] [2023-11-29 01:02:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:26,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:26,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-29 01:02:26,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:26,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:26,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-29 01:02:26,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:27,057 INFO L124 PetriNetUnfolderBase]: 518/995 cut-off events. [2023-11-29 01:02:27,057 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 01:02:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 995 events. 518/995 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7179 event pairs, 218 based on Foata normal form. 6/927 useless extension candidates. Maximal degree in co-relation 1847. Up to 612 conditions per place. [2023-11-29 01:02:27,066 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-29 01:02:27,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 162 flow [2023-11-29 01:02:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-29 01:02:27,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-29 01:02:27,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-29 01:02:27,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-29 01:02:27,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:27,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-29 01:02:27,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,071 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 113 transitions. [2023-11-29 01:02:27,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 162 flow [2023-11-29 01:02:27,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:27,073 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-29 01:02:27,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-29 01:02:27,075 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2023-11-29 01:02:27,075 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-29 01:02:27,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:27,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:27,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 01:02:27,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:27,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:27,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -700145807, now seen corresponding path program 1 times [2023-11-29 01:02:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:27,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641801095] [2023-11-29 01:02:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:27,280 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 [2023-11-29 01:02:27,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:27,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:27,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:27,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:02:27,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:27,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:27,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641801095] [2023-11-29 01:02:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641801095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:27,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:02:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594183018] [2023-11-29 01:02:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:27,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:02:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:02:27,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:02:27,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 53 [2023-11-29 01:02:27,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:27,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 53 [2023-11-29 01:02:27,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:27,558 INFO L124 PetriNetUnfolderBase]: 407/806 cut-off events. [2023-11-29 01:02:27,559 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 01:02:27,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 806 events. 407/806 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5370 event pairs, 74 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1487. Up to 496 conditions per place. [2023-11-29 01:02:27,566 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-11-29 01:02:27,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 176 flow [2023-11-29 01:02:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:02:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:02:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 01:02:27,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2023-11-29 01:02:27,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 01:02:27,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 01:02:27,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:27,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 01:02:27,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,571 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 119 transitions. [2023-11-29 01:02:27,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 176 flow [2023-11-29 01:02:27,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:27,573 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2023-11-29 01:02:27,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-11-29 01:02:27,574 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-29 01:02:27,574 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2023-11-29 01:02:27,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:27,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:27,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 01:02:27,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:27,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:27,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1721211947, now seen corresponding path program 1 times [2023-11-29 01:02:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120218707] [2023-11-29 01:02:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:27,776 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 [2023-11-29 01:02:27,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:27,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:27,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:02:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:27,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:02:27,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:27,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:27,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:27,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120218707] [2023-11-29 01:02:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120218707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:27,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:27,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:02:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781190694] [2023-11-29 01:02:27,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:02:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:02:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:02:27,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-29 01:02:27,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:27,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:27,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-29 01:02:27,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:28,244 INFO L124 PetriNetUnfolderBase]: 1129/1949 cut-off events. [2023-11-29 01:02:28,244 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-29 01:02:28,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 1949 events. 1129/1949 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12340 event pairs, 94 based on Foata normal form. 60/2001 useless extension candidates. Maximal degree in co-relation 3798. Up to 1184 conditions per place. [2023-11-29 01:02:28,258 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 38 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2023-11-29 01:02:28,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 226 flow [2023-11-29 01:02:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:02:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:02:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2023-11-29 01:02:28,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6886792452830188 [2023-11-29 01:02:28,260 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 146 transitions. [2023-11-29 01:02:28,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 146 transitions. [2023-11-29 01:02:28,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:28,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 146 transitions. [2023-11-29 01:02:28,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,262 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,262 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 4 states and 146 transitions. [2023-11-29 01:02:28,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 226 flow [2023-11-29 01:02:28,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:28,264 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2023-11-29 01:02:28,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-29 01:02:28,265 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-29 01:02:28,266 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2023-11-29 01:02:28,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:28,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:28,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 01:02:28,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:28,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:28,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1077530694, now seen corresponding path program 1 times [2023-11-29 01:02:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:28,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783610978] [2023-11-29 01:02:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:28,472 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 [2023-11-29 01:02:28,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:28,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:28,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 01:02:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:28,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:02:28,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:28,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:28,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783610978] [2023-11-29 01:02:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783610978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:02:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325297184] [2023-11-29 01:02:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:28,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:02:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:28,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:02:28,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:02:28,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-29 01:02:28,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:28,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-29 01:02:28,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:28,934 INFO L124 PetriNetUnfolderBase]: 748/1320 cut-off events. [2023-11-29 01:02:28,934 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-11-29 01:02:28,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 1320 events. 748/1320 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7422 event pairs, 34 based on Foata normal form. 54/1366 useless extension candidates. Maximal degree in co-relation 2954. Up to 645 conditions per place. [2023-11-29 01:02:28,942 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 47 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2023-11-29 01:02:28,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 311 flow [2023-11-29 01:02:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:02:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:02:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2023-11-29 01:02:28,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.690566037735849 [2023-11-29 01:02:28,944 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 183 transitions. [2023-11-29 01:02:28,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 183 transitions. [2023-11-29 01:02:28,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:28,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 183 transitions. [2023-11-29 01:02:28,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,946 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,946 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 183 transitions. [2023-11-29 01:02:28,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 311 flow [2023-11-29 01:02:28,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 301 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:28,949 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2023-11-29 01:02:28,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-29 01:02:28,950 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-29 01:02:28,950 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2023-11-29 01:02:28,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:28,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:28,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:28,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 01:02:29,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:29,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:29,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash 700031317, now seen corresponding path program 1 times [2023-11-29 01:02:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:29,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749973869] [2023-11-29 01:02:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:29,153 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 [2023-11-29 01:02:29,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:29,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:29,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 01:02:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:29,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:02:29,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:29,310 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:29,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749973869] [2023-11-29 01:02:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749973869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:29,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:29,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:02:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810627879] [2023-11-29 01:02:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:29,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:02:29,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:29,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:02:29,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:02:29,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-29 01:02:29,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:29,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:29,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-29 01:02:29,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:29,542 INFO L124 PetriNetUnfolderBase]: 381/667 cut-off events. [2023-11-29 01:02:29,543 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2023-11-29 01:02:29,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 667 events. 381/667 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2955 event pairs, 23 based on Foata normal form. 32/691 useless extension candidates. Maximal degree in co-relation 1730. Up to 228 conditions per place. [2023-11-29 01:02:29,547 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 42 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2023-11-29 01:02:29,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 326 flow [2023-11-29 01:02:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:02:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:02:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-29 01:02:29,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6477987421383647 [2023-11-29 01:02:29,549 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-29 01:02:29,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-29 01:02:29,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:29,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-29 01:02:29,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:29,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:29,551 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:29,551 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 206 transitions. [2023-11-29 01:02:29,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 326 flow [2023-11-29 01:02:29,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 301 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 01:02:29,557 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2023-11-29 01:02:29,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-29 01:02:29,558 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2023-11-29 01:02:29,558 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2023-11-29 01:02:29,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:29,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:29,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:29,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 01:02:29,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:29,762 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:29,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1915675206, now seen corresponding path program 1 times [2023-11-29 01:02:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424254220] [2023-11-29 01:02:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:29,763 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 [2023-11-29 01:02:29,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:29,764 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:29,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 01:02:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:29,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:02:29,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:30,454 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2492~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2494~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2493~0#1.base_51| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2492~0#1.base_43| (_ bv1 1)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2492~0#1.base_43|) (_ bv0 1)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2492~0#1.base_43| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2493~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2494~0#1.base_43| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t2493~0#1.base_51|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~#t2493~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2494~0#1.base_43|) (_ bv0 1))))) is different from true [2023-11-29 01:02:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:30,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:30,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:30,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424254220] [2023-11-29 01:02:30,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424254220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:30,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:02:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393020474] [2023-11-29 01:02:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:30,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:02:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:02:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 01:02:30,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2023-11-29 01:02:30,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:30,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:30,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2023-11-29 01:02:30,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:30,760 INFO L124 PetriNetUnfolderBase]: 206/434 cut-off events. [2023-11-29 01:02:30,760 INFO L125 PetriNetUnfolderBase]: For 130/136 co-relation queries the response was YES. [2023-11-29 01:02:30,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 434 events. 206/434 cut-off events. For 130/136 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2004 event pairs, 52 based on Foata normal form. 8/404 useless extension candidates. Maximal degree in co-relation 925. Up to 290 conditions per place. [2023-11-29 01:02:30,764 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 26 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-11-29 01:02:30,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 258 flow [2023-11-29 01:02:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:02:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:02:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2023-11-29 01:02:30,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46540880503144655 [2023-11-29 01:02:30,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 148 transitions. [2023-11-29 01:02:30,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 148 transitions. [2023-11-29 01:02:30,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:30,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 148 transitions. [2023-11-29 01:02:30,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:30,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:30,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:30,768 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 6 states and 148 transitions. [2023-11-29 01:02:30,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 258 flow [2023-11-29 01:02:30,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 202 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 01:02:30,771 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 148 flow [2023-11-29 01:02:30,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-11-29 01:02:30,772 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2023-11-29 01:02:30,772 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 148 flow [2023-11-29 01:02:30,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:30,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:30,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:30,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 01:02:30,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:30,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:30,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2035704321, now seen corresponding path program 1 times [2023-11-29 01:02:30,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:30,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713199041] [2023-11-29 01:02:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:30,974 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 [2023-11-29 01:02:30,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:30,975 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:30,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 01:02:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:31,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:02:31,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:31,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:31,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713199041] [2023-11-29 01:02:31,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713199041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:31,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:31,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:02:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575511495] [2023-11-29 01:02:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:31,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:02:31,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:02:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:02:31,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:31,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:31,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:31,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:31,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:31,356 INFO L124 PetriNetUnfolderBase]: 467/947 cut-off events. [2023-11-29 01:02:31,356 INFO L125 PetriNetUnfolderBase]: For 319/347 co-relation queries the response was YES. [2023-11-29 01:02:31,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 947 events. 467/947 cut-off events. For 319/347 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5095 event pairs, 224 based on Foata normal form. 8/903 useless extension candidates. Maximal degree in co-relation 2208. Up to 432 conditions per place. [2023-11-29 01:02:31,361 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 40 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-11-29 01:02:31,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 310 flow [2023-11-29 01:02:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:02:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:02:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2023-11-29 01:02:31,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.660377358490566 [2023-11-29 01:02:31,363 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 175 transitions. [2023-11-29 01:02:31,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 175 transitions. [2023-11-29 01:02:31,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:31,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 175 transitions. [2023-11-29 01:02:31,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:31,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:31,365 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:31,365 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 148 flow. Second operand 5 states and 175 transitions. [2023-11-29 01:02:31,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 310 flow [2023-11-29 01:02:31,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:02:31,368 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 176 flow [2023-11-29 01:02:31,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-11-29 01:02:31,369 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2023-11-29 01:02:31,369 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 176 flow [2023-11-29 01:02:31,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:31,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:31,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:31,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 01:02:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:31,573 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:31,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash -256110559, now seen corresponding path program 2 times [2023-11-29 01:02:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663034867] [2023-11-29 01:02:31,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:02:31,574 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 [2023-11-29 01:02:31,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:31,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:31,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 01:02:31,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 01:02:31,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:02:31,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:02:31,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:31,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:31,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:02:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663034867] [2023-11-29 01:02:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663034867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:31,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:02:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:02:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822769247] [2023-11-29 01:02:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:31,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:02:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:31,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:02:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:02:31,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-29 01:02:31,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:31,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:31,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-29 01:02:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:32,132 INFO L124 PetriNetUnfolderBase]: 922/1825 cut-off events. [2023-11-29 01:02:32,132 INFO L125 PetriNetUnfolderBase]: For 688/760 co-relation queries the response was YES. [2023-11-29 01:02:32,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4421 conditions, 1825 events. 922/1825 cut-off events. For 688/760 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11160 event pairs, 372 based on Foata normal form. 8/1696 useless extension candidates. Maximal degree in co-relation 4406. Up to 721 conditions per place. [2023-11-29 01:02:32,154 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 48 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2023-11-29 01:02:32,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 396 flow [2023-11-29 01:02:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:02:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:02:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-11-29 01:02:32,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-29 01:02:32,155 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 180 transitions. [2023-11-29 01:02:32,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 180 transitions. [2023-11-29 01:02:32,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:32,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 180 transitions. [2023-11-29 01:02:32,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:32,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:32,158 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:32,158 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 176 flow. Second operand 5 states and 180 transitions. [2023-11-29 01:02:32,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 396 flow [2023-11-29 01:02:32,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:02:32,161 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 256 flow [2023-11-29 01:02:32,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-11-29 01:02:32,162 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-11-29 01:02:32,162 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 256 flow [2023-11-29 01:02:32,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:32,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:32,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:32,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 01:02:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:32,364 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 01:02:32,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1434044631, now seen corresponding path program 3 times [2023-11-29 01:02:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:02:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722061637] [2023-11-29 01:02:32,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:02:32,366 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 [2023-11-29 01:02:32,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:02:32,368 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 01:02:32,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 01:02:32,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 01:02:32,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:02:32,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:02:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:02:32,723 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 01:02:32,723 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:02:32,724 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 01:02:32,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 01:02:32,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 01:02:32,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 01:02:32,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 01:02:32,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 01:02:32,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 01:02:32,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 01:02:32,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 01:02:32,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 01:02:32,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 01:02:32,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 01:02:32,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 01:02:32,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 01:02:32,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:02:32,933 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:32,937 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:02:32,937 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:02:32,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 01:02:32,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 01:02:32,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 01:02:32,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:02:32,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:02:33,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:02:33 BasicIcfg [2023-11-29 01:02:33,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:02:33,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:02:33,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:02:33,009 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:02:33,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:02:23" (3/4) ... [2023-11-29 01:02:33,012 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:02:33,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:02:33,013 INFO L158 Benchmark]: Toolchain (without parser) took 11089.42ms. Allocated memory was 88.1MB in the beginning and 182.5MB in the end (delta: 94.4MB). Free memory was 63.1MB in the beginning and 71.8MB in the end (delta: -8.7MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2023-11-29 01:02:33,013 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:02:33,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.20ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 62.9MB in the beginning and 100.2MB in the end (delta: -37.4MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2023-11-29 01:02:33,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.37ms. Allocated memory is still 125.8MB. Free memory was 100.1MB in the beginning and 97.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:02:33,014 INFO L158 Benchmark]: Boogie Preprocessor took 63.21ms. Allocated memory is still 125.8MB. Free memory was 97.7MB in the beginning and 93.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:02:33,015 INFO L158 Benchmark]: RCFGBuilder took 876.46ms. Allocated memory is still 125.8MB. Free memory was 93.9MB in the beginning and 69.5MB in the end (delta: 24.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2023-11-29 01:02:33,015 INFO L158 Benchmark]: TraceAbstraction took 9543.92ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 68.8MB in the beginning and 71.8MB in the end (delta: -3.0MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2023-11-29 01:02:33,015 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 182.5MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:02:33,017 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.20ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 62.9MB in the beginning and 100.2MB in the end (delta: -37.4MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.37ms. Allocated memory is still 125.8MB. Free memory was 100.1MB in the beginning and 97.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.21ms. Allocated memory is still 125.8MB. Free memory was 97.7MB in the beginning and 93.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 876.46ms. Allocated memory is still 125.8MB. Free memory was 93.9MB in the beginning and 69.5MB in the end (delta: 24.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9543.92ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 68.8MB in the beginning and 71.8MB in the end (delta: -3.0MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 182.5MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={3:0}, t2493={7:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={3:0}, t2493={7:0}, t2494={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 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) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 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 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={3:0}, t2493={7:0}, t2494={6:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={3:0}, t2493={7:0}, t2494={6:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={3:0}, t2493={7:0}, t2494={6:0}, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L17] 0 __assert_fail ("0", "safe030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 77 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 50 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 958 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 34 mSDtfsCounter, 958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=13, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 196 ConstructedInterpolants, 1 QuantifiedInterpolants, 1306 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1433 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 [2023-11-29 01:02:33,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba930460-d79d-497a-8d5a-222f08a4b903/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample