./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:49:00,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:49:00,416 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:49:00,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:49:00,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:49:00,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:49:00,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:49:00,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:49:00,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:49:00,475 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:49:00,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:49:00,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:49:00,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:49:00,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:49:00,480 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:49:00,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:49:00,481 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:49:00,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:49:00,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:49:00,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:49:00,484 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:49:00,485 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:49:00,485 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:49:00,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:49:00,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:49:00,486 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:49:00,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:49:00,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:49:00,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:49:00,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:49:00,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:49:00,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:49:00,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:00,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:49:00,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:49:00,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:49:00,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:49:00,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:49:00,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:49:00,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:49:00,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:49:00,493 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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 -> 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b [2023-11-24 21:49:00,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:49:00,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:49:00,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:49:00,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:49:00,912 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:49:00,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2023-11-24 21:49:04,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:49:04,381 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:49:04,382 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2023-11-24 21:49:04,412 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data/759c1751f/17e38ff6e3c242368403497e6aa82a8a/FLAGba16cae7d [2023-11-24 21:49:04,434 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data/759c1751f/17e38ff6e3c242368403497e6aa82a8a [2023-11-24 21:49:04,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:49:04,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:49:04,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:04,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:49:04,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:49:04,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:04" (1/1) ... [2023-11-24 21:49:04,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b52bb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:04, skipping insertion in model container [2023-11-24 21:49:04,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:04" (1/1) ... [2023-11-24 21:49:04,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:49:05,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:05,114 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:49:05,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:05,301 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:05,302 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:05,312 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:49:05,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05 WrapperNode [2023-11-24 21:49:05,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:05,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:05,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:49:05,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:49:05,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,441 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-24 21:49:05,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:05,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:49:05,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:49:05,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:49:05,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,524 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 21:49:05,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:49:05,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:49:05,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:49:05,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:49:05,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (1/1) ... [2023-11-24 21:49:05,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:49:05,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:49:05,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:49:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:49:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:49:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:49:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:49:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:49:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:49:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:49:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:49:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:49:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:49:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:49:05,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:49:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:49:05,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:49:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:49:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:49:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:49:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:49:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:49:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:49:05,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:49:05,665 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 21:49:05,888 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:49:05,891 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:49:06,329 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:49:06,662 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:49:06,670 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:49:06,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:06 BoogieIcfgContainer [2023-11-24 21:49:06,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:49:06,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:49:06,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:49:06,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:49:06,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:49:04" (1/3) ... [2023-11-24 21:49:06,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e67e688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:06, skipping insertion in model container [2023-11-24 21:49:06,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:05" (2/3) ... [2023-11-24 21:49:06,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e67e688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:06, skipping insertion in model container [2023-11-24 21:49:06,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:06" (3/3) ... [2023-11-24 21:49:06,686 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2023-11-24 21:49:06,712 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:49:06,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 21:49:06,713 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:49:06,794 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:49:06,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 21:49:06,877 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-24 21:49:06,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:06,883 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 5. Compared 96 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 21:49:06,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 21:49:06,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-24 21:49:06,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:49:06,921 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;@44ef0605, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:49:06,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 21:49:06,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:49:06,924 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:49:06,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:06,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:06,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:06,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:06,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 12515, now seen corresponding path program 1 times [2023-11-24 21:49:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852262907] [2023-11-24 21:49:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:07,305 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 21:49:07,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:07,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852262907] [2023-11-24 21:49:07,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852262907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:07,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:07,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671157442] [2023-11-24 21:49:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:07,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:07,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:07,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 21:49:07,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:07,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:07,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 21:49:07,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:08,088 INFO L124 PetriNetUnfolderBase]: 1057/2053 cut-off events. [2023-11-24 21:49:08,088 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:49:08,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 2053 events. 1057/2053 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13847 event pairs, 791 based on Foata normal form. 120/1967 useless extension candidates. Maximal degree in co-relation 3665. Up to 1193 conditions per place. [2023-11-24 21:49:08,120 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-24 21:49:08,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 185 flow [2023-11-24 21:49:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 21:49:08,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 21:49:08,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 21:49:08,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 21:49:08,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:08,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 21:49:08,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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 21:49:08,155 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 21:49:08,156 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 21:49:08,158 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 116 transitions. [2023-11-24 21:49:08,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 185 flow [2023-11-24 21:49:08,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:49:08,172 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 21:49:08,174 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 21:49:08,179 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 21:49:08,179 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 21:49:08,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:08,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:08,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:08,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:49:08,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:08,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash 12516, now seen corresponding path program 1 times [2023-11-24 21:49:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685312009] [2023-11-24 21:49:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:08,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:08,317 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 21:49:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685312009] [2023-11-24 21:49:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685312009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:08,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:08,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560065723] [2023-11-24 21:49:08,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:08,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:08,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:08,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:08,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:08,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 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 21:49:08,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:08,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:08,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:08,828 INFO L124 PetriNetUnfolderBase]: 1057/2052 cut-off events. [2023-11-24 21:49:08,828 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:49:08,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 2052 events. 1057/2052 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13904 event pairs, 791 based on Foata normal form. 1/1847 useless extension candidates. Maximal degree in co-relation 3725. Up to 1192 conditions per place. [2023-11-24 21:49:08,849 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 21:49:08,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 182 flow [2023-11-24 21:49:08,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 21:49:08,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 21:49:08,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 21:49:08,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 21:49:08,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:08,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 21:49:08,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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 21:49:08,855 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 21:49:08,855 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 21:49:08,856 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 116 transitions. [2023-11-24 21:49:08,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 182 flow [2023-11-24 21:49:08,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:08,860 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 21:49:08,860 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 21:49:08,861 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 21:49:08,862 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 21:49:08,862 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 21:49:08,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:08,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:08,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:49:08,863 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:08,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:08,863 INFO L85 PathProgramCache]: Analyzing trace with hash 373213019, now seen corresponding path program 1 times [2023-11-24 21:49:08,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085598554] [2023-11-24 21:49:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:09,021 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 21:49:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085598554] [2023-11-24 21:49:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085598554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43676967] [2023-11-24 21:49:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:09,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 21:49:09,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 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 21:49:09,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:09,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 21:49:09,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:09,394 INFO L124 PetriNetUnfolderBase]: 825/1543 cut-off events. [2023-11-24 21:49:09,394 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-24 21:49:09,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2871 conditions, 1543 events. 825/1543 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10047 event pairs, 129 based on Foata normal form. 0/1519 useless extension candidates. Maximal degree in co-relation 2860. Up to 1009 conditions per place. [2023-11-24 21:49:09,412 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 33 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2023-11-24 21:49:09,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 212 flow [2023-11-24 21:49:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-24 21:49:09,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049 [2023-11-24 21:49:09,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-24 21:49:09,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-24 21:49:09,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:09,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-24 21:49:09,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 21:49:09,427 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 21:49:09,428 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 21:49:09,428 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 125 transitions. [2023-11-24 21:49:09,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 212 flow [2023-11-24 21:49:09,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:09,434 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 98 flow [2023-11-24 21:49:09,435 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=98, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-24 21:49:09,437 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-24 21:49:09,437 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 98 flow [2023-11-24 21:49:09,438 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 21:49:09,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:09,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:09,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:49:09,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:09,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash 373211559, now seen corresponding path program 1 times [2023-11-24 21:49:09,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678300497] [2023-11-24 21:49:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:09,525 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 21:49:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678300497] [2023-11-24 21:49:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678300497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:09,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205400520] [2023-11-24 21:49:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:09,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:09,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 21:49:09,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:09,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:09,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 21:49:09,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:09,906 INFO L124 PetriNetUnfolderBase]: 724/1469 cut-off events. [2023-11-24 21:49:09,906 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-24 21:49:09,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 1469 events. 724/1469 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9638 event pairs, 416 based on Foata normal form. 0/1397 useless extension candidates. Maximal degree in co-relation 2686. Up to 940 conditions per place. [2023-11-24 21:49:09,925 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-24 21:49:09,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-24 21:49:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 21:49:09,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 21:49:09,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 21:49:09,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 21:49:09,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:09,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 21:49:09,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:09,930 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 21:49:09,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 21:49:09,931 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 98 flow. Second operand 3 states and 111 transitions. [2023-11-24 21:49:09,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-24 21:49:09,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:09,934 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-24 21:49:09,934 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=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 21:49:09,935 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 21:49:09,936 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-24 21:49:09,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:09,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:09,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:09,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:49:09,937 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:09,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash 373211560, now seen corresponding path program 1 times [2023-11-24 21:49:09,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:09,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489911471] [2023-11-24 21:49:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:10,053 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 21:49:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489911471] [2023-11-24 21:49:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489911471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:10,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51151470] [2023-11-24 21:49:10,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:10,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:10,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:10,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:10,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.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 21:49:10,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:10,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:10,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:10,493 INFO L124 PetriNetUnfolderBase]: 721/1444 cut-off events. [2023-11-24 21:49:10,493 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 21:49:10,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 1444 events. 721/1444 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9591 event pairs, 548 based on Foata normal form. 4/1377 useless extension candidates. Maximal degree in co-relation 2613. Up to 933 conditions per place. [2023-11-24 21:49:10,511 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-24 21:49:10,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 166 flow [2023-11-24 21:49:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 21:49:10,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-24 21:49:10,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 21:49:10,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 21:49:10,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:10,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 21:49:10,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:10,517 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 21:49:10,518 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 21:49:10,518 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 113 transitions. [2023-11-24 21:49:10,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 166 flow [2023-11-24 21:49:10,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:10,524 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-24 21:49:10,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-24 21:49:10,529 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-24 21:49:10,529 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-24 21:49:10,530 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 21:49:10,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:10,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:10,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:49:10,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:10,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1324392811, now seen corresponding path program 1 times [2023-11-24 21:49:10,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629425003] [2023-11-24 21:49:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:10,658 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 21:49:10,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629425003] [2023-11-24 21:49:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629425003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860948129] [2023-11-24 21:49:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:10,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:10,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 21:49:10,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:10,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:10,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 21:49:10,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:11,082 INFO L124 PetriNetUnfolderBase]: 738/1467 cut-off events. [2023-11-24 21:49:11,082 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 21:49:11,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1467 events. 738/1467 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9558 event pairs, 260 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2665. Up to 934 conditions per place. [2023-11-24 21:49:11,099 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-24 21:49:11,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 166 flow [2023-11-24 21:49:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 21:49:11,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 21:49:11,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 21:49:11,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 21:49:11,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:11,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 21:49:11,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:11,106 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 21:49:11,107 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 21:49:11,107 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 111 transitions. [2023-11-24 21:49:11,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 166 flow [2023-11-24 21:49:11,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:11,114 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-24 21:49:11,114 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 21:49:11,118 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-24 21:49:11,118 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-24 21:49:11,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:11,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:11,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:11,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:49:11,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:11,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1324392810, now seen corresponding path program 1 times [2023-11-24 21:49:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313693904] [2023-11-24 21:49:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:11,278 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 21:49:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313693904] [2023-11-24 21:49:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313693904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:11,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:11,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777846577] [2023-11-24 21:49:11,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:11,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:11,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:11,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:11,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:11,303 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 21:49:11,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:11,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:11,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:11,666 INFO L124 PetriNetUnfolderBase]: 721/1418 cut-off events. [2023-11-24 21:49:11,666 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 21:49:11,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1418 events. 721/1418 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9104 event pairs, 420 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 2595. Up to 905 conditions per place. [2023-11-24 21:49:11,682 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-24 21:49:11,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 162 flow [2023-11-24 21:49:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 21:49:11,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-24 21:49:11,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 21:49:11,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 21:49:11,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:11,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 21:49:11,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:11,690 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 21:49:11,691 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 21:49:11,691 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 113 transitions. [2023-11-24 21:49:11,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 162 flow [2023-11-24 21:49:11,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:11,695 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-24 21:49:11,697 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 21:49:11,699 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-24 21:49:11,699 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-24 21:49:11,700 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 21:49:11,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:11,700 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 21:49:11,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:49:11,701 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:11,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1820032101, now seen corresponding path program 1 times [2023-11-24 21:49:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:11,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889261216] [2023-11-24 21:49:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:12,559 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 21:49:12,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:12,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889261216] [2023-11-24 21:49:12,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889261216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:12,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:12,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:49:12,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977137089] [2023-11-24 21:49:12,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:12,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:49:12,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:12,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:49:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:49:12,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 21:49:12,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 26.666666666666668) internal successors, (240), 9 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 21:49:12,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:12,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 21:49:12,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:13,587 INFO L124 PetriNetUnfolderBase]: 915/1556 cut-off events. [2023-11-24 21:49:13,587 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-24 21:49:13,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 1556 events. 915/1556 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8941 event pairs, 48 based on Foata normal form. 60/1600 useless extension candidates. Maximal degree in co-relation 3027. Up to 936 conditions per place. [2023-11-24 21:49:13,604 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 36 selfloop transitions, 4 changer transitions 11/67 dead transitions. [2023-11-24 21:49:13,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 248 flow [2023-11-24 21:49:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:49:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:49:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2023-11-24 21:49:13,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6005291005291006 [2023-11-24 21:49:13,611 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 227 transitions. [2023-11-24 21:49:13,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 227 transitions. [2023-11-24 21:49:13,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:13,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 227 transitions. [2023-11-24 21:49:13,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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 21:49:13,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:49:13,616 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:49:13,616 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 7 states and 227 transitions. [2023-11-24 21:49:13,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 248 flow [2023-11-24 21:49:13,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:13,621 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 90 flow [2023-11-24 21:49:13,622 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-11-24 21:49:13,625 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 21:49:13,625 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 90 flow [2023-11-24 21:49:13,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.666666666666668) internal successors, (240), 9 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 21:49:13,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:13,626 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 21:49:13,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:49:13,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:13,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1820030971, now seen corresponding path program 1 times [2023-11-24 21:49:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475855282] [2023-11-24 21:49:13,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:13,901 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 21:49:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475855282] [2023-11-24 21:49:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475855282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:49:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35044924] [2023-11-24 21:49:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:13,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:49:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:49:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:49:13,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 21:49:13,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 21:49:13,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:13,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 21:49:13,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:14,418 INFO L124 PetriNetUnfolderBase]: 1499/2627 cut-off events. [2023-11-24 21:49:14,418 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-24 21:49:14,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 2627 events. 1499/2627 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16632 event pairs, 188 based on Foata normal form. 100/2679 useless extension candidates. Maximal degree in co-relation 4963. Up to 1316 conditions per place. [2023-11-24 21:49:14,440 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 42 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2023-11-24 21:49:14,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 244 flow [2023-11-24 21:49:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:49:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:49:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2023-11-24 21:49:14,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2023-11-24 21:49:14,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 150 transitions. [2023-11-24 21:49:14,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 150 transitions. [2023-11-24 21:49:14,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:14,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 150 transitions. [2023-11-24 21:49:14,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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 21:49:14,444 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 21:49:14,445 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 21:49:14,445 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 90 flow. Second operand 4 states and 150 transitions. [2023-11-24 21:49:14,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 244 flow [2023-11-24 21:49:14,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 233 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:49:14,448 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 117 flow [2023-11-24 21:49:14,448 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 21:49:14,449 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-24 21:49:14,449 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 117 flow [2023-11-24 21:49:14,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 21:49:14,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:14,450 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 21:49:14,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:49:14,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:14,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1936081602, now seen corresponding path program 1 times [2023-11-24 21:49:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876326333] [2023-11-24 21:49:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:14,738 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 21:49:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876326333] [2023-11-24 21:49:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876326333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319767586] [2023-11-24 21:49:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:14,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:49:14,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:14,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:49:14,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:49:14,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 21:49:14,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 21:49:14,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:14,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 21:49:14,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:15,208 INFO L124 PetriNetUnfolderBase]: 962/1694 cut-off events. [2023-11-24 21:49:15,208 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2023-11-24 21:49:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 1694 events. 962/1694 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9430 event pairs, 100 based on Foata normal form. 82/1736 useless extension candidates. Maximal degree in co-relation 3792. Up to 581 conditions per place. [2023-11-24 21:49:15,224 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 53 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2023-11-24 21:49:15,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 334 flow [2023-11-24 21:49:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2023-11-24 21:49:15,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-24 21:49:15,227 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 189 transitions. [2023-11-24 21:49:15,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 189 transitions. [2023-11-24 21:49:15,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:15,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 189 transitions. [2023-11-24 21:49:15,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:15,230 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 21:49:15,230 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 21:49:15,230 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 117 flow. Second operand 5 states and 189 transitions. [2023-11-24 21:49:15,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 334 flow [2023-11-24 21:49:15,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 324 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:15,235 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 157 flow [2023-11-24 21:49:15,236 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 21:49:15,237 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 21:49:15,237 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 157 flow [2023-11-24 21:49:15,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 21:49:15,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:15,238 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 21:49:15,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:49:15,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:15,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:15,239 INFO L85 PathProgramCache]: Analyzing trace with hash 249963274, now seen corresponding path program 1 times [2023-11-24 21:49:15,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:15,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064290812] [2023-11-24 21:49:15,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:15,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:15,522 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 21:49:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064290812] [2023-11-24 21:49:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064290812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:49:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074363832] [2023-11-24 21:49:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:15,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:15,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 21:49:15,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 21:49:15,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:15,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 21:49:15,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:15,886 INFO L124 PetriNetUnfolderBase]: 569/971 cut-off events. [2023-11-24 21:49:15,886 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2023-11-24 21:49:15,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 971 events. 569/971 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4479 event pairs, 83 based on Foata normal form. 40/976 useless extension candidates. Maximal degree in co-relation 2476. Up to 308 conditions per place. [2023-11-24 21:49:15,895 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 46 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2023-11-24 21:49:15,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 341 flow [2023-11-24 21:49:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:49:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:49:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2023-11-24 21:49:15,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2023-11-24 21:49:15,898 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 210 transitions. [2023-11-24 21:49:15,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 210 transitions. [2023-11-24 21:49:15,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:15,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 210 transitions. [2023-11-24 21:49:15,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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 21:49:15,901 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 21:49:15,902 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 21:49:15,902 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 157 flow. Second operand 6 states and 210 transitions. [2023-11-24 21:49:15,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 341 flow [2023-11-24 21:49:15,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 316 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-24 21:49:15,910 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 171 flow [2023-11-24 21:49:15,910 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 21:49:15,911 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2023-11-24 21:49:15,911 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 171 flow [2023-11-24 21:49:15,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 21:49:15,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:15,912 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 21:49:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:49:15,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:15,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -714020355, now seen corresponding path program 1 times [2023-11-24 21:49:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:15,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319993539] [2023-11-24 21:49:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:17,300 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 21:49:17,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:17,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319993539] [2023-11-24 21:49:17,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319993539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:17,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:49:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161421152] [2023-11-24 21:49:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:17,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:49:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:49:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:49:17,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:17,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 171 flow. Second operand has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:17,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:17,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:17,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:17,837 INFO L124 PetriNetUnfolderBase]: 453/889 cut-off events. [2023-11-24 21:49:17,837 INFO L125 PetriNetUnfolderBase]: For 491/511 co-relation queries the response was YES. [2023-11-24 21:49:17,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 889 events. 453/889 cut-off events. For 491/511 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4656 event pairs, 90 based on Foata normal form. 8/852 useless extension candidates. Maximal degree in co-relation 2062. Up to 236 conditions per place. [2023-11-24 21:49:17,849 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 32 selfloop transitions, 4 changer transitions 24/84 dead transitions. [2023-11-24 21:49:17,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 387 flow [2023-11-24 21:49:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:49:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:49:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 313 transitions. [2023-11-24 21:49:17,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6440329218106996 [2023-11-24 21:49:17,852 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 313 transitions. [2023-11-24 21:49:17,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 313 transitions. [2023-11-24 21:49:17,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:17,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 313 transitions. [2023-11-24 21:49:17,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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 21:49:17,857 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 21:49:17,858 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 21:49:17,858 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 171 flow. Second operand 9 states and 313 transitions. [2023-11-24 21:49:17,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 387 flow [2023-11-24 21:49:17,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 323 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-24 21:49:17,864 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 133 flow [2023-11-24 21:49:17,864 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=133, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-11-24 21:49:17,865 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2023-11-24 21:49:17,865 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 133 flow [2023-11-24 21:49:17,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:17,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:17,866 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 21:49:17,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:49:17,867 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:17,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1390009027, now seen corresponding path program 2 times [2023-11-24 21:49:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:17,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794923009] [2023-11-24 21:49:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:18,279 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 21:49:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794923009] [2023-11-24 21:49:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794923009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:18,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112952032] [2023-11-24 21:49:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:18,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:18,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2023-11-24 21:49:18,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 21:49:18,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:18,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2023-11-24 21:49:18,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:18,818 INFO L124 PetriNetUnfolderBase]: 1016/1794 cut-off events. [2023-11-24 21:49:18,819 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2023-11-24 21:49:18,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1794 events. 1016/1794 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9643 event pairs, 181 based on Foata normal form. 8/1749 useless extension candidates. Maximal degree in co-relation 3989. Up to 886 conditions per place. [2023-11-24 21:49:18,829 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 49 selfloop transitions, 9 changer transitions 10/88 dead transitions. [2023-11-24 21:49:18,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 391 flow [2023-11-24 21:49:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:49:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:49:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2023-11-24 21:49:18,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2023-11-24 21:49:18,832 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 237 transitions. [2023-11-24 21:49:18,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 237 transitions. [2023-11-24 21:49:18,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:18,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 237 transitions. [2023-11-24 21:49:18,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 21:49:18,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:49:18,836 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:49:18,836 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 133 flow. Second operand 7 states and 237 transitions. [2023-11-24 21:49:18,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 391 flow [2023-11-24 21:49:18,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 88 transitions, 361 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-24 21:49:18,847 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 187 flow [2023-11-24 21:49:18,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=119, 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-24 21:49:18,849 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2023-11-24 21:49:18,849 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 187 flow [2023-11-24 21:49:18,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 21:49:18,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:18,850 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 21:49:18,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:49:18,850 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:18,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:18,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1344312731, now seen corresponding path program 3 times [2023-11-24 21:49:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581819257] [2023-11-24 21:49:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:19,314 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 21:49:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:19,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581819257] [2023-11-24 21:49:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581819257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:19,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:19,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:19,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652035705] [2023-11-24 21:49:19,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:19,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:19,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:19,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:19,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 21:49:19,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:19,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:19,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 21:49:19,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:19,969 INFO L124 PetriNetUnfolderBase]: 1345/2553 cut-off events. [2023-11-24 21:49:19,970 INFO L125 PetriNetUnfolderBase]: For 641/663 co-relation queries the response was YES. [2023-11-24 21:49:19,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5716 conditions, 2553 events. 1345/2553 cut-off events. For 641/663 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16377 event pairs, 442 based on Foata normal form. 14/2469 useless extension candidates. Maximal degree in co-relation 5698. Up to 913 conditions per place. [2023-11-24 21:49:19,983 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 27 selfloop transitions, 1 changer transitions 25/79 dead transitions. [2023-11-24 21:49:19,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 370 flow [2023-11-24 21:49:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:49:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:49:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-24 21:49:19,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6327160493827161 [2023-11-24 21:49:19,985 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-24 21:49:19,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-24 21:49:19,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:19,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-24 21:49:19,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:19,988 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 21:49:19,988 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 21:49:19,988 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 187 flow. Second operand 6 states and 205 transitions. [2023-11-24 21:49:19,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 370 flow [2023-11-24 21:49:19,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 79 transitions, 364 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:19,993 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 190 flow [2023-11-24 21:49:19,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-11-24 21:49:19,994 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2023-11-24 21:49:19,994 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 190 flow [2023-11-24 21:49:19,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:19,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:19,995 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 21:49:19,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:49:19,995 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:19,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash -512914329, now seen corresponding path program 4 times [2023-11-24 21:49:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616361605] [2023-11-24 21:49:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:19,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:49:20,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:49:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:49:20,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:49:20,150 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:49:20,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 21:49:20,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 21:49:20,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 21:49:20,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 21:49:20,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 21:49:20,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 21:49:20,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 21:49:20,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 21:49:20,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 21:49:20,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 21:49:20,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 21:49:20,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 21:49:20,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 21:49:20,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:49:20,160 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:20,169 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:49:20,169 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:49:20,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:49:20,255 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:49:20,258 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:49:20,267 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:20,268 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:20,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:49:20 BasicIcfg [2023-11-24 21:49:20,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:49:20,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:49:20,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:49:20,282 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:49:20,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:06" (3/4) ... [2023-11-24 21:49:20,284 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:49:20,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:49:20,287 INFO L158 Benchmark]: Toolchain (without parser) took 15848.40ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 107.8MB in the beginning and 160.6MB in the end (delta: -52.8MB). Peak memory consumption was 113.3MB. Max. memory is 16.1GB. [2023-11-24 21:49:20,287 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:20,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 874.37ms. Allocated memory is still 151.0MB. Free memory was 107.8MB in the beginning and 99.9MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-24 21:49:20,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.82ms. Allocated memory is still 151.0MB. Free memory was 99.9MB in the beginning and 97.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:20,288 INFO L158 Benchmark]: Boogie Preprocessor took 108.33ms. Allocated memory is still 151.0MB. Free memory was 97.5MB in the beginning and 94.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:49:20,289 INFO L158 Benchmark]: RCFGBuilder took 1115.40ms. Allocated memory is still 151.0MB. Free memory was 94.0MB in the beginning and 87.4MB in the end (delta: 6.5MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-11-24 21:49:20,289 INFO L158 Benchmark]: TraceAbstraction took 13607.57ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 86.8MB in the beginning and 161.7MB in the end (delta: -74.9MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. [2023-11-24 21:49:20,290 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 318.8MB. Free memory was 161.7MB in the beginning and 160.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:20,292 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.33ms. Allocated memory is still 117.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 874.37ms. Allocated memory is still 151.0MB. Free memory was 107.8MB in the beginning and 99.9MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.82ms. Allocated memory is still 151.0MB. Free memory was 99.9MB in the beginning and 97.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.33ms. Allocated memory is still 151.0MB. Free memory was 97.5MB in the beginning and 94.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1115.40ms. Allocated memory is still 151.0MB. Free memory was 94.0MB in the beginning and 87.4MB in the end (delta: 6.5MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13607.57ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 86.8MB in the beginning and 161.7MB in the end (delta: -74.9MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 318.8MB. Free memory was 161.7MB in the beginning and 160.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, t410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix016.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 845]: 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: 843]: 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: 13.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 567 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1729 IncrementalHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 38 mSDtfsCounter, 1729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=14, InterpolantAutomatonStates: 65, 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.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1257 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 21:49:20,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:49:23,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:49:23,348 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:49:23,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:49:23,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:49:23,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:49:23,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:49:23,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:49:23,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:49:23,421 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:49:23,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:49:23,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:49:23,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:49:23,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:49:23,425 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:49:23,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:49:23,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:49:23,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:49:23,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:49:23,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:49:23,429 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:49:23,429 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:49:23,430 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:49:23,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:49:23,431 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:49:23,431 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:49:23,432 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:49:23,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:49:23,432 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:49:23,433 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:49:23,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:49:23,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:49:23,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:49:23,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:49:23,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:23,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:49:23,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:49:23,438 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:49:23,438 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:49:23,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:49:23,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:49:23,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:49:23,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:49:23,440 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:49:23,440 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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 -> 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b [2023-11-24 21:49:23,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:49:23,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:49:23,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:49:23,942 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:49:23,943 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:49:23,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2023-11-24 21:49:27,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:49:27,950 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:49:27,952 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2023-11-24 21:49:27,978 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data/a044ea15d/b9d7f1ed480a441c86d54b8ce1105321/FLAGa16587a2a [2023-11-24 21:49:28,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/data/a044ea15d/b9d7f1ed480a441c86d54b8ce1105321 [2023-11-24 21:49:28,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:49:28,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:49:28,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:28,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:49:28,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:49:28,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:28,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e997df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28, skipping insertion in model container [2023-11-24 21:49:28,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:28,106 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:49:28,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:28,716 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:49:28,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:28,849 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:28,849 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:28,876 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:49:28,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28 WrapperNode [2023-11-24 21:49:28,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:28,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:28,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:49:28,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:49:28,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:28,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:28,975 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-11-24 21:49:28,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:28,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:49:28,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:49:28,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:49:28,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:28,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,058 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 21:49:29,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:49:29,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:49:29,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:49:29,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:49:29,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (1/1) ... [2023-11-24 21:49:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:29,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:49:29,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:49:29,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:49:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:49:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:49:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:49:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:49:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:49:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:49:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:49:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-24 21:49:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:49:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:49:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:49:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-24 21:49:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:49:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:49:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:49:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:49:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:49:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:49:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:49:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:49:29,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:49:29,221 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 21:49:29,453 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:49:29,456 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:49:29,954 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:49:30,328 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:49:30,328 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:49:30,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:30 BoogieIcfgContainer [2023-11-24 21:49:30,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:49:30,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:49:30,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:49:30,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:49:30,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:49:28" (1/3) ... [2023-11-24 21:49:30,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4401fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:30, skipping insertion in model container [2023-11-24 21:49:30,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:28" (2/3) ... [2023-11-24 21:49:30,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4401fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:30, skipping insertion in model container [2023-11-24 21:49:30,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:30" (3/3) ... [2023-11-24 21:49:30,342 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2023-11-24 21:49:30,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:49:30,366 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 21:49:30,366 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:49:30,450 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:49:30,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 21:49:30,556 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-24 21:49:30,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:30,561 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 5. Compared 96 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 21:49:30,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 21:49:30,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-24 21:49:30,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:49:30,588 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;@5f8965d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:49:30,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 21:49:30,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:49:30,594 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:49:30,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:30,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:30,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:30,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:30,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash 12579, now seen corresponding path program 1 times [2023-11-24 21:49:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:30,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502143378] [2023-11-24 21:49:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:30,624 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 21:49:30,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:30,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:30,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:30,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:49:30,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:30,900 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 21:49:30,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 21:49:30,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:30,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502143378] [2023-11-24 21:49:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502143378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:30,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210208490] [2023-11-24 21:49:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:30,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:30,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:31,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 21:49:31,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:31,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 21:49:31,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:31,681 INFO L124 PetriNetUnfolderBase]: 1057/2053 cut-off events. [2023-11-24 21:49:31,681 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:49:31,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 2053 events. 1057/2053 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13847 event pairs, 791 based on Foata normal form. 120/1967 useless extension candidates. Maximal degree in co-relation 3665. Up to 1193 conditions per place. [2023-11-24 21:49:31,710 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-24 21:49:31,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 185 flow [2023-11-24 21:49:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 21:49:31,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 21:49:31,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 21:49:31,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 21:49:31,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:31,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 21:49:31,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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 21:49:31,742 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 21:49:31,743 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 21:49:31,745 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 116 transitions. [2023-11-24 21:49:31,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 185 flow [2023-11-24 21:49:31,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:49:31,759 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 21:49:31,762 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 21:49:31,767 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 21:49:31,767 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 21:49:31,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:31,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:31,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:31,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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)] Ended with exit code 0 [2023-11-24 21:49:31,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:31,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:31,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 12580, now seen corresponding path program 1 times [2023-11-24 21:49:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965966469] [2023-11-24 21:49:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:31,973 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 21:49:31,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:31,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:32,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:32,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:49:32,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:32,152 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 21:49:32,169 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 21:49:32,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:32,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965966469] [2023-11-24 21:49:32,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965966469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:32,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964171698] [2023-11-24 21:49:32,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:32,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:32,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:32,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 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 21:49:32,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:32,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:32,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:32,777 INFO L124 PetriNetUnfolderBase]: 1057/2052 cut-off events. [2023-11-24 21:49:32,777 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:49:32,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 2052 events. 1057/2052 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13904 event pairs, 791 based on Foata normal form. 1/1847 useless extension candidates. Maximal degree in co-relation 3725. Up to 1192 conditions per place. [2023-11-24 21:49:32,797 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 21:49:32,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 182 flow [2023-11-24 21:49:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 21:49:32,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 21:49:32,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 21:49:32,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 21:49:32,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:32,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 21:49:32,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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 21:49:32,816 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 21:49:32,816 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 21:49:32,816 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 116 transitions. [2023-11-24 21:49:32,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 182 flow [2023-11-24 21:49:32,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:32,822 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 21:49:32,822 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 21:49:32,823 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 21:49:32,823 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 21:49:32,824 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 21:49:32,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:32,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:32,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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)] Ended with exit code 0 [2023-11-24 21:49:33,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:33,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:33,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 375121629, now seen corresponding path program 1 times [2023-11-24 21:49:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424664470] [2023-11-24 21:49:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:33,029 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 21:49:33,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:33,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:33,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:33,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:49:33,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:33,148 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 21:49:33,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:33,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424664470] [2023-11-24 21:49:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424664470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771158005] [2023-11-24 21:49:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:33,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:33,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 21:49:33,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 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 21:49:33,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:33,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 21:49:33,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:33,514 INFO L124 PetriNetUnfolderBase]: 825/1466 cut-off events. [2023-11-24 21:49:33,514 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-24 21:49:33,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 1466 events. 825/1466 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8635 event pairs, 457 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 2783. Up to 1009 conditions per place. [2023-11-24 21:49:33,527 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 33 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2023-11-24 21:49:33,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 212 flow [2023-11-24 21:49:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-24 21:49:33,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049 [2023-11-24 21:49:33,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-24 21:49:33,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-24 21:49:33,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:33,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-24 21:49:33,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 21:49:33,538 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 21:49:33,538 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 21:49:33,538 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 125 transitions. [2023-11-24 21:49:33,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 212 flow [2023-11-24 21:49:33,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:33,542 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 98 flow [2023-11-24 21:49:33,542 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=98, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-24 21:49:33,544 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-24 21:49:33,544 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 98 flow [2023-11-24 21:49:33,545 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 21:49:33,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:33,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:33,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:33,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:33,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:33,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 375120169, now seen corresponding path program 1 times [2023-11-24 21:49:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851937661] [2023-11-24 21:49:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:33,754 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 21:49:33,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:33,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:33,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:33,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:49:33,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:33,870 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 21:49:33,877 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 21:49:33,877 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:33,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851937661] [2023-11-24 21:49:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851937661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:33,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:33,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595986369] [2023-11-24 21:49:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:33,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:33,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 21:49:33,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:33,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:33,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 21:49:33,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:34,265 INFO L124 PetriNetUnfolderBase]: 724/1452 cut-off events. [2023-11-24 21:49:34,265 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-24 21:49:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 1452 events. 724/1452 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9589 event pairs, 550 based on Foata normal form. 0/1381 useless extension candidates. Maximal degree in co-relation 2669. Up to 940 conditions per place. [2023-11-24 21:49:34,282 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-24 21:49:34,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-24 21:49:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 21:49:34,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 21:49:34,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 21:49:34,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 21:49:34,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:34,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 21:49:34,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:34,293 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 21:49:34,295 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 21:49:34,295 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 98 flow. Second operand 3 states and 111 transitions. [2023-11-24 21:49:34,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-24 21:49:34,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:34,298 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-24 21:49:34,298 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=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 21:49:34,300 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 21:49:34,300 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-24 21:49:34,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:34,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:34,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:34,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:34,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:34,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:34,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash 375120170, now seen corresponding path program 1 times [2023-11-24 21:49:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263304008] [2023-11-24 21:49:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:34,505 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 21:49:34,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:34,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:34,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:34,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:49:34,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:34,633 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 21:49:34,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 21:49:34,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:34,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263304008] [2023-11-24 21:49:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263304008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:34,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742251913] [2023-11-24 21:49:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:34,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:34,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:34,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.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 21:49:34,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:34,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:34,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:35,010 INFO L124 PetriNetUnfolderBase]: 721/1462 cut-off events. [2023-11-24 21:49:35,010 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 21:49:35,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 1462 events. 721/1462 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9636 event pairs, 416 based on Foata normal form. 4/1394 useless extension candidates. Maximal degree in co-relation 2631. Up to 933 conditions per place. [2023-11-24 21:49:35,025 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-24 21:49:35,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 166 flow [2023-11-24 21:49:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 21:49:35,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-24 21:49:35,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 21:49:35,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 21:49:35,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:35,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 21:49:35,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:35,029 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 21:49:35,030 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 21:49:35,030 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 113 transitions. [2023-11-24 21:49:35,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 166 flow [2023-11-24 21:49:35,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:35,035 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-24 21:49:35,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-24 21:49:35,038 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-24 21:49:35,038 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-24 21:49:35,039 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 21:49:35,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:35,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:35,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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)] Forceful destruction successful, exit code 0 [2023-11-24 21:49:35,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:35,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:35,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash -299565163, now seen corresponding path program 1 times [2023-11-24 21:49:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206448672] [2023-11-24 21:49:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:35,244 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 21:49:35,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:35,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:35,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:35,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:49:35,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:35,354 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 21:49:35,361 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 21:49:35,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:35,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206448672] [2023-11-24 21:49:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206448672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:35,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653359596] [2023-11-24 21:49:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:35,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 21:49:35,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:35,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:35,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 21:49:35,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:35,689 INFO L124 PetriNetUnfolderBase]: 738/1467 cut-off events. [2023-11-24 21:49:35,689 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 21:49:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1467 events. 738/1467 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9544 event pairs, 260 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2665. Up to 934 conditions per place. [2023-11-24 21:49:35,704 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-24 21:49:35,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 166 flow [2023-11-24 21:49:35,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 21:49:35,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 21:49:35,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 21:49:35,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 21:49:35,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:35,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 21:49:35,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:35,709 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 21:49:35,709 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 21:49:35,709 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 111 transitions. [2023-11-24 21:49:35,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 166 flow [2023-11-24 21:49:35,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:35,712 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-24 21:49:35,712 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 21:49:35,713 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-24 21:49:35,713 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-24 21:49:35,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:35,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:35,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:35,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:35,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:35,921 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:35,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash -299565162, now seen corresponding path program 1 times [2023-11-24 21:49:35,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:35,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154517062] [2023-11-24 21:49:35,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:35,922 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 21:49:35,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:35,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:35,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:36,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:49:36,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:36,046 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 21:49:36,060 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 21:49:36,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:36,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154517062] [2023-11-24 21:49:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154517062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:36,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:36,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839601219] [2023-11-24 21:49:36,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:36,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:36,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:36,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:36,098 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 21:49:36,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:36,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:36,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:36,382 INFO L124 PetriNetUnfolderBase]: 721/1418 cut-off events. [2023-11-24 21:49:36,382 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 21:49:36,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1418 events. 721/1418 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9149 event pairs, 420 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 2595. Up to 905 conditions per place. [2023-11-24 21:49:36,396 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-24 21:49:36,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 162 flow [2023-11-24 21:49:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 21:49:36,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-24 21:49:36,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 21:49:36,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 21:49:36,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:36,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 21:49:36,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:36,400 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 21:49:36,400 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 21:49:36,401 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 113 transitions. [2023-11-24 21:49:36,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 162 flow [2023-11-24 21:49:36,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:36,403 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-24 21:49:36,403 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 21:49:36,404 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-24 21:49:36,404 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-24 21:49:36,405 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 21:49:36,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:36,405 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 21:49:36,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:36,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:36,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:36,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1559643611, now seen corresponding path program 1 times [2023-11-24 21:49:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608751378] [2023-11-24 21:49:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:36,615 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 21:49:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:36,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:36,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:36,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:49:36,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:36,772 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 21:49:36,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:36,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:36,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608751378] [2023-11-24 21:49:36,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608751378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:36,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:49:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313062500] [2023-11-24 21:49:36,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:36,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:49:36,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:36,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:49:36,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:49:36,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 21:49:36,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 21:49:36,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:36,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 21:49:36,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:37,309 INFO L124 PetriNetUnfolderBase]: 1680/2972 cut-off events. [2023-11-24 21:49:37,309 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-24 21:49:37,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5652 conditions, 2972 events. 1680/2972 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19424 event pairs, 188 based on Foata normal form. 100/3024 useless extension candidates. Maximal degree in co-relation 5642. Up to 1579 conditions per place. [2023-11-24 21:49:37,335 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2023-11-24 21:49:37,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 244 flow [2023-11-24 21:49:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:49:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:49:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-24 21:49:37,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6990740740740741 [2023-11-24 21:49:37,338 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-24 21:49:37,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-24 21:49:37,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:37,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-24 21:49:37,340 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 21:49:37,342 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 21:49:37,342 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 21:49:37,342 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 4 states and 151 transitions. [2023-11-24 21:49:37,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 244 flow [2023-11-24 21:49:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:37,349 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2023-11-24 21:49:37,350 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 21:49:37,352 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 21:49:37,352 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2023-11-24 21:49:37,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 21:49:37,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:37,353 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 21:49:37,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:37,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:37,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:37,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2068086294, now seen corresponding path program 1 times [2023-11-24 21:49:37,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:37,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207964259] [2023-11-24 21:49:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:37,557 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 21:49:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:37,558 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:37,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:37,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:49:37,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:37,769 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 21:49:37,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:37,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207964259] [2023-11-24 21:49:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207964259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594932651] [2023-11-24 21:49:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:37,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:49:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:49:37,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:49:37,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 21:49:37,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 21:49:37,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:37,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 21:49:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:38,198 INFO L124 PetriNetUnfolderBase]: 1038/1850 cut-off events. [2023-11-24 21:49:38,199 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-11-24 21:49:38,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1850 events. 1038/1850 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10569 event pairs, 100 based on Foata normal form. 82/1892 useless extension candidates. Maximal degree in co-relation 4070. Up to 697 conditions per place. [2023-11-24 21:49:38,212 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 54 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2023-11-24 21:49:38,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 339 flow [2023-11-24 21:49:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-24 21:49:38,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 21:49:38,214 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-24 21:49:38,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-24 21:49:38,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:38,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-24 21:49:38,216 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 21:49:38,217 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 21:49:38,217 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 21:49:38,217 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 120 flow. Second operand 5 states and 190 transitions. [2023-11-24 21:49:38,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 339 flow [2023-11-24 21:49:38,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 329 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:38,221 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 160 flow [2023-11-24 21:49:38,221 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 21:49:38,222 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 21:49:38,222 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 160 flow [2023-11-24 21:49:38,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 21:49:38,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:38,223 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 21:49:38,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:38,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:38,434 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:38,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1441493536, now seen corresponding path program 1 times [2023-11-24 21:49:38,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:38,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913477036] [2023-11-24 21:49:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:38,436 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 21:49:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:38,437 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:38,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:38,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:49:38,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:38,646 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 21:49:38,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:38,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913477036] [2023-11-24 21:49:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913477036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:49:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738335048] [2023-11-24 21:49:38,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:38,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:38,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 21:49:38,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 21:49:38,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:38,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 21:49:38,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:39,012 INFO L124 PetriNetUnfolderBase]: 581/999 cut-off events. [2023-11-24 21:49:39,012 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2023-11-24 21:49:39,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 999 events. 581/999 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4611 event pairs, 83 based on Foata normal form. 40/1004 useless extension candidates. Maximal degree in co-relation 2518. Up to 308 conditions per place. [2023-11-24 21:49:39,019 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 47 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2023-11-24 21:49:39,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 346 flow [2023-11-24 21:49:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:49:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:49:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2023-11-24 21:49:39,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6512345679012346 [2023-11-24 21:49:39,021 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 211 transitions. [2023-11-24 21:49:39,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 211 transitions. [2023-11-24 21:49:39,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:39,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 211 transitions. [2023-11-24 21:49:39,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 21:49:39,024 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 21:49:39,024 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 21:49:39,024 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 160 flow. Second operand 6 states and 211 transitions. [2023-11-24 21:49:39,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 346 flow [2023-11-24 21:49:39,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 321 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-24 21:49:39,031 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 174 flow [2023-11-24 21:49:39,031 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 21:49:39,032 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2023-11-24 21:49:39,032 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 174 flow [2023-11-24 21:49:39,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 21:49:39,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:39,032 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 21:49:39,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:39,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:39,236 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:39,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash 546335187, now seen corresponding path program 1 times [2023-11-24 21:49:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057252817] [2023-11-24 21:49:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:39,237 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 21:49:39,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:39,238 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:39,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:39,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-24 21:49:39,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:40,009 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t411~0#1.base_37| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t410~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t409~0#1.base_55| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t409~0#1.base_55| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t410~0#1.base_51|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~#t410~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t411~0#1.base_37|) (_ bv0 1)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t409~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t410~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t411~0#1.base_37| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t409~0#1.base_55|))))) is different from true [2023-11-24 21:49:40,010 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 21:49:40,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:40,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:40,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057252817] [2023-11-24 21:49:40,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057252817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:40,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:40,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075807794] [2023-11-24 21:49:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:40,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-24 21:49:40,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2023-11-24 21:49:40,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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 21:49:40,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:40,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2023-11-24 21:49:40,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:40,380 INFO L124 PetriNetUnfolderBase]: 340/701 cut-off events. [2023-11-24 21:49:40,381 INFO L125 PetriNetUnfolderBase]: For 262/274 co-relation queries the response was YES. [2023-11-24 21:49:40,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 701 events. 340/701 cut-off events. For 262/274 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3437 event pairs, 165 based on Foata normal form. 8/670 useless extension candidates. Maximal degree in co-relation 1540. Up to 458 conditions per place. [2023-11-24 21:49:40,386 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 31 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2023-11-24 21:49:40,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 278 flow [2023-11-24 21:49:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:49:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:49:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2023-11-24 21:49:40,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2023-11-24 21:49:40,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 153 transitions. [2023-11-24 21:49:40,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 153 transitions. [2023-11-24 21:49:40,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:40,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 153 transitions. [2023-11-24 21:49:40,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.5) internal successors, (153), 6 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 21:49:40,391 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 21:49:40,391 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 21:49:40,391 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 174 flow. Second operand 6 states and 153 transitions. [2023-11-24 21:49:40,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 278 flow [2023-11-24 21:49:40,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 222 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-24 21:49:40,396 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 150 flow [2023-11-24 21:49:40,396 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 21:49:40,397 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2023-11-24 21:49:40,397 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 150 flow [2023-11-24 21:49:40,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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 21:49:40,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:40,397 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 21:49:40,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:40,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:40,601 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:40,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash 511974355, now seen corresponding path program 1 times [2023-11-24 21:49:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:40,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610383205] [2023-11-24 21:49:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:40,603 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 21:49:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:40,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:40,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:40,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-24 21:49:40,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:41,271 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 21:49:41,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:41,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610383205] [2023-11-24 21:49:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610383205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:41,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:49:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385168887] [2023-11-24 21:49:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:41,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:49:41,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:41,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:49:41,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:49:41,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:49:41,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:41,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:41,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:49:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:41,834 INFO L124 PetriNetUnfolderBase]: 501/967 cut-off events. [2023-11-24 21:49:41,834 INFO L125 PetriNetUnfolderBase]: For 317/353 co-relation queries the response was YES. [2023-11-24 21:49:41,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 967 events. 501/967 cut-off events. For 317/353 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4895 event pairs, 106 based on Foata normal form. 8/934 useless extension candidates. Maximal degree in co-relation 2316. Up to 373 conditions per place. [2023-11-24 21:49:41,848 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 59 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2023-11-24 21:49:41,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 436 flow [2023-11-24 21:49:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:49:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:49:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 315 transitions. [2023-11-24 21:49:41,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2023-11-24 21:49:41,851 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 315 transitions. [2023-11-24 21:49:41,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 315 transitions. [2023-11-24 21:49:41,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:41,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 315 transitions. [2023-11-24 21:49:41,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.0) internal successors, (315), 9 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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 21:49:41,856 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 21:49:41,856 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 21:49:41,856 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 150 flow. Second operand 9 states and 315 transitions. [2023-11-24 21:49:41,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 436 flow [2023-11-24 21:49:41,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 414 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:49:41,861 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 190 flow [2023-11-24 21:49:41,861 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-24 21:49:41,862 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2023-11-24 21:49:41,862 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 190 flow [2023-11-24 21:49:41,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:41,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:41,863 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 21:49:41,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:42,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:42,067 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:42,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash 717278209, now seen corresponding path program 2 times [2023-11-24 21:49:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:42,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034674890] [2023-11-24 21:49:42,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:49:42,068 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 21:49:42,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:42,069 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:42,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:42,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 21:49:42,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:49:42,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:49:42,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:42,300 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 21:49:42,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:42,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034674890] [2023-11-24 21:49:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034674890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:42,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936230056] [2023-11-24 21:49:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:42,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:42,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:42,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 21:49:42,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:42,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:42,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 21:49:42,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:42,847 INFO L124 PetriNetUnfolderBase]: 1098/2076 cut-off events. [2023-11-24 21:49:42,847 INFO L125 PetriNetUnfolderBase]: For 1090/1126 co-relation queries the response was YES. [2023-11-24 21:49:42,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5290 conditions, 2076 events. 1098/2076 cut-off events. For 1090/1126 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12073 event pairs, 270 based on Foata normal form. 8/2012 useless extension candidates. Maximal degree in co-relation 5273. Up to 799 conditions per place. [2023-11-24 21:49:42,867 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 58 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2023-11-24 21:49:42,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 463 flow [2023-11-24 21:49:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:49:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:49:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2023-11-24 21:49:42,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2023-11-24 21:49:42,870 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 207 transitions. [2023-11-24 21:49:42,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 207 transitions. [2023-11-24 21:49:42,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:42,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 207 transitions. [2023-11-24 21:49:42,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 21:49:42,873 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 21:49:42,874 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 21:49:42,874 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 190 flow. Second operand 6 states and 207 transitions. [2023-11-24 21:49:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 463 flow [2023-11-24 21:49:42,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 450 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:49:42,880 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 267 flow [2023-11-24 21:49:42,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-11-24 21:49:42,881 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2023-11-24 21:49:42,882 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 267 flow [2023-11-24 21:49:42,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:42,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:42,883 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 21:49:42,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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)] Ended with exit code 0 [2023-11-24 21:49:43,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:43,086 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:43,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1421118241, now seen corresponding path program 3 times [2023-11-24 21:49:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835835050] [2023-11-24 21:49:43,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:49:43,088 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 21:49:43,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:43,090 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:43,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:43,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 21:49:43,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:49:43,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:49:43,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:49:43,360 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 21:49:43,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:49:43,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:49:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835835050] [2023-11-24 21:49:43,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835835050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:43,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:43,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495438156] [2023-11-24 21:49:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:43,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:43,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:49:43,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:43,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:43,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-24 21:49:43,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:43,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:43,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-24 21:49:43,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:44,094 INFO L124 PetriNetUnfolderBase]: 1967/3714 cut-off events. [2023-11-24 21:49:44,095 INFO L125 PetriNetUnfolderBase]: For 2175/2285 co-relation queries the response was YES. [2023-11-24 21:49:44,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9812 conditions, 3714 events. 1967/3714 cut-off events. For 2175/2285 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24751 event pairs, 629 based on Foata normal form. 10/3576 useless extension candidates. Maximal degree in co-relation 9792. Up to 1555 conditions per place. [2023-11-24 21:49:44,129 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 69 selfloop transitions, 14 changer transitions 0/107 dead transitions. [2023-11-24 21:49:44,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 656 flow [2023-11-24 21:49:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:49:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:49:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2023-11-24 21:49:44,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6512345679012346 [2023-11-24 21:49:44,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 211 transitions. [2023-11-24 21:49:44,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 211 transitions. [2023-11-24 21:49:44,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:44,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 211 transitions. [2023-11-24 21:49:44,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 21:49:44,134 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 21:49:44,134 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 21:49:44,135 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 267 flow. Second operand 6 states and 211 transitions. [2023-11-24 21:49:44,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 656 flow [2023-11-24 21:49:44,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:49:44,150 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 455 flow [2023-11-24 21:49:44,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=70, 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=6, PETRI_FLOW=455, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2023-11-24 21:49:44,152 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-11-24 21:49:44,153 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 455 flow [2023-11-24 21:49:44,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:49:44,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:44,154 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 21:49:44,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:44,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:44,358 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:49:44,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 574745629, now seen corresponding path program 4 times [2023-11-24 21:49:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:49:44,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583020375] [2023-11-24 21:49:44,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 21:49:44,360 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 21:49:44,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:49:44,361 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:44,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:44,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 21:49:44,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 21:49:44,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:49:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:49:44,765 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 21:49:44,765 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:49:44,767 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 21:49:44,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 21:49:44,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 21:49:44,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 21:49:44,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 21:49:44,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 21:49:44,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 21:49:44,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 21:49:44,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 21:49:44,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 21:49:44,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 21:49:44,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 21:49:44,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 21:49:44,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:44,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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 21:49:44,974 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:44,981 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:49:44,981 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:49:45,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:49:45,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:49:45,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:49:45,107 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:45,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:49:45,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:49:45 BasicIcfg [2023-11-24 21:49:45,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:49:45,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:49:45,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:49:45,123 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:49:45,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:30" (3/4) ... [2023-11-24 21:49:45,126 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:49:45,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:49:45,128 INFO L158 Benchmark]: Toolchain (without parser) took 17115.27ms. Allocated memory was 98.6MB in the beginning and 297.8MB in the end (delta: 199.2MB). Free memory was 74.6MB in the beginning and 115.6MB in the end (delta: -40.9MB). Peak memory consumption was 161.3MB. Max. memory is 16.1GB. [2023-11-24 21:49:45,128 INFO L158 Benchmark]: CDTParser took 2.91ms. Allocated memory is still 71.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:45,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 865.63ms. Allocated memory is still 98.6MB. Free memory was 74.5MB in the beginning and 75.7MB in the end (delta: -1.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2023-11-24 21:49:45,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.85ms. Allocated memory is still 98.6MB. Free memory was 75.7MB in the beginning and 73.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:45,129 INFO L158 Benchmark]: Boogie Preprocessor took 136.64ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 69.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:49:45,130 INFO L158 Benchmark]: RCFGBuilder took 1215.58ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 73.8MB in the end (delta: -4.4MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2023-11-24 21:49:45,130 INFO L158 Benchmark]: TraceAbstraction took 14790.52ms. Allocated memory was 98.6MB in the beginning and 297.8MB in the end (delta: 199.2MB). Free memory was 73.2MB in the beginning and 116.6MB in the end (delta: -43.4MB). Peak memory consumption was 155.5MB. Max. memory is 16.1GB. [2023-11-24 21:49:45,131 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 297.8MB. Free memory was 116.6MB in the beginning and 115.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:45,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.91ms. Allocated memory is still 71.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 865.63ms. Allocated memory is still 98.6MB. Free memory was 74.5MB in the beginning and 75.7MB in the end (delta: -1.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.85ms. Allocated memory is still 98.6MB. Free memory was 75.7MB in the beginning and 73.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 136.64ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 69.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1215.58ms. Allocated memory is still 98.6MB. Free memory was 69.5MB in the beginning and 73.8MB in the end (delta: -4.4MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14790.52ms. Allocated memory was 98.6MB in the beginning and 297.8MB in the end (delta: 199.2MB). Free memory was 73.2MB in the beginning and 116.6MB in the end (delta: -43.4MB). Peak memory consumption was 155.5MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 297.8MB. Free memory was 116.6MB in the beginning and 115.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={7:0}, t410={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={7:0}, t410={3:0}, t411={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={7:0}, t410={3:0}, t411={5:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={7:0}, t410={3:0}, t411={5:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={7:0}, t410={3:0}, t411={5:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix016.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 843]: 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: 841]: 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: 14.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 559 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 58 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1497 IncrementalHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 24 mSDtfsCounter, 1497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=14, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 226 ConstructedInterpolants, 1 QuantifiedInterpolants, 1740 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1630 ConjunctsInSsa, 78 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 21:49:45,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd717d0d-1dca-4b55-b8f2-0ec69285a2ac/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