./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI --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 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:01:30,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:01:30,208 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:01:30,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:01:30,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:01:30,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:01:30,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:01:30,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:01:30,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:01:30,272 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:01:30,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:01:30,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:01:30,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:01:30,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:01:30,276 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:01:30,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:01:30,277 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:01:30,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:01:30,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:01:30,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:01:30,279 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:01:30,280 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:01:30,280 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:01:30,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:01:30,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:01:30,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:01:30,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:01:30,294 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:01:30,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:01:30,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:01:30,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:01:30,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:01:30,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:01:30,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:01:30,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:01:30,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:01:30,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:01:30,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:01:30,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:01:30,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:01:30,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:01:30,300 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_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/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_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI 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 -> 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 [2023-11-24 22:01:30,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:01:30,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:01:30,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:01:30,716 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:01:30,717 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:01:30,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:01:33,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:01:34,397 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:01:34,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:01:34,421 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data/6bb1eaceb/1bcf7988dcb5441aac58630e8c85f1b2/FLAG044ea884b [2023-11-24 22:01:34,442 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data/6bb1eaceb/1bcf7988dcb5441aac58630e8c85f1b2 [2023-11-24 22:01:34,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:01:34,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:01:34,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:34,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:01:34,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:01:34,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:34" (1/1) ... [2023-11-24 22:01:34,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61567061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:34, skipping insertion in model container [2023-11-24 22:01:34,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:34" (1/1) ... [2023-11-24 22:01:34,538 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:01:35,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:35,155 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:01:35,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:35,271 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:35,271 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:35,280 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:01:35,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35 WrapperNode [2023-11-24 22:01:35,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:35,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:35,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:01:35,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:01:35,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,344 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2023-11-24 22:01:35,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:35,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:01:35,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:01:35,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:01:35,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,384 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-24 22:01:35,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:01:35,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:01:35,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:01:35,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:01:35,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:01:35,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:01:35,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:01:35,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 22:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:01:35,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:01:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:01:35,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:01:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 22:01:35,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 22:01:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:01:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:01:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:01:35,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 22:01:35,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:01:35,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:01:35,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:01:35,537 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:01:35,804 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:01:35,806 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:01:36,184 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:01:36,552 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:01:36,553 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:01:36,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:36 BoogieIcfgContainer [2023-11-24 22:01:36,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:01:36,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:01:36,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:01:36,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:01:36,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:01:34" (1/3) ... [2023-11-24 22:01:36,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52496f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:36, skipping insertion in model container [2023-11-24 22:01:36,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (2/3) ... [2023-11-24 22:01:36,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52496f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:36, skipping insertion in model container [2023-11-24 22:01:36,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:36" (3/3) ... [2023-11-24 22:01:36,569 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:01:36,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:01:36,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 22:01:36,594 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:01:36,670 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:01:36,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:36,766 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-24 22:01:36,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:36,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-24 22:01:36,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:36,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-24 22:01:36,794 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:01:36,801 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;@402a2278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:01:36,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 22:01:36,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:01:36,806 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:01:36,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:36,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:36,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:36,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:36,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 12020, now seen corresponding path program 1 times [2023-11-24 22:01:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:36,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480871184] [2023-11-24 22:01:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:37,194 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-24 22:01:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:37,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480871184] [2023-11-24 22:01:37,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480871184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:37,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697065740] [2023-11-24 22:01:37,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:37,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:37,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:37,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:37,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:37,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 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-24 22:01:37,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:37,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:37,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:37,933 INFO L124 PetriNetUnfolderBase]: 772/1569 cut-off events. [2023-11-24 22:01:37,933 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:01:37,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 1569 events. 772/1569 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11084 event pairs, 580 based on Foata normal form. 90/1507 useless extension candidates. Maximal degree in co-relation 2768. Up to 888 conditions per place. [2023-11-24 22:01:37,961 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 22:01:37,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 179 flow [2023-11-24 22:01:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 22:01:37,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:01:37,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 22:01:37,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 22:01:37,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:37,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 22:01:37,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 22:01:37,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:37,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:37,999 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 117 transitions. [2023-11-24 22:01:38,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 179 flow [2023-11-24 22:01:38,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:01:38,015 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:38,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-24 22:01:38,023 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 22:01:38,023 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:38,024 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-24 22:01:38,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:38,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:38,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:01:38,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:38,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash 12021, now seen corresponding path program 1 times [2023-11-24 22:01:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:38,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265719339] [2023-11-24 22:01:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:38,198 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-24 22:01:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265719339] [2023-11-24 22:01:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265719339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:38,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:38,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294334953] [2023-11-24 22:01:38,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:38,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:38,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:01:38,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-24 22:01:38,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:38,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:01:38,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:38,618 INFO L124 PetriNetUnfolderBase]: 772/1568 cut-off events. [2023-11-24 22:01:38,618 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:01:38,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1568 events. 772/1568 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11041 event pairs, 580 based on Foata normal form. 1/1417 useless extension candidates. Maximal degree in co-relation 2813. Up to 887 conditions per place. [2023-11-24 22:01:38,635 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-24 22:01:38,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-24 22:01:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 22:01:38,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:01:38,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 22:01:38,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 22:01:38,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:38,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 22:01:38,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 22:01:38,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:38,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:38,644 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-24 22:01:38,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-24 22:01:38,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:38,648 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 22:01:38,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:01:38,649 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 22:01:38,649 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 22:01:38,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-24 22:01:38,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:38,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:38,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:01:38,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:38,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash 358453275, now seen corresponding path program 1 times [2023-11-24 22:01:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:38,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467346277] [2023-11-24 22:01:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:38,765 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-24 22:01:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467346277] [2023-11-24 22:01:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467346277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925229796] [2023-11-24 22:01:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:38,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:38,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:38,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 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-24 22:01:38,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:38,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:38,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:39,159 INFO L124 PetriNetUnfolderBase]: 774/1552 cut-off events. [2023-11-24 22:01:39,159 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:01:39,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 1552 events. 774/1552 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10902 event pairs, 595 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 2802. Up to 888 conditions per place. [2023-11-24 22:01:39,175 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 22:01:39,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-24 22:01:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-24 22:01:39,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-24 22:01:39,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-24 22:01:39,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-24 22:01:39,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:39,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-24 22:01:39,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-24 22:01:39,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:39,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:39,188 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 115 transitions. [2023-11-24 22:01:39,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-24 22:01:39,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:39,194 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 22:01:39,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:01:39,196 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-24 22:01:39,196 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 22:01:39,196 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-24 22:01:39,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:39,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:39,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:01:39,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:39,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 358453276, now seen corresponding path program 1 times [2023-11-24 22:01:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074991883] [2023-11-24 22:01:39,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:39,337 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-24 22:01:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074991883] [2023-11-24 22:01:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074991883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:39,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:39,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706344875] [2023-11-24 22:01:39,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:39,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:39,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:39,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:39,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:39,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:01:39,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-24 22:01:39,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:39,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:01:39,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:39,683 INFO L124 PetriNetUnfolderBase]: 772/1562 cut-off events. [2023-11-24 22:01:39,683 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-24 22:01:39,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1562 events. 772/1562 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11045 event pairs, 438 based on Foata normal form. 3/1420 useless extension candidates. Maximal degree in co-relation 2810. Up to 883 conditions per place. [2023-11-24 22:01:39,702 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-24 22:01:39,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-24 22:01:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 22:01:39,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:01:39,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 22:01:39,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 22:01:39,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:39,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 22:01:39,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 22:01:39,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:39,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:39,709 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-24 22:01:39,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-24 22:01:39,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:39,713 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-24 22:01:39,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:01:39,716 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-24 22:01:39,716 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-24 22:01:39,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-24 22:01:39,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:39,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:39,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:01:39,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:39,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1393182645, now seen corresponding path program 1 times [2023-11-24 22:01:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113348430] [2023-11-24 22:01:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:39,913 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-24 22:01:39,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113348430] [2023-11-24 22:01:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113348430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:39,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:39,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041449754] [2023-11-24 22:01:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:39,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:39,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-24 22:01:39,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 22:01:39,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:39,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-24 22:01:39,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:40,227 INFO L124 PetriNetUnfolderBase]: 603/1165 cut-off events. [2023-11-24 22:01:40,227 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-24 22:01:40,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 1165 events. 603/1165 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7642 event pairs, 96 based on Foata normal form. 0/1147 useless extension candidates. Maximal degree in co-relation 2151. Up to 742 conditions per place. [2023-11-24 22:01:40,238 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-24 22:01:40,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 192 flow [2023-11-24 22:01:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:01:40,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2023-11-24 22:01:40,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:01:40,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:01:40,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:40,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:01:40,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-24 22:01:40,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:40,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:40,245 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:01:40,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 192 flow [2023-11-24 22:01:40,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:40,249 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-24 22:01:40,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-24 22:01:40,252 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 22:01:40,252 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-24 22:01:40,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 22:01:40,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:40,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:01:40,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:40,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1393181611, now seen corresponding path program 1 times [2023-11-24 22:01:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:40,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220334601] [2023-11-24 22:01:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:40,383 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-24 22:01:40,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220334601] [2023-11-24 22:01:40,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220334601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:40,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:40,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:40,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091187850] [2023-11-24 22:01:40,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:40,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:40,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:01:40,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 22:01:40,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:40,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:01:40,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:40,681 INFO L124 PetriNetUnfolderBase]: 528/1117 cut-off events. [2023-11-24 22:01:40,682 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-24 22:01:40,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1117 events. 528/1117 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7559 event pairs, 181 based on Foata normal form. 12/1090 useless extension candidates. Maximal degree in co-relation 2022. Up to 671 conditions per place. [2023-11-24 22:01:40,692 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 24 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-24 22:01:40,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 160 flow [2023-11-24 22:01:40,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-24 22:01:40,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 22:01:40,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-24 22:01:40,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-24 22:01:40,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:40,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-24 22:01:40,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-24 22:01:40,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:40,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:40,697 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 3 states and 114 transitions. [2023-11-24 22:01:40,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 160 flow [2023-11-24 22:01:40,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:40,700 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-24 22:01:40,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:01:40,701 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-24 22:01:40,701 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-24 22:01:40,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 22:01:40,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:40,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:40,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:01:40,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:40,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1393181610, now seen corresponding path program 1 times [2023-11-24 22:01:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:40,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721030646] [2023-11-24 22:01:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:40,753 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-24 22:01:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721030646] [2023-11-24 22:01:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721030646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:40,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911370289] [2023-11-24 22:01:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:40,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:40,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 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-24 22:01:40,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:40,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:40,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:41,003 INFO L124 PetriNetUnfolderBase]: 545/1125 cut-off events. [2023-11-24 22:01:41,004 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:01:41,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1125 events. 545/1125 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7490 event pairs, 325 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 2038. Up to 700 conditions per place. [2023-11-24 22:01:41,015 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 25 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-24 22:01:41,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 158 flow [2023-11-24 22:01:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-24 22:01:41,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2023-11-24 22:01:41,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-24 22:01:41,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-24 22:01:41,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:41,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-24 22:01:41,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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-24 22:01:41,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:41,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:41,020 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 112 transitions. [2023-11-24 22:01:41,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 158 flow [2023-11-24 22:01:41,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:41,022 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-24 22:01:41,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-24 22:01:41,024 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-24 22:01:41,024 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-24 22:01:41,024 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-24 22:01:41,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:41,025 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-24 22:01:41,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:01:41,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:41,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2020674385, now seen corresponding path program 1 times [2023-11-24 22:01:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716971201] [2023-11-24 22:01:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:41,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:41,603 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-24 22:01:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:41,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716971201] [2023-11-24 22:01:41,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716971201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:41,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:41,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:01:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720835922] [2023-11-24 22:01:41,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:41,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 22:01:41,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:41,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 22:01:41,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 22:01:41,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:41,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 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-24 22:01:41,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:41,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:41,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:42,153 INFO L124 PetriNetUnfolderBase]: 530/1050 cut-off events. [2023-11-24 22:01:42,154 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:01:42,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1050 events. 530/1050 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6944 event pairs, 282 based on Foata normal form. 36/1062 useless extension candidates. Maximal degree in co-relation 1939. Up to 671 conditions per place. [2023-11-24 22:01:42,180 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 24 selfloop transitions, 3 changer transitions 8/53 dead transitions. [2023-11-24 22:01:42,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 186 flow [2023-11-24 22:01:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:01:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:01:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2023-11-24 22:01:42,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2023-11-24 22:01:42,183 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 186 transitions. [2023-11-24 22:01:42,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 186 transitions. [2023-11-24 22:01:42,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:42,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 186 transitions. [2023-11-24 22:01:42,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 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-24 22:01:42,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:01:42,186 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:01:42,186 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 6 states and 186 transitions. [2023-11-24 22:01:42,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 186 flow [2023-11-24 22:01:42,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:42,189 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 88 flow [2023-11-24 22:01:42,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-24 22:01:42,190 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-24 22:01:42,191 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 88 flow [2023-11-24 22:01:42,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 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-24 22:01:42,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:42,191 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-24 22:01:42,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:01:42,192 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:42,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2020674866, now seen corresponding path program 1 times [2023-11-24 22:01:42,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:42,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418337270] [2023-11-24 22:01:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:42,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:42,444 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-24 22:01:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418337270] [2023-11-24 22:01:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418337270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:01:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450843540] [2023-11-24 22:01:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:42,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:01:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:01:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:01:42,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 22:01:42,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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-24 22:01:42,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:42,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 22:01:42,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:42,876 INFO L124 PetriNetUnfolderBase]: 1213/2149 cut-off events. [2023-11-24 22:01:42,877 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-24 22:01:42,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 2149 events. 1213/2149 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13567 event pairs, 147 based on Foata normal form. 80/2198 useless extension candidates. Maximal degree in co-relation 4058. Up to 1081 conditions per place. [2023-11-24 22:01:42,894 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2023-11-24 22:01:42,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 232 flow [2023-11-24 22:01:42,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:01:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:01:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-24 22:01:42,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6990740740740741 [2023-11-24 22:01:42,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-24 22:01:42,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-24 22:01:42,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:42,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-24 22:01:42,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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-24 22:01:42,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 22:01:42,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 22:01:42,900 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 4 states and 151 transitions. [2023-11-24 22:01:42,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 232 flow [2023-11-24 22:01:42,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:01:42,903 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 117 flow [2023-11-24 22:01:42,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-24 22:01:42,904 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-24 22:01:42,904 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 117 flow [2023-11-24 22:01:42,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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-24 22:01:42,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:42,905 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-24 22:01:42,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:01:42,906 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:42,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:42,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1040129738, now seen corresponding path program 1 times [2023-11-24 22:01:42,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519401764] [2023-11-24 22:01:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:43,226 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-24 22:01:43,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519401764] [2023-11-24 22:01:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519401764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:43,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:43,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:01:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261066111] [2023-11-24 22:01:43,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:43,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:01:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:01:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:01:43,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 22:01:43,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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-24 22:01:43,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:43,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 22:01:43,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:43,626 INFO L124 PetriNetUnfolderBase]: 809/1445 cut-off events. [2023-11-24 22:01:43,627 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-11-24 22:01:43,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 1445 events. 809/1445 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8107 event pairs, 73 based on Foata normal form. 68/1491 useless extension candidates. Maximal degree in co-relation 3258. Up to 521 conditions per place. [2023-11-24 22:01:43,639 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 49 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2023-11-24 22:01:43,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 322 flow [2023-11-24 22:01:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:01:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:01:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-24 22:01:43,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 22:01:43,642 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-24 22:01:43,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-24 22:01:43,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:43,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-24 22:01:43,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 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-24 22:01:43,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:01:43,645 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:01:43,645 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 117 flow. Second operand 5 states and 190 transitions. [2023-11-24 22:01:43,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 322 flow [2023-11-24 22:01:43,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:43,649 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 157 flow [2023-11-24 22:01:43,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-11-24 22:01:43,650 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 22:01:43,650 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 157 flow [2023-11-24 22:01:43,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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-24 22:01:43,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:43,651 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-24 22:01:43,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:01:43,651 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:43,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1305782571, now seen corresponding path program 1 times [2023-11-24 22:01:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:43,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388547352] [2023-11-24 22:01:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:43,993 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-24 22:01:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388547352] [2023-11-24 22:01:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388547352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:01:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502936711] [2023-11-24 22:01:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:43,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:01:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:43,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:01:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:01:44,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 22:01:44,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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-24 22:01:44,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:44,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 22:01:44,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:44,266 INFO L124 PetriNetUnfolderBase]: 477/829 cut-off events. [2023-11-24 22:01:44,266 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2023-11-24 22:01:44,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 829 events. 477/829 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3822 event pairs, 59 based on Foata normal form. 36/843 useless extension candidates. Maximal degree in co-relation 2146. Up to 268 conditions per place. [2023-11-24 22:01:44,275 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2023-11-24 22:01:44,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 333 flow [2023-11-24 22:01:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:01:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:01:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2023-11-24 22:01:44,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2023-11-24 22:01:44,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 213 transitions. [2023-11-24 22:01:44,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 213 transitions. [2023-11-24 22:01:44,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:44,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 213 transitions. [2023-11-24 22:01:44,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 0 states have call successors, (0), 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-24 22:01:44,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:01:44,280 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:01:44,281 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 157 flow. Second operand 6 states and 213 transitions. [2023-11-24 22:01:44,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 333 flow [2023-11-24 22:01:44,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-24 22:01:44,287 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 171 flow [2023-11-24 22:01:44,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-11-24 22:01:44,288 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2023-11-24 22:01:44,288 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 171 flow [2023-11-24 22:01:44,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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-24 22:01:44,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:44,288 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, 1] [2023-11-24 22:01:44,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:01:44,289 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:44,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1592353612, now seen corresponding path program 1 times [2023-11-24 22:01:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170862373] [2023-11-24 22:01:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:44,657 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-24 22:01:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:44,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170862373] [2023-11-24 22:01:44,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170862373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:44,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:44,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:01:44,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518457920] [2023-11-24 22:01:44,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:44,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:01:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:44,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:01:44,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:01:44,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:44,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 22:01:44,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:44,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:44,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:44,944 INFO L124 PetriNetUnfolderBase]: 593/1157 cut-off events. [2023-11-24 22:01:44,944 INFO L125 PetriNetUnfolderBase]: For 428/446 co-relation queries the response was YES. [2023-11-24 22:01:44,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1157 events. 593/1157 cut-off events. For 428/446 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6387 event pairs, 275 based on Foata normal form. 8/1095 useless extension candidates. Maximal degree in co-relation 2551. Up to 528 conditions per place. [2023-11-24 22:01:44,951 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 25 selfloop transitions, 2 changer transitions 13/63 dead transitions. [2023-11-24 22:01:44,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 297 flow [2023-11-24 22:01:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:01:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:01:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-24 22:01:44,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2023-11-24 22:01:44,953 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-24 22:01:44,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-24 22:01:44,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:44,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-24 22:01:44,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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-24 22:01:44,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:01:44,956 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:01:44,956 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 171 flow. Second operand 5 states and 176 transitions. [2023-11-24 22:01:44,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 297 flow [2023-11-24 22:01:44,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 233 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-24 22:01:44,962 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 127 flow [2023-11-24 22:01:44,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=5, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-11-24 22:01:44,963 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2023-11-24 22:01:44,963 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 127 flow [2023-11-24 22:01:44,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 22:01:44,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:44,964 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, 1] [2023-11-24 22:01:44,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:01:44,964 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:44,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1389446916, now seen corresponding path program 2 times [2023-11-24 22:01:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:44,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375772489] [2023-11-24 22:01:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:44,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:45,915 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-24 22:01:45,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:45,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375772489] [2023-11-24 22:01:45,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375772489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:45,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 22:01:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079745184] [2023-11-24 22:01:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 22:01:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 22:01:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:01:45,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:45,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 127 flow. Second operand has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 0 states have call successors, (0), 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-24 22:01:45,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:45,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:45,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:46,453 INFO L124 PetriNetUnfolderBase]: 541/1054 cut-off events. [2023-11-24 22:01:46,453 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-24 22:01:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2148 conditions, 1054 events. 541/1054 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5443 event pairs, 93 based on Foata normal form. 8/1031 useless extension candidates. Maximal degree in co-relation 2134. Up to 227 conditions per place. [2023-11-24 22:01:46,459 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 34 selfloop transitions, 13 changer transitions 28/96 dead transitions. [2023-11-24 22:01:46,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 409 flow [2023-11-24 22:01:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 22:01:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 22:01:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 326 transitions. [2023-11-24 22:01:46,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6037037037037037 [2023-11-24 22:01:46,461 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 326 transitions. [2023-11-24 22:01:46,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 326 transitions. [2023-11-24 22:01:46,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:46,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 326 transitions. [2023-11-24 22:01:46,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 0 states have call successors, (0), 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-24 22:01:46,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:46,465 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:46,466 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 127 flow. Second operand 10 states and 326 transitions. [2023-11-24 22:01:46,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 409 flow [2023-11-24 22:01:46,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 383 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-24 22:01:46,469 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 194 flow [2023-11-24 22:01:46,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-11-24 22:01:46,470 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2023-11-24 22:01:46,471 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 194 flow [2023-11-24 22:01:46,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 0 states have call successors, (0), 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-24 22:01:46,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:46,471 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, 1] [2023-11-24 22:01:46,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 22:01:46,472 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:46,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash -415108568, now seen corresponding path program 3 times [2023-11-24 22:01:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:46,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270650367] [2023-11-24 22:01:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:46,780 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-24 22:01:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:46,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270650367] [2023-11-24 22:01:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270650367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:46,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:46,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:01:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107469433] [2023-11-24 22:01:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:46,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:01:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:01:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:01:46,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:46,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 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-24 22:01:46,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:46,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:46,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:47,094 INFO L124 PetriNetUnfolderBase]: 474/993 cut-off events. [2023-11-24 22:01:47,094 INFO L125 PetriNetUnfolderBase]: For 396/410 co-relation queries the response was YES. [2023-11-24 22:01:47,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 993 events. 474/993 cut-off events. For 396/410 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5265 event pairs, 104 based on Foata normal form. 20/981 useless extension candidates. Maximal degree in co-relation 2288. Up to 386 conditions per place. [2023-11-24 22:01:47,100 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 24 selfloop transitions, 5 changer transitions 25/75 dead transitions. [2023-11-24 22:01:47,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 377 flow [2023-11-24 22:01:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:01:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:01:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2023-11-24 22:01:47,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2023-11-24 22:01:47,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 201 transitions. [2023-11-24 22:01:47,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 201 transitions. [2023-11-24 22:01:47,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:47,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 201 transitions. [2023-11-24 22:01:47,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 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-24 22:01:47,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:01:47,105 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:01:47,105 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 194 flow. Second operand 6 states and 201 transitions. [2023-11-24 22:01:47,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 377 flow [2023-11-24 22:01:47,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 357 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-24 22:01:47,110 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 162 flow [2023-11-24 22:01:47,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2023-11-24 22:01:47,112 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2023-11-24 22:01:47,112 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 162 flow [2023-11-24 22:01:47,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 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-24 22:01:47,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:47,113 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, 1] [2023-11-24 22:01:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 22:01:47,113 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:47,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash 373727088, now seen corresponding path program 4 times [2023-11-24 22:01:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562332796] [2023-11-24 22:01:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:01:47,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:01:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:01:47,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 22:01:47,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:01:47,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 22:01:47,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 22:01:47,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 22:01:47,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 22:01:47,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 22:01:47,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 22:01:47,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 22:01:47,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 22:01:47,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 22:01:47,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 22:01:47,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 22:01:47,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 22:01:47,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 22:01:47,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 22:01:47,300 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:47,308 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:01:47,309 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:01:47,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:01:47,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:01:47,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 22:01:47,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:01:47,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:01:47,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:01:47 BasicIcfg [2023-11-24 22:01:47,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:01:47,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:01:47,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:01:47,445 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:01:47,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:36" (3/4) ... [2023-11-24 22:01:47,447 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:01:47,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:01:47,449 INFO L158 Benchmark]: Toolchain (without parser) took 13002.18ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 123.8MB in the beginning and 86.1MB in the end (delta: 37.7MB). Peak memory consumption was 155.1MB. Max. memory is 16.1GB. [2023-11-24 22:01:47,449 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:01:47,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 832.80ms. Allocated memory is still 155.2MB. Free memory was 123.3MB in the beginning and 100.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 22:01:47,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.73ms. Allocated memory is still 155.2MB. Free memory was 100.1MB in the beginning and 97.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:01:47,450 INFO L158 Benchmark]: Boogie Preprocessor took 63.48ms. Allocated memory is still 155.2MB. Free memory was 97.6MB 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-24 22:01:47,451 INFO L158 Benchmark]: RCFGBuilder took 1144.20ms. Allocated memory is still 155.2MB. Free memory was 93.9MB in the beginning and 104.1MB in the end (delta: -10.2MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2023-11-24 22:01:47,451 INFO L158 Benchmark]: TraceAbstraction took 10885.34ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 104.1MB in the beginning and 86.1MB in the end (delta: 18.0MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2023-11-24 22:01:47,451 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 270.5MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:01:47,453 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.34ms. Allocated memory is still 125.8MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 832.80ms. Allocated memory is still 155.2MB. Free memory was 123.3MB in the beginning and 100.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.73ms. Allocated memory is still 155.2MB. Free memory was 100.1MB in the beginning and 97.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.48ms. Allocated memory is still 155.2MB. Free memory was 97.6MB 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 1144.20ms. Allocated memory is still 155.2MB. Free memory was 93.9MB in the beginning and 104.1MB in the end (delta: -10.2MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10885.34ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 104.1MB in the beginning and 86.1MB in the end (delta: 18.0MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 270.5MB. Free memory is still 86.1MB. 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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L18] 0 __assert_fail ("0", "safe031_power.oepc_pso.oepc_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 834]: 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: 832]: 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, 79 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: 10.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 511 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1361 IncrementalHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 44 mSDtfsCounter, 1361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=13, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 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-24 22:01:47,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI --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 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:01:50,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:01:50,759 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 22:01:50,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:01:50,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:01:50,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:01:50,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:01:50,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:01:50,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:01:50,836 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:01:50,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:01:50,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:01:50,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:01:50,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:01:50,842 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:01:50,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:01:50,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:01:50,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:01:50,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:01:50,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:01:50,846 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:01:50,847 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:01:50,848 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:01:50,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:01:50,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:01:50,850 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 22:01:50,850 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 22:01:50,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:01:50,852 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:01:50,852 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:01:50,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:01:50,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:01:50,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:01:50,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:01:50,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:01:50,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:01:50,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:01:50,859 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 22:01:50,859 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 22:01:50,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:01:50,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:01:50,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:01:50,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:01:50,861 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 22:01:50,861 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_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/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_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI 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 -> 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 [2023-11-24 22:01:51,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:01:51,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:01:51,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:01:51,429 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:01:51,430 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:01:51,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:01:55,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:01:55,633 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:01:55,633 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:01:55,653 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data/9ffb61b6d/317ecf0c6eab403b9ec2b5b33517e33a/FLAGa73d0f30b [2023-11-24 22:01:55,671 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/data/9ffb61b6d/317ecf0c6eab403b9ec2b5b33517e33a [2023-11-24 22:01:55,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:01:55,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:01:55,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:55,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:01:55,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:01:55,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:55" (1/1) ... [2023-11-24 22:01:55,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51dc180c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:55, skipping insertion in model container [2023-11-24 22:01:55,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:55" (1/1) ... [2023-11-24 22:01:55,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:01:56,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:56,261 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:01:56,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:56,404 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:56,404 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:56,413 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:01:56,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56 WrapperNode [2023-11-24 22:01:56,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:56,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:56,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:01:56,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:01:56,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,526 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-24 22:01:56,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:56,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:01:56,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:01:56,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:01:56,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,595 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-24 22:01:56,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:01:56,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:01:56,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:01:56,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:01:56,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (1/1) ... [2023-11-24 22:01:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:01:56,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:01:56,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:01:56,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:01:56,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:01:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:01:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:01:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:01:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 22:01:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 22:01:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 22:01:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-24 22:01:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 22:01:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 22:01:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 22:01:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-24 22:01:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:01:56,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:01:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:01:56,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:01:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 22:01:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 22:01:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:01:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:01:56,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:01:56,779 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:01:57,065 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:01:57,068 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:01:57,581 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:01:57,999 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:01:57,999 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:01:58,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:58 BoogieIcfgContainer [2023-11-24 22:01:58,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:01:58,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:01:58,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:01:58,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:01:58,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:01:55" (1/3) ... [2023-11-24 22:01:58,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a4c99a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:58, skipping insertion in model container [2023-11-24 22:01:58,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:56" (2/3) ... [2023-11-24 22:01:58,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a4c99a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:58, skipping insertion in model container [2023-11-24 22:01:58,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:58" (3/3) ... [2023-11-24 22:01:58,016 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:01:58,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:01:58,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 22:01:58,043 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:01:58,118 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:01:58,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:58,228 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-24 22:01:58,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:58,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-24 22:01:58,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:58,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-24 22:01:58,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:01:58,265 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;@15db9b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:01:58,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 22:01:58,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:01:58,270 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:01:58,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:58,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:58,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:58,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:58,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash 12084, now seen corresponding path program 1 times [2023-11-24 22:01:58,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:58,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554396412] [2023-11-24 22:01:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:58,297 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-24 22:01:58,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:58,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:01:58,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:01:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:58,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:01:58,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:58,601 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-24 22:01:58,623 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-24 22:01:58,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:58,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554396412] [2023-11-24 22:01:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554396412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:58,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652430248] [2023-11-24 22:01:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:58,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:58,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:58,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 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-24 22:01:58,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:58,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:58,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:59,426 INFO L124 PetriNetUnfolderBase]: 772/1569 cut-off events. [2023-11-24 22:01:59,427 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:01:59,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 1569 events. 772/1569 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11084 event pairs, 580 based on Foata normal form. 90/1507 useless extension candidates. Maximal degree in co-relation 2768. Up to 888 conditions per place. [2023-11-24 22:01:59,457 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 22:01:59,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 179 flow [2023-11-24 22:01:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 22:01:59,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:01:59,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 22:01:59,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 22:01:59,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:59,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 22:01:59,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 22:01:59,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:59,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:01:59,497 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 117 transitions. [2023-11-24 22:01:59,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 179 flow [2023-11-24 22:01:59,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:01:59,514 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:59,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-24 22:01:59,521 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 22:01:59,521 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:59,522 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-24 22:01:59,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:59,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:59,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:01:59,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:01:59,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:59,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:59,727 INFO L85 PathProgramCache]: Analyzing trace with hash 12085, now seen corresponding path program 1 times [2023-11-24 22:01:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:59,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361405590] [2023-11-24 22:01:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:59,729 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-24 22:01:59,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:59,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:01:59,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:01:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:59,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:01:59,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:59,859 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-24 22:01:59,872 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-24 22:01:59,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:59,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:59,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361405590] [2023-11-24 22:01:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361405590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:59,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604061003] [2023-11-24 22:01:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:59,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:59,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:59,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:59,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:01:59,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-24 22:01:59,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:59,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:01:59,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:00,351 INFO L124 PetriNetUnfolderBase]: 772/1568 cut-off events. [2023-11-24 22:02:00,352 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:02:00,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1568 events. 772/1568 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11041 event pairs, 580 based on Foata normal form. 1/1417 useless extension candidates. Maximal degree in co-relation 2813. Up to 887 conditions per place. [2023-11-24 22:02:00,369 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-24 22:02:00,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-24 22:02:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:02:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:02:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 22:02:00,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:02:00,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 22:02:00,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 22:02:00,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:00,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 22:02:00,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 22:02:00,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:00,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:00,377 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-24 22:02:00,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-24 22:02:00,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:00,381 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 22:02:00,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:02:00,382 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 22:02:00,383 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 22:02:00,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-24 22:02:00,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:00,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:02:00,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:00,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:00,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:00,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash 360361885, now seen corresponding path program 1 times [2023-11-24 22:02:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:00,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538284470] [2023-11-24 22:02:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:00,588 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-24 22:02:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:00,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:00,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:00,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:02:00,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:00,716 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-24 22:02:00,722 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-24 22:02:00,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:00,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538284470] [2023-11-24 22:02:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538284470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:00,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:02:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954101825] [2023-11-24 22:02:00,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:00,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:02:00,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:02:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:02:00,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:02:00,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 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-24 22:02:00,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:00,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:02:00,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:01,114 INFO L124 PetriNetUnfolderBase]: 774/1567 cut-off events. [2023-11-24 22:02:01,115 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:02:01,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 1567 events. 774/1567 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11084 event pairs, 438 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2817. Up to 888 conditions per place. [2023-11-24 22:02:01,131 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 22:02:01,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-24 22:02:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:02:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:02:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-24 22:02:01,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-24 22:02:01,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-24 22:02:01,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-24 22:02:01,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:01,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-24 22:02:01,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-24 22:02:01,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:01,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:01,163 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 115 transitions. [2023-11-24 22:02:01,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-24 22:02:01,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:01,170 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 22:02:01,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:02:01,172 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-24 22:02:01,173 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 22:02:01,173 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-24 22:02:01,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:01,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:02:01,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:01,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:01,376 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:01,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 360361886, now seen corresponding path program 1 times [2023-11-24 22:02:01,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:01,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10576493] [2023-11-24 22:02:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:01,379 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-24 22:02:01,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:01,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:01,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:01,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:02:01,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:01,514 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-24 22:02:01,528 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-24 22:02:01,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:01,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10576493] [2023-11-24 22:02:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10576493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:01,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:01,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:02:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287901622] [2023-11-24 22:02:01,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:01,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:02:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:02:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:02:01,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:02:01,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-24 22:02:01,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:01,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:02:01,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:01,897 INFO L124 PetriNetUnfolderBase]: 772/1547 cut-off events. [2023-11-24 22:02:01,898 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-24 22:02:01,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 1547 events. 772/1547 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10902 event pairs, 593 based on Foata normal form. 3/1405 useless extension candidates. Maximal degree in co-relation 2795. Up to 883 conditions per place. [2023-11-24 22:02:01,913 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-24 22:02:01,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-24 22:02:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:02:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:02:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 22:02:01,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:02:01,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 22:02:01,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 22:02:01,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:01,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 22:02:01,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 22:02:01,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:01,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:01,930 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-24 22:02:01,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-24 22:02:01,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:01,934 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-24 22:02:01,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:02:01,937 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-24 22:02:01,937 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-24 22:02:01,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-24 22:02:01,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:01,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:02:01,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:02,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:02,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:02,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1876957003, now seen corresponding path program 1 times [2023-11-24 22:02:02,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:02,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674162491] [2023-11-24 22:02:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:02,143 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-24 22:02:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:02,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:02,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:02,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:02:02,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:02,282 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-24 22:02:02,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:02,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674162491] [2023-11-24 22:02:02,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674162491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:02,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:02,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:02:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109930557] [2023-11-24 22:02:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:02,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:02:02,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:02,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:02:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:02:02,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-24 22:02:02,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 22:02:02,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:02,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-24 22:02:02,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:02,536 INFO L124 PetriNetUnfolderBase]: 603/1141 cut-off events. [2023-11-24 22:02:02,536 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-24 22:02:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 1141 events. 603/1141 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7023 event pairs, 192 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 2127. Up to 742 conditions per place. [2023-11-24 22:02:02,546 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-24 22:02:02,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 192 flow [2023-11-24 22:02:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:02:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:02:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:02:02,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2023-11-24 22:02:02,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:02:02,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:02:02,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:02,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:02:02,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-24 22:02:02,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:02,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:02,554 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:02:02,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 192 flow [2023-11-24 22:02:02,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:02,558 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-24 22:02:02,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-24 22:02:02,562 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 22:02:02,562 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-24 22:02:02,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 22:02:02,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:02,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:02:02,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:02,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:02,766 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:02,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:02,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1876958038, now seen corresponding path program 1 times [2023-11-24 22:02:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:02,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400692287] [2023-11-24 22:02:02,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:02,768 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-24 22:02:02,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:02,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:02,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:02,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:02:02,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:02,911 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-24 22:02:02,919 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-24 22:02:02,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:02,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400692287] [2023-11-24 22:02:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400692287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:02,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:02,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:02:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234644260] [2023-11-24 22:02:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:02,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:02:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:02,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:02:02,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:02:02,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:02:02,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 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-24 22:02:02,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:02,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:02:02,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:03,244 INFO L124 PetriNetUnfolderBase]: 545/1134 cut-off events. [2023-11-24 22:02:03,244 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-24 22:02:03,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 1134 events. 545/1134 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7608 event pairs, 181 based on Foata normal form. 0/1107 useless extension candidates. Maximal degree in co-relation 2071. Up to 700 conditions per place. [2023-11-24 22:02:03,258 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 25 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-24 22:02:03,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 162 flow [2023-11-24 22:02:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:02:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:02:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-24 22:02:03,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2023-11-24 22:02:03,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-24 22:02:03,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-24 22:02:03,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:03,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-24 22:02:03,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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-24 22:02:03,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:03,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:03,282 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 3 states and 112 transitions. [2023-11-24 22:02:03,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 162 flow [2023-11-24 22:02:03,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:03,285 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-24 22:02:03,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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-24 22:02:03,286 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-24 22:02:03,286 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-24 22:02:03,287 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-24 22:02:03,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:03,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:02:03,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:03,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:03,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:03,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1876958037, now seen corresponding path program 1 times [2023-11-24 22:02:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128375691] [2023-11-24 22:02:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:03,492 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-24 22:02:03,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:03,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:03,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:03,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:02:03,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:03,635 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-24 22:02:03,650 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-24 22:02:03,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:03,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128375691] [2023-11-24 22:02:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128375691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:02:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173046350] [2023-11-24 22:02:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:03,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:02:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:03,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:02:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:02:03,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:02:03,697 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.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 22:02:03,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:03,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:02:03,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:04,000 INFO L124 PetriNetUnfolderBase]: 528/1105 cut-off events. [2023-11-24 22:02:04,000 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:02:04,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 1105 events. 528/1105 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7426 event pairs, 181 based on Foata normal form. 12/1090 useless extension candidates. Maximal degree in co-relation 1989. Up to 671 conditions per place. [2023-11-24 22:02:04,014 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 24 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-24 22:02:04,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 156 flow [2023-11-24 22:02:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:02:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:02:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-24 22:02:04,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 22:02:04,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-24 22:02:04,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-24 22:02:04,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:04,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-24 22:02:04,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-24 22:02:04,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:04,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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-24 22:02:04,021 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 114 transitions. [2023-11-24 22:02:04,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 156 flow [2023-11-24 22:02:04,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:04,024 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-24 22:02:04,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-24 22:02:04,025 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-24 22:02:04,026 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-24 22:02:04,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 22:02:04,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:04,026 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-24 22:02:04,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:04,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:04,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:04,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1359001327, now seen corresponding path program 1 times [2023-11-24 22:02:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:04,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984269878] [2023-11-24 22:02:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:04,232 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-24 22:02:04,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:04,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:04,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:04,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:02:04,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:04,468 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-24 22:02:04,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:04,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:04,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984269878] [2023-11-24 22:02:04,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984269878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:04,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:04,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:02:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610504445] [2023-11-24 22:02:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:04,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:02:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:04,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:02:04,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:02:04,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 22:02:04,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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-24 22:02:04,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:04,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 22:02:04,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:05,018 INFO L124 PetriNetUnfolderBase]: 1361/2433 cut-off events. [2023-11-24 22:02:05,018 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-24 22:02:05,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 2433 events. 1361/2433 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15818 event pairs, 147 based on Foata normal form. 80/2484 useless extension candidates. Maximal degree in co-relation 4622. Up to 1297 conditions per place. [2023-11-24 22:02:05,042 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2023-11-24 22:02:05,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 234 flow [2023-11-24 22:02:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:02:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:02:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2023-11-24 22:02:05,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 22:02:05,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 152 transitions. [2023-11-24 22:02:05,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 152 transitions. [2023-11-24 22:02:05,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:05,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 152 transitions. [2023-11-24 22:02:05,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.0) internal successors, (152), 4 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-24 22:02:05,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 22:02:05,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 22:02:05,048 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 4 states and 152 transitions. [2023-11-24 22:02:05,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 234 flow [2023-11-24 22:02:05,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:05,052 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2023-11-24 22:02:05,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, 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=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 22:02:05,054 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 22:02:05,054 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2023-11-24 22:02:05,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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-24 22:02:05,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:05,055 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-24 22:02:05,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:05,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:05,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:05,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1330927527, now seen corresponding path program 1 times [2023-11-24 22:02:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926151540] [2023-11-24 22:02:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:05,261 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-24 22:02:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:05,262 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:05,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:05,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:02:05,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:05,518 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-24 22:02:05,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:05,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:05,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926151540] [2023-11-24 22:02:05,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926151540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:05,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:05,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:02:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116889694] [2023-11-24 22:02:05,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:05,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:02:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:05,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:02:05,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:02:05,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 22:02:05,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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-24 22:02:05,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:05,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 22:02:05,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:05,970 INFO L124 PetriNetUnfolderBase]: 877/1585 cut-off events. [2023-11-24 22:02:05,970 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2023-11-24 22:02:05,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 1585 events. 877/1585 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9088 event pairs, 73 based on Foata normal form. 68/1631 useless extension candidates. Maximal degree in co-relation 3494. Up to 625 conditions per place. [2023-11-24 22:02:05,986 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 50 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2023-11-24 22:02:05,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 325 flow [2023-11-24 22:02:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:02:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:02:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2023-11-24 22:02:05,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7074074074074074 [2023-11-24 22:02:05,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2023-11-24 22:02:05,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2023-11-24 22:02:05,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:05,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2023-11-24 22:02:05,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 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-24 22:02:05,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:02:05,992 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:02:05,993 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 120 flow. Second operand 5 states and 191 transitions. [2023-11-24 22:02:05,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 325 flow [2023-11-24 22:02:05,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 22:02:05,997 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 160 flow [2023-11-24 22:02:05,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-24 22:02:05,998 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 22:02:05,999 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 160 flow [2023-11-24 22:02:05,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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-24 22:02:05,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:05,999 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-24 22:02:06,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:06,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:06,212 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:06,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -114250698, now seen corresponding path program 1 times [2023-11-24 22:02:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61008138] [2023-11-24 22:02:06,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:06,214 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-24 22:02:06,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:06,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:06,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:06,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:02:06,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:06,500 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-24 22:02:06,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:06,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61008138] [2023-11-24 22:02:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61008138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:02:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166679995] [2023-11-24 22:02:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:02:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:02:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:02:06,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 22:02:06,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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-24 22:02:06,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:06,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 22:02:06,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:06,904 INFO L124 PetriNetUnfolderBase]: 489/857 cut-off events. [2023-11-24 22:02:06,904 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2023-11-24 22:02:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 857 events. 489/857 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3935 event pairs, 59 based on Foata normal form. 36/871 useless extension candidates. Maximal degree in co-relation 2174. Up to 268 conditions per place. [2023-11-24 22:02:06,913 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 44 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2023-11-24 22:02:06,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 336 flow [2023-11-24 22:02:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:02:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:02:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2023-11-24 22:02:06,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2023-11-24 22:02:06,916 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 214 transitions. [2023-11-24 22:02:06,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 214 transitions. [2023-11-24 22:02:06,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:06,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 214 transitions. [2023-11-24 22:02:06,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 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-24 22:02:06,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:02:06,919 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:02:06,919 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 160 flow. Second operand 6 states and 214 transitions. [2023-11-24 22:02:06,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 336 flow [2023-11-24 22:02:06,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 311 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-24 22:02:06,926 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 174 flow [2023-11-24 22:02:06,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-11-24 22:02:06,927 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2023-11-24 22:02:06,927 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 174 flow [2023-11-24 22:02:06,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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-24 22:02:06,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:06,928 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, 1] [2023-11-24 22:02:06,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:07,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:07,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:07,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:07,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1780071015, now seen corresponding path program 1 times [2023-11-24 22:02:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:07,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30897120] [2023-11-24 22:02:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:07,134 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-24 22:02:07,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:07,135 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:07,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:07,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-24 22:02:07,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:08,070 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2513~0#1.base_59| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2514~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2515~0#1.base_47| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2513~0#1.base_59| (_ bv1 1)))) (and (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2513~0#1.base_59| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2514~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2515~0#1.base_47| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2513~0#1.base_59|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t2514~0#1.base_55|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t2514~0#1.base_55| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2515~0#1.base_47|))))) is different from true [2023-11-24 22:02:08,072 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-24 22:02:08,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:08,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30897120] [2023-11-24 22:02:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30897120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:08,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:02:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307183549] [2023-11-24 22:02:08,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:08,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:02:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:08,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:02:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-24 22:02:08,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2023-11-24 22:02:08,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 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-24 22:02:08,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:08,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2023-11-24 22:02:08,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:08,551 INFO L124 PetriNetUnfolderBase]: 278/590 cut-off events. [2023-11-24 22:02:08,551 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2023-11-24 22:02:08,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 590 events. 278/590 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2964 event pairs, 59 based on Foata normal form. 8/555 useless extension candidates. Maximal degree in co-relation 1244. Up to 383 conditions per place. [2023-11-24 22:02:08,557 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 29 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-11-24 22:02:08,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 272 flow [2023-11-24 22:02:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:02:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:02:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2023-11-24 22:02:08,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2023-11-24 22:02:08,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 157 transitions. [2023-11-24 22:02:08,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 157 transitions. [2023-11-24 22:02:08,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:08,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 157 transitions. [2023-11-24 22:02:08,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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-24 22:02:08,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:02:08,564 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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-24 22:02:08,564 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 174 flow. Second operand 6 states and 157 transitions. [2023-11-24 22:02:08,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 272 flow [2023-11-24 22:02:08,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 216 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-24 22:02:08,568 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 150 flow [2023-11-24 22:02:08,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-24 22:02:08,569 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2023-11-24 22:02:08,570 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 150 flow [2023-11-24 22:02:08,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 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-24 22:02:08,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:08,570 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, 1] [2023-11-24 22:02:08,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:08,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:08,774 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:08,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash 482156640, now seen corresponding path program 1 times [2023-11-24 22:02:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765075052] [2023-11-24 22:02:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:02:08,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-24 22:02:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:08,778 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:08,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:02:08,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:02:08,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:09,049 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-24 22:02:09,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:09,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765075052] [2023-11-24 22:02:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765075052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:02:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804246301] [2023-11-24 22:02:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:09,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:02:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:02:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:02:09,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:02:09,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 22:02:09,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:09,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:02:09,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:09,485 INFO L124 PetriNetUnfolderBase]: 639/1247 cut-off events. [2023-11-24 22:02:09,486 INFO L125 PetriNetUnfolderBase]: For 386/411 co-relation queries the response was YES. [2023-11-24 22:02:09,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1247 events. 639/1247 cut-off events. For 386/411 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6863 event pairs, 285 based on Foata normal form. 8/1185 useless extension candidates. Maximal degree in co-relation 2863. Up to 566 conditions per place. [2023-11-24 22:02:09,497 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2023-11-24 22:02:09,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 322 flow [2023-11-24 22:02:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:02:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:02:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2023-11-24 22:02:09,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2023-11-24 22:02:09,500 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 178 transitions. [2023-11-24 22:02:09,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 178 transitions. [2023-11-24 22:02:09,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:09,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 178 transitions. [2023-11-24 22:02:09,502 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-24 22:02:09,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:02:09,506 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:02:09,506 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 150 flow. Second operand 5 states and 178 transitions. [2023-11-24 22:02:09,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 322 flow [2023-11-24 22:02:09,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 22:02:09,511 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 178 flow [2023-11-24 22:02:09,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-11-24 22:02:09,513 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2023-11-24 22:02:09,513 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 178 flow [2023-11-24 22:02:09,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 22:02:09,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:09,515 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, 1] [2023-11-24 22:02:09,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:09,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:09,719 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:09,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1411855162, now seen corresponding path program 2 times [2023-11-24 22:02:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:09,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824902362] [2023-11-24 22:02:09,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 22:02:09,720 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-24 22:02:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:09,721 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:09,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:09,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 22:02:09,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 22:02:09,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-24 22:02:09,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:10,536 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-24 22:02:10,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:10,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824902362] [2023-11-24 22:02:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824902362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:10,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 22:02:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990363540] [2023-11-24 22:02:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:10,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 22:02:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 22:02:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:02:10,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:02:10,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 178 flow. Second operand has 9 states, 9 states have (on average 30.77777777777778) internal successors, (277), 9 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:02:10,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:10,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:02:10,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:11,200 INFO L124 PetriNetUnfolderBase]: 806/1575 cut-off events. [2023-11-24 22:02:11,200 INFO L125 PetriNetUnfolderBase]: For 601/667 co-relation queries the response was YES. [2023-11-24 22:02:11,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 1575 events. 806/1575 cut-off events. For 601/667 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9183 event pairs, 188 based on Foata normal form. 8/1498 useless extension candidates. Maximal degree in co-relation 3885. Up to 667 conditions per place. [2023-11-24 22:02:11,231 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 56 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2023-11-24 22:02:11,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 466 flow [2023-11-24 22:02:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 22:02:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 22:02:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 318 transitions. [2023-11-24 22:02:11,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2023-11-24 22:02:11,233 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 318 transitions. [2023-11-24 22:02:11,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 318 transitions. [2023-11-24 22:02:11,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:11,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 318 transitions. [2023-11-24 22:02:11,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.333333333333336) internal successors, (318), 9 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-24 22:02:11,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:02:11,237 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:02:11,238 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 178 flow. Second operand 9 states and 318 transitions. [2023-11-24 22:02:11,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 466 flow [2023-11-24 22:02:11,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:02:11,243 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 270 flow [2023-11-24 22:02:11,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-11-24 22:02:11,244 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2023-11-24 22:02:11,245 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 270 flow [2023-11-24 22:02:11,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.77777777777778) internal successors, (277), 9 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:02:11,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:11,245 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, 1] [2023-11-24 22:02:11,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:11,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:11,449 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:11,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash -219809456, now seen corresponding path program 3 times [2023-11-24 22:02:11,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421434221] [2023-11-24 22:02:11,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 22:02:11,450 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-24 22:02:11,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:11,451 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:11,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:11,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 22:02:11,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 22:02:11,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:02:11,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:02:11,649 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-24 22:02:11,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:02:11,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:02:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421434221] [2023-11-24 22:02:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421434221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:02:11,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:02:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:02:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932890306] [2023-11-24 22:02:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:02:11,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:02:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:02:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:02:11,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:02:11,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:02:11,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 22:02:11,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:02:11,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:02:11,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:02:12,303 INFO L124 PetriNetUnfolderBase]: 1579/3016 cut-off events. [2023-11-24 22:02:12,303 INFO L125 PetriNetUnfolderBase]: For 2196/2325 co-relation queries the response was YES. [2023-11-24 22:02:12,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8263 conditions, 3016 events. 1579/3016 cut-off events. For 2196/2325 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20231 event pairs, 716 based on Foata normal form. 9/2809 useless extension candidates. Maximal degree in co-relation 8243. Up to 1315 conditions per place. [2023-11-24 22:02:12,328 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 57 selfloop transitions, 14 changer transitions 0/96 dead transitions. [2023-11-24 22:02:12,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 602 flow [2023-11-24 22:02:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:02:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:02:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2023-11-24 22:02:12,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2023-11-24 22:02:12,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 179 transitions. [2023-11-24 22:02:12,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 179 transitions. [2023-11-24 22:02:12,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:02:12,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 179 transitions. [2023-11-24 22:02:12,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 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-24 22:02:12,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:02:12,334 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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-24 22:02:12,334 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 270 flow. Second operand 5 states and 179 transitions. [2023-11-24 22:02:12,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 602 flow [2023-11-24 22:02:12,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 96 transitions, 594 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:02:12,352 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 452 flow [2023-11-24 22:02:12,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-11-24 22:02:12,353 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2023-11-24 22:02:12,353 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 452 flow [2023-11-24 22:02:12,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 22:02:12,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:02:12,354 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, 1] [2023-11-24 22:02:12,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:12,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:12,558 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:02:12,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:02:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2001031414, now seen corresponding path program 4 times [2023-11-24 22:02:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:02:12,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103059423] [2023-11-24 22:02:12,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 22:02:12,559 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-24 22:02:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:02:12,560 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:12,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-24 22:02:12,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 22:02:12,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 22:02:12,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:02:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:02:13,000 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 22:02:13,001 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:02:13,002 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 22:02:13,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 22:02:13,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 22:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 22:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 22:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 22:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 22:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 22:02:13,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 22:02:13,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 22:02:13,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 22:02:13,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 22:02:13,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 22:02:13,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-24 22:02:13,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 22:02:13,214 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:02:13,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:02:13,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:02:13,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:02:13,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:02:13,329 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 22:02:13,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:02:13,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:02:13,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:02:13 BasicIcfg [2023-11-24 22:02:13,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:02:13,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:02:13,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:02:13,382 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:02:13,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:58" (3/4) ... [2023-11-24 22:02:13,385 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:02:13,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:02:13,387 INFO L158 Benchmark]: Toolchain (without parser) took 17711.02ms. Allocated memory was 73.4MB in the beginning and 188.7MB in the end (delta: 115.3MB). Free memory was 48.0MB in the beginning and 50.5MB in the end (delta: -2.5MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2023-11-24 22:02:13,388 INFO L158 Benchmark]: CDTParser took 1.62ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 99.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:02:13,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.55ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 47.7MB in the beginning and 60.0MB in the end (delta: -12.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-11-24 22:02:13,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.43ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 57.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:02:13,390 INFO L158 Benchmark]: Boogie Preprocessor took 114.19ms. Allocated memory is still 88.1MB. Free memory was 57.6MB in the beginning and 53.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:02:13,390 INFO L158 Benchmark]: RCFGBuilder took 1358.79ms. Allocated memory is still 88.1MB. Free memory was 53.8MB in the beginning and 60.8MB in the end (delta: -7.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-24 22:02:13,391 INFO L158 Benchmark]: TraceAbstraction took 15376.84ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 60.2MB in the beginning and 50.5MB in the end (delta: 9.8MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2023-11-24 22:02:13,391 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 188.7MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:02:13,408 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 99.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.55ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 47.7MB in the beginning and 60.0MB in the end (delta: -12.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.43ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 57.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.19ms. Allocated memory is still 88.1MB. Free memory was 57.6MB in the beginning and 53.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1358.79ms. Allocated memory is still 88.1MB. Free memory was 53.8MB in the beginning and 60.8MB in the end (delta: -7.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15376.84ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 60.2MB in the beginning and 50.5MB in the end (delta: 9.8MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 188.7MB. Free memory is still 50.5MB. 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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L18] 0 __assert_fail ("0", "safe031_power.oepc_pso.oepc_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 834]: 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: 832]: 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, 79 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: 15.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1285 IncrementalHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 28 mSDtfsCounter, 1285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 229 ConstructedInterpolants, 1 QuantifiedInterpolants, 1624 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1594 ConjunctsInSsa, 76 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-24 22:02:13,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_839b68a7-aed5-4978-83e4-b222e0710970/bin/uautomizer-verify-NlZe1sFDwI/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample