./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:12:04,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:12:04,727 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:12:04,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:12:04,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:12:04,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:12:04,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:12:04,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:12:04,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:12:04,766 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:12:04,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:12:04,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:12:04,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:12:04,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:12:04,769 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:12:04,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:12:04,771 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:12:04,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:12:04,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:12:04,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:12:04,774 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:12:04,774 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:12:04,775 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:12:04,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:12:04,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:12:04,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:12:04,777 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:12:04,778 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:12:04,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:12:04,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:12:04,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:12:04,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:12:04,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:04,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:12:04,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:12:04,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:12:04,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:12:04,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:12:04,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:12:04,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:12:04,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:12:04,782 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_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a [2023-11-29 04:12:05,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:12:05,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:12:05,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:12:05,072 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:12:05,072 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:12:05,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2023-11-29 04:12:08,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:12:08,761 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:12:08,762 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2023-11-29 04:12:08,782 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data/4198921c7/c3286a8a6a914f08b587cbd1d176c115/FLAG4c67929a6 [2023-11-29 04:12:08,798 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data/4198921c7/c3286a8a6a914f08b587cbd1d176c115 [2023-11-29 04:12:08,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:12:08,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:12:08,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:08,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:12:08,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:12:08,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:08" (1/1) ... [2023-11-29 04:12:08,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f4d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:08, skipping insertion in model container [2023-11-29 04:12:08,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:08" (1/1) ... [2023-11-29 04:12:08,877 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:12:09,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:09,318 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:12:09,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:09,428 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:12:09,429 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:12:09,438 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:12:09,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09 WrapperNode [2023-11-29 04:12:09,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:09,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:09,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:12:09,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:12:09,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,505 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-29 04:12:09,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:09,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:12:09,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:12:09,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:12:09,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,548 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 04:12:09,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:12:09,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:12:09,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:12:09,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:12:09,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:09,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:09,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:12:09,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:12:09,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:12:09,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:12:09,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:12:09,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:12:09,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:12:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:12:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:12:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:12:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:12:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:12:09,656 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:12:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:12:09,656 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:12:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:12:09,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:12:09,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:12:09,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:12:09,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:12:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:12:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:12:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:12:09,660 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:12:09,834 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:12:09,837 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:12:10,206 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:12:10,424 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:12:10,425 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:12:10,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:10 BoogieIcfgContainer [2023-11-29 04:12:10,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:12:10,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:12:10,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:12:10,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:12:10,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:12:08" (1/3) ... [2023-11-29 04:12:10,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33636e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:10, skipping insertion in model container [2023-11-29 04:12:10,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (2/3) ... [2023-11-29 04:12:10,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33636e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:10, skipping insertion in model container [2023-11-29 04:12:10,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:10" (3/3) ... [2023-11-29 04:12:10,433 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2023-11-29 04:12:10,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:12:10,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 04:12:10,452 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:12:10,500 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:12:10,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 04:12:10,567 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2023-11-29 04:12:10,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:12:10,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-11-29 04:12:10,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 04:12:10,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 53 transitions, 115 flow [2023-11-29 04:12:10,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:12:10,596 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;@7daa8880, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:12:10,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 04:12:10,600 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:12:10,600 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:12:10,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:12:10,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:10,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:12:10,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:10,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash 13370, now seen corresponding path program 1 times [2023-11-29 04:12:10,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118458523] [2023-11-29 04:12:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:10,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:10,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118458523] [2023-11-29 04:12:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118458523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:10,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:10,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611216078] [2023-11-29 04:12:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:10,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:10,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 04:12:10,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:10,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:10,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 04:12:10,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:11,409 INFO L124 PetriNetUnfolderBase]: 557/1145 cut-off events. [2023-11-29 04:12:11,409 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 04:12:11,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 1145 events. 557/1145 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8385 event pairs, 413 based on Foata normal form. 72/1124 useless extension candidates. Maximal degree in co-relation 2017. Up to 647 conditions per place. [2023-11-29 04:12:11,430 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 04:12:11,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 183 flow [2023-11-29 04:12:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:11,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:11,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:11,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:11,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:11,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:11,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,463 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 115 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:11,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 183 flow [2023-11-29 04:12:11,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:12:11,471 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-29 04:12:11,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-29 04:12:11,478 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-29 04:12:11,478 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-29 04:12:11,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:11,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:12:11,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:12:11,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:11,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash 13371, now seen corresponding path program 1 times [2023-11-29 04:12:11,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:11,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512535589] [2023-11-29 04:12:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512535589] [2023-11-29 04:12:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512535589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:11,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724014530] [2023-11-29 04:12:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:11,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:11,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:11,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:11,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:11,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:11,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:11,925 INFO L124 PetriNetUnfolderBase]: 557/1144 cut-off events. [2023-11-29 04:12:11,925 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-29 04:12:11,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 1144 events. 557/1144 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8383 event pairs, 413 based on Foata normal form. 1/1052 useless extension candidates. Maximal degree in co-relation 2053. Up to 646 conditions per place. [2023-11-29 04:12:11,939 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 04:12:11,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 180 flow [2023-11-29 04:12:11,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:11,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:11,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:11,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:11,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:11,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:11,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,946 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:11,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 180 flow [2023-11-29 04:12:11,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:11,952 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 04:12:11,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 04:12:11,954 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-29 04:12:11,954 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 04:12:11,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:11,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:11,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:12:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:12:11,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:11,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 398712959, now seen corresponding path program 1 times [2023-11-29 04:12:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655870373] [2023-11-29 04:12:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655870373] [2023-11-29 04:12:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655870373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:12,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101737411] [2023-11-29 04:12:12,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:12,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:12,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:12,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 04:12:12,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:12,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 04:12:12,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:12,351 INFO L124 PetriNetUnfolderBase]: 558/1143 cut-off events. [2023-11-29 04:12:12,351 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-29 04:12:12,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 1143 events. 558/1143 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8306 event pairs, 334 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 2055. Up to 646 conditions per place. [2023-11-29 04:12:12,364 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 04:12:12,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 180 flow [2023-11-29 04:12:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-29 04:12:12,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2023-11-29 04:12:12,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-29 04:12:12,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-29 04:12:12,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:12,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-29 04:12:12,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,370 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 121 transitions. [2023-11-29 04:12:12,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 180 flow [2023-11-29 04:12:12,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:12,374 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 04:12:12,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, 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-29 04:12:12,376 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2023-11-29 04:12:12,376 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 04:12:12,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:12,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:12:12,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:12:12,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:12,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 398712960, now seen corresponding path program 1 times [2023-11-29 04:12:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428867228] [2023-11-29 04:12:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428867228] [2023-11-29 04:12:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428867228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:12,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662498449] [2023-11-29 04:12:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:12,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:12,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:12,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:12,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:12,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:12,757 INFO L124 PetriNetUnfolderBase]: 557/1140 cut-off events. [2023-11-29 04:12:12,757 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-29 04:12:12,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 1140 events. 557/1140 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8291 event pairs, 334 based on Foata normal form. 2/1054 useless extension candidates. Maximal degree in co-relation 2051. Up to 643 conditions per place. [2023-11-29 04:12:12,770 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 04:12:12,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-29 04:12:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:12,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:12,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:12,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:12,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:12,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:12,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,777 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:12,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-29 04:12:12,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:12,780 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 04:12:12,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 04:12:12,782 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2023-11-29 04:12:12,782 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 04:12:12,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:12,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:12,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:12:12,783 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:12,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1821374361, now seen corresponding path program 1 times [2023-11-29 04:12:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051181601] [2023-11-29 04:12:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:12,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051181601] [2023-11-29 04:12:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051181601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143249595] [2023-11-29 04:12:12,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:12,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:12,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:12,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 04:12:12,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:12,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:12,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 04:12:12,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:13,152 INFO L124 PetriNetUnfolderBase]: 564/1141 cut-off events. [2023-11-29 04:12:13,152 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-29 04:12:13,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1141 events. 564/1141 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8303 event pairs, 238 based on Foata normal form. 0/1065 useless extension candidates. Maximal degree in co-relation 2065. Up to 644 conditions per place. [2023-11-29 04:12:13,163 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 04:12:13,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-29 04:12:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-29 04:12:13,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2023-11-29 04:12:13,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-29 04:12:13,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-29 04:12:13,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:13,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-29 04:12:13,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,167 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 121 transitions. [2023-11-29 04:12:13,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-29 04:12:13,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:13,170 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 04:12:13,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 04:12:13,171 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-11-29 04:12:13,171 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 04:12:13,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:13,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:13,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:12:13,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:13,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1821374360, now seen corresponding path program 1 times [2023-11-29 04:12:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:13,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462348975] [2023-11-29 04:12:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462348975] [2023-11-29 04:12:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462348975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:13,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074387480] [2023-11-29 04:12:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:13,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:13,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:13,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:13,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:13,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:13,599 INFO L124 PetriNetUnfolderBase]: 557/1128 cut-off events. [2023-11-29 04:12:13,599 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 04:12:13,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1128 events. 557/1128 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8160 event pairs, 238 based on Foata normal form. 6/1062 useless extension candidates. Maximal degree in co-relation 2043. Up to 631 conditions per place. [2023-11-29 04:12:13,610 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 04:12:13,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-29 04:12:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:13,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:13,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:13,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:13,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:13,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:13,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,614 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:13,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-29 04:12:13,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:13,617 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 04:12:13,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 04:12:13,618 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -8 predicate places. [2023-11-29 04:12:13,619 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 04:12:13,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:13,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:13,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:12:13,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:13,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2053639799, now seen corresponding path program 1 times [2023-11-29 04:12:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276448857] [2023-11-29 04:12:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:13,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276448857] [2023-11-29 04:12:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276448857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:13,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:13,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440905076] [2023-11-29 04:12:13,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:13,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:13,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 56 [2023-11-29 04:12:13,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:13,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:13,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 56 [2023-11-29 04:12:13,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:14,001 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2023-11-29 04:12:14,001 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 04:12:14,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 880 events. 459/880 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5925 event pairs, 67 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1643. Up to 585 conditions per place. [2023-11-29 04:12:14,009 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-29 04:12:14,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 178 flow [2023-11-29 04:12:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 04:12:14,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7559523809523809 [2023-11-29 04:12:14,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 04:12:14,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 04:12:14,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:14,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 04:12:14,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,015 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 127 transitions. [2023-11-29 04:12:14,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 178 flow [2023-11-29 04:12:14,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:14,017 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-29 04:12:14,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-29 04:12:14,019 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-11-29 04:12:14,019 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-29 04:12:14,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:14,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:14,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:12:14,020 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:14,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1451458205, now seen corresponding path program 1 times [2023-11-29 04:12:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796620706] [2023-11-29 04:12:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:14,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796620706] [2023-11-29 04:12:14,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796620706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:12:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340137760] [2023-11-29 04:12:14,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:14,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:12:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:12:14,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:14,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:14,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:14,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:14,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:15,593 INFO L124 PetriNetUnfolderBase]: 1007/1939 cut-off events. [2023-11-29 04:12:15,594 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-11-29 04:12:15,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 1939 events. 1007/1939 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14649 event pairs, 402 based on Foata normal form. 40/1964 useless extension candidates. Maximal degree in co-relation 3626. Up to 711 conditions per place. [2023-11-29 04:12:15,614 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 46 selfloop transitions, 5 changer transitions 10/80 dead transitions. [2023-11-29 04:12:15,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 302 flow [2023-11-29 04:12:15,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:12:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:12:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 258 transitions. [2023-11-29 04:12:15,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6581632653061225 [2023-11-29 04:12:15,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 258 transitions. [2023-11-29 04:12:15,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 258 transitions. [2023-11-29 04:12:15,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:15,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 258 transitions. [2023-11-29 04:12:15,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,621 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 7 states and 258 transitions. [2023-11-29 04:12:15,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 302 flow [2023-11-29 04:12:15,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:15,624 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 118 flow [2023-11-29 04:12:15,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-11-29 04:12:15,625 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2023-11-29 04:12:15,625 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 118 flow [2023-11-29 04:12:15,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:15,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-29 04:12:15,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:12:15,626 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:15,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1451456985, now seen corresponding path program 1 times [2023-11-29 04:12:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654811876] [2023-11-29 04:12:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654811876] [2023-11-29 04:12:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654811876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:12:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668437469] [2023-11-29 04:12:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:15,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:12:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:12:15,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:15,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:15,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:15,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:16,486 INFO L124 PetriNetUnfolderBase]: 2277/4064 cut-off events. [2023-11-29 04:12:16,487 INFO L125 PetriNetUnfolderBase]: For 247/261 co-relation queries the response was YES. [2023-11-29 04:12:16,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 4064 events. 2277/4064 cut-off events. For 247/261 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29646 event pairs, 211 based on Foata normal form. 158/4213 useless extension candidates. Maximal degree in co-relation 7786. Up to 2223 conditions per place. [2023-11-29 04:12:16,522 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 42 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2023-11-29 04:12:16,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 275 flow [2023-11-29 04:12:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:12:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2023-11-29 04:12:16,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-29 04:12:16,525 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 160 transitions. [2023-11-29 04:12:16,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 160 transitions. [2023-11-29 04:12:16,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:16,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 160 transitions. [2023-11-29 04:12:16,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,527 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,527 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 118 flow. Second operand 4 states and 160 transitions. [2023-11-29 04:12:16,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 275 flow [2023-11-29 04:12:16,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 268 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-29 04:12:16,534 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 146 flow [2023-11-29 04:12:16,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-29 04:12:16,535 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2023-11-29 04:12:16,535 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 146 flow [2023-11-29 04:12:16,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:16,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:16,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:12:16,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:16,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1010050502, now seen corresponding path program 1 times [2023-11-29 04:12:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286834263] [2023-11-29 04:12:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286834263] [2023-11-29 04:12:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286834263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:16,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:16,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091649279] [2023-11-29 04:12:16,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:16,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:12:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:16,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:12:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:12:16,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:16,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:16,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:16,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:17,322 INFO L124 PetriNetUnfolderBase]: 1515/2722 cut-off events. [2023-11-29 04:12:17,322 INFO L125 PetriNetUnfolderBase]: For 841/845 co-relation queries the response was YES. [2023-11-29 04:12:17,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6171 conditions, 2722 events. 1515/2722 cut-off events. For 841/845 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17624 event pairs, 81 based on Foata normal form. 132/2845 useless extension candidates. Maximal degree in co-relation 6155. Up to 1145 conditions per place. [2023-11-29 04:12:17,342 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 52 selfloop transitions, 8 changer transitions 1/81 dead transitions. [2023-11-29 04:12:17,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 367 flow [2023-11-29 04:12:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:12:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:12:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2023-11-29 04:12:17,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2023-11-29 04:12:17,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 201 transitions. [2023-11-29 04:12:17,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 201 transitions. [2023-11-29 04:12:17,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:17,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 201 transitions. [2023-11-29 04:12:17,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,347 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 146 flow. Second operand 5 states and 201 transitions. [2023-11-29 04:12:17,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 367 flow [2023-11-29 04:12:17,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 357 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:17,351 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 186 flow [2023-11-29 04:12:17,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-11-29 04:12:17,352 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2023-11-29 04:12:17,352 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 186 flow [2023-11-29 04:12:17,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:17,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, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:17,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:12:17,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:17,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash -89957174, now seen corresponding path program 1 times [2023-11-29 04:12:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432626662] [2023-11-29 04:12:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432626662] [2023-11-29 04:12:17,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432626662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:17,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:17,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:12:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816276522] [2023-11-29 04:12:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:17,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:17,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:17,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:17,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:17,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:17,999 INFO L124 PetriNetUnfolderBase]: 815/1406 cut-off events. [2023-11-29 04:12:17,999 INFO L125 PetriNetUnfolderBase]: For 1290/1290 co-relation queries the response was YES. [2023-11-29 04:12:18,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 1406 events. 815/1406 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7322 event pairs, 57 based on Foata normal form. 72/1469 useless extension candidates. Maximal degree in co-relation 3710. Up to 524 conditions per place. [2023-11-29 04:12:18,009 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 46 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2023-11-29 04:12:18,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 378 flow [2023-11-29 04:12:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:12:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2023-11-29 04:12:18,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6726190476190477 [2023-11-29 04:12:18,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 226 transitions. [2023-11-29 04:12:18,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 226 transitions. [2023-11-29 04:12:18,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:18,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 226 transitions. [2023-11-29 04:12:18,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,014 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,014 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 186 flow. Second operand 6 states and 226 transitions. [2023-11-29 04:12:18,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 378 flow [2023-11-29 04:12:18,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 348 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-29 04:12:18,021 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 196 flow [2023-11-29 04:12:18,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2023-11-29 04:12:18,022 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2023-11-29 04:12:18,022 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 196 flow [2023-11-29 04:12:18,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:18,022 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, 1, 1] [2023-11-29 04:12:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:12:18,023 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:18,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash -584970068, now seen corresponding path program 1 times [2023-11-29 04:12:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:18,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068597049] [2023-11-29 04:12:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068597049] [2023-11-29 04:12:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068597049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:12:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185448559] [2023-11-29 04:12:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:18,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:18,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:18,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 04:12:18,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:18,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 04:12:18,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:18,933 INFO L124 PetriNetUnfolderBase]: 1329/2581 cut-off events. [2023-11-29 04:12:18,933 INFO L125 PetriNetUnfolderBase]: For 1341/1376 co-relation queries the response was YES. [2023-11-29 04:12:18,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5898 conditions, 2581 events. 1329/2581 cut-off events. For 1341/1376 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16961 event pairs, 409 based on Foata normal form. 16/2491 useless extension candidates. Maximal degree in co-relation 5880. Up to 1183 conditions per place. [2023-11-29 04:12:18,948 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 57 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2023-11-29 04:12:18,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 464 flow [2023-11-29 04:12:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:12:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:12:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 257 transitions. [2023-11-29 04:12:18,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6556122448979592 [2023-11-29 04:12:18,951 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 257 transitions. [2023-11-29 04:12:18,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 257 transitions. [2023-11-29 04:12:18,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:18,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 257 transitions. [2023-11-29 04:12:18,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,954 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,954 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 196 flow. Second operand 7 states and 257 transitions. [2023-11-29 04:12:18,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 464 flow [2023-11-29 04:12:18,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 400 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 04:12:18,966 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 247 flow [2023-11-29 04:12:18,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2023-11-29 04:12:18,967 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2023-11-29 04:12:18,967 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 247 flow [2023-11-29 04:12:18,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:18,968 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, 1, 1] [2023-11-29 04:12:18,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:12:18,968 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:18,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 272565030, now seen corresponding path program 2 times [2023-11-29 04:12:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926161727] [2023-11-29 04:12:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926161727] [2023-11-29 04:12:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926161727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:19,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:12:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921127380] [2023-11-29 04:12:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:19,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:19,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 04:12:19,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:19,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 04:12:19,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:19,807 INFO L124 PetriNetUnfolderBase]: 1853/3776 cut-off events. [2023-11-29 04:12:19,807 INFO L125 PetriNetUnfolderBase]: For 1096/1121 co-relation queries the response was YES. [2023-11-29 04:12:19,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8436 conditions, 3776 events. 1853/3776 cut-off events. For 1096/1121 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 27486 event pairs, 655 based on Foata normal form. 29/3620 useless extension candidates. Maximal degree in co-relation 8417. Up to 1523 conditions per place. [2023-11-29 04:12:19,830 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 57 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2023-11-29 04:12:19,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 505 flow [2023-11-29 04:12:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:12:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2023-11-29 04:12:19,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6726190476190477 [2023-11-29 04:12:19,833 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 226 transitions. [2023-11-29 04:12:19,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 226 transitions. [2023-11-29 04:12:19,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:19,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 226 transitions. [2023-11-29 04:12:19,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,837 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,837 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 247 flow. Second operand 6 states and 226 transitions. [2023-11-29 04:12:19,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 505 flow [2023-11-29 04:12:19,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 505 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:12:19,848 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 336 flow [2023-11-29 04:12:19,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2023-11-29 04:12:19,849 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2023-11-29 04:12:19,849 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 336 flow [2023-11-29 04:12:19,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:19,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, 1, 1] [2023-11-29 04:12:19,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:12:19,850 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:19,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -641868140, now seen corresponding path program 1 times [2023-11-29 04:12:19,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:19,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333908153] [2023-11-29 04:12:19,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:20,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333908153] [2023-11-29 04:12:20,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333908153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:20,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:20,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:12:20,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867655807] [2023-11-29 04:12:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:20,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:12:20,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:20,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:12:20,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:12:20,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2023-11-29 04:12:20,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 336 flow. Second operand has 10 states, 10 states have (on average 28.0) internal successors, (280), 10 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:20,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:20,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2023-11-29 04:12:20,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:21,715 INFO L124 PetriNetUnfolderBase]: 2698/5431 cut-off events. [2023-11-29 04:12:21,716 INFO L125 PetriNetUnfolderBase]: For 3514/3596 co-relation queries the response was YES. [2023-11-29 04:12:21,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13176 conditions, 5431 events. 2698/5431 cut-off events. For 3514/3596 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 43255 event pairs, 1152 based on Foata normal form. 44/5138 useless extension candidates. Maximal degree in co-relation 13152. Up to 1581 conditions per place. [2023-11-29 04:12:21,735 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 23 selfloop transitions, 5 changer transitions 58/115 dead transitions. [2023-11-29 04:12:21,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 115 transitions, 686 flow [2023-11-29 04:12:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:12:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:12:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 296 transitions. [2023-11-29 04:12:21,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2023-11-29 04:12:21,737 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 296 transitions. [2023-11-29 04:12:21,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 296 transitions. [2023-11-29 04:12:21,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:21,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 296 transitions. [2023-11-29 04:12:21,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 32.888888888888886) internal successors, (296), 9 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,741 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,741 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 336 flow. Second operand 9 states and 296 transitions. [2023-11-29 04:12:21,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 115 transitions, 686 flow [2023-11-29 04:12:21,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 115 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:12:21,768 INFO L231 Difference]: Finished difference. Result has 84 places, 54 transitions, 222 flow [2023-11-29 04:12:21,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=84, PETRI_TRANSITIONS=54} [2023-11-29 04:12:21,769 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 23 predicate places. [2023-11-29 04:12:21,769 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 54 transitions, 222 flow [2023-11-29 04:12:21,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 28.0) internal successors, (280), 10 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:21,769 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, 1, 1] [2023-11-29 04:12:21,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:12:21,770 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:21,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1315365152, now seen corresponding path program 3 times [2023-11-29 04:12:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131710022] [2023-11-29 04:12:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:21,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131710022] [2023-11-29 04:12:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131710022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:12:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108201109] [2023-11-29 04:12:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:22,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:12:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:12:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:12:22,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 04:12:22,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 54 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:22,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:22,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 04:12:22,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:22,582 INFO L124 PetriNetUnfolderBase]: 1217/2460 cut-off events. [2023-11-29 04:12:22,582 INFO L125 PetriNetUnfolderBase]: For 1088/1088 co-relation queries the response was YES. [2023-11-29 04:12:22,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5695 conditions, 2460 events. 1217/2460 cut-off events. For 1088/1088 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16963 event pairs, 366 based on Foata normal form. 16/2320 useless extension candidates. Maximal degree in co-relation 5670. Up to 1197 conditions per place. [2023-11-29 04:12:22,591 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 25 selfloop transitions, 3 changer transitions 38/89 dead transitions. [2023-11-29 04:12:22,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 89 transitions, 473 flow [2023-11-29 04:12:22,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:12:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:12:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 279 transitions. [2023-11-29 04:12:22,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6227678571428571 [2023-11-29 04:12:22,594 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 279 transitions. [2023-11-29 04:12:22,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 279 transitions. [2023-11-29 04:12:22,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:22,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 279 transitions. [2023-11-29 04:12:22,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:22,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 56.0) internal successors, (504), 9 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:22,599 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 56.0) internal successors, (504), 9 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:22,599 INFO L175 Difference]: Start difference. First operand has 84 places, 54 transitions, 222 flow. Second operand 8 states and 279 transitions. [2023-11-29 04:12:22,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 89 transitions, 473 flow [2023-11-29 04:12:22,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 89 transitions, 446 flow, removed 8 selfloop flow, removed 9 redundant places. [2023-11-29 04:12:22,605 INFO L231 Difference]: Finished difference. Result has 77 places, 46 transitions, 167 flow [2023-11-29 04:12:22,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=77, PETRI_TRANSITIONS=46} [2023-11-29 04:12:22,606 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2023-11-29 04:12:22,606 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 46 transitions, 167 flow [2023-11-29 04:12:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:22,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:22,607 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, 1, 1] [2023-11-29 04:12:22,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:12:22,607 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:22,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:22,607 INFO L85 PathProgramCache]: Analyzing trace with hash -35277880, now seen corresponding path program 4 times [2023-11-29 04:12:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:22,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897111399] [2023-11-29 04:12:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897111399] [2023-11-29 04:12:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897111399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:12:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415644254] [2023-11-29 04:12:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:23,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:12:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:23,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:12:23,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:23,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:23,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 46 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:23,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:23,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:23,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:24,331 INFO L124 PetriNetUnfolderBase]: 286/654 cut-off events. [2023-11-29 04:12:24,331 INFO L125 PetriNetUnfolderBase]: For 75/81 co-relation queries the response was YES. [2023-11-29 04:12:24,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 654 events. 286/654 cut-off events. For 75/81 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3214 event pairs, 44 based on Foata normal form. 8/618 useless extension candidates. Maximal degree in co-relation 1356. Up to 135 conditions per place. [2023-11-29 04:12:24,335 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 22 selfloop transitions, 5 changer transitions 18/72 dead transitions. [2023-11-29 04:12:24,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 317 flow [2023-11-29 04:12:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:12:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:12:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2023-11-29 04:12:24,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2023-11-29 04:12:24,339 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 356 transitions. [2023-11-29 04:12:24,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 356 transitions. [2023-11-29 04:12:24,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:24,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 356 transitions. [2023-11-29 04:12:24,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 35.6) internal successors, (356), 10 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 56.0) internal successors, (616), 11 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,344 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 56.0) internal successors, (616), 11 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,344 INFO L175 Difference]: Start difference. First operand has 77 places, 46 transitions, 167 flow. Second operand 10 states and 356 transitions. [2023-11-29 04:12:24,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 317 flow [2023-11-29 04:12:24,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 288 flow, removed 8 selfloop flow, removed 10 redundant places. [2023-11-29 04:12:24,348 INFO L231 Difference]: Finished difference. Result has 75 places, 46 transitions, 164 flow [2023-11-29 04:12:24,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=164, PETRI_PLACES=75, PETRI_TRANSITIONS=46} [2023-11-29 04:12:24,349 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2023-11-29 04:12:24,349 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 46 transitions, 164 flow [2023-11-29 04:12:24,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:24,350 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, 1, 1] [2023-11-29 04:12:24,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:12:24,350 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:24,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash -520635868, now seen corresponding path program 5 times [2023-11-29 04:12:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:24,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290388704] [2023-11-29 04:12:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:12:24,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:12:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:12:24,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:12:24,525 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:12:24,526 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 04:12:24,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 04:12:24,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 04:12:24,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 04:12:24,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 04:12:24,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 04:12:24,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 04:12:24,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 04:12:24,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 04:12:24,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 04:12:24,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 04:12:24,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 04:12:24,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 04:12:24,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:12:24,531 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:24,538 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:12:24,538 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:12:24,610 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:12:24,612 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:12:24,613 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:12:24,627 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:12:24,628 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:12:24,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:12:24 BasicIcfg [2023-11-29 04:12:24,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:12:24,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:12:24,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:12:24,643 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:12:24,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:10" (3/4) ... [2023-11-29 04:12:24,646 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:12:24,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:12:24,648 INFO L158 Benchmark]: Toolchain (without parser) took 15845.03ms. Allocated memory was 146.8MB in the beginning and 408.9MB in the end (delta: 262.1MB). Free memory was 113.3MB in the beginning and 268.4MB in the end (delta: -155.0MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2023-11-29 04:12:24,648 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:24,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.64ms. Allocated memory is still 146.8MB. Free memory was 113.3MB in the beginning and 89.0MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:24,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.55ms. Allocated memory is still 146.8MB. Free memory was 88.8MB in the beginning and 86.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:12:24,649 INFO L158 Benchmark]: Boogie Preprocessor took 68.80ms. Allocated memory is still 146.8MB. Free memory was 85.4MB in the beginning and 81.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:12:24,649 INFO L158 Benchmark]: RCFGBuilder took 849.93ms. Allocated memory is still 146.8MB. Free memory was 81.9MB in the beginning and 91.6MB in the end (delta: -9.7MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2023-11-29 04:12:24,650 INFO L158 Benchmark]: TraceAbstraction took 14214.76ms. Allocated memory was 146.8MB in the beginning and 408.9MB in the end (delta: 262.1MB). Free memory was 90.6MB in the beginning and 268.4MB in the end (delta: -177.8MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2023-11-29 04:12:24,650 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 408.9MB. Free memory is still 268.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:24,652 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.27ms. Allocated memory is still 98.6MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.64ms. Allocated memory is still 146.8MB. Free memory was 113.3MB in the beginning and 89.0MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.55ms. Allocated memory is still 146.8MB. Free memory was 88.8MB in the beginning and 86.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.80ms. Allocated memory is still 146.8MB. Free memory was 85.4MB in the beginning and 81.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 849.93ms. Allocated memory is still 146.8MB. Free memory was 81.9MB in the beginning and 91.6MB in the end (delta: -9.7MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14214.76ms. Allocated memory was 146.8MB in the beginning and 408.9MB in the end (delta: 262.1MB). Free memory was 90.6MB in the beginning and 268.4MB in the end (delta: -177.8MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 408.9MB. Free memory is still 268.4MB. 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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={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] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={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=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] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={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=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, 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] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 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) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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=1, 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] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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=1, 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] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=1, 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] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L831] 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) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 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 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L873] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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", "mix010.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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, 83 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.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 866 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 732 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2463 IncrementalHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 41 mSDtfsCounter, 2463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=13, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 2924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:12:24,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:12:26,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:12:27,056 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:12:27,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:12:27,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:12:27,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:12:27,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:12:27,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:12:27,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:12:27,110 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:12:27,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:12:27,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:12:27,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:12:27,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:12:27,114 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:12:27,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:12:27,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:12:27,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:12:27,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:12:27,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:12:27,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:12:27,118 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:12:27,119 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:12:27,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:12:27,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:12:27,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:12:27,121 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:12:27,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:12:27,122 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:12:27,122 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:12:27,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:12:27,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:12:27,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:12:27,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:12:27,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:27,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:12:27,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:12:27,125 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:12:27,126 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:12:27,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:12:27,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:12:27,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:12:27,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:12:27,127 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:12:27,128 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_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a [2023-11-29 04:12:27,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:12:27,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:12:27,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:12:27,485 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:12:27,485 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:12:27,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2023-11-29 04:12:30,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:12:31,051 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:12:31,052 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2023-11-29 04:12:31,072 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data/f8ebaf274/bbe99595fd904977ab6c5848f5b6c947/FLAGacc690fc6 [2023-11-29 04:12:31,090 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/data/f8ebaf274/bbe99595fd904977ab6c5848f5b6c947 [2023-11-29 04:12:31,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:12:31,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:12:31,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:31,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:12:31,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:12:31,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1bd524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31, skipping insertion in model container [2023-11-29 04:12:31,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,167 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:12:31,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:31,677 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:12:31,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:31,794 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:12:31,794 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:12:31,803 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:12:31,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31 WrapperNode [2023-11-29 04:12:31,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:31,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:31,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:12:31,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:12:31,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,871 INFO L138 Inliner]: procedures = 179, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-29 04:12:31,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:31,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:12:31,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:12:31,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:12:31,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,912 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 04:12:31,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:12:31,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:12:31,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:12:31,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:12:31,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:31,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:31,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:12:31,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:12:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:12:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:12:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:12:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:12:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:12:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:12:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:12:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:12:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:12:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:12:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:12:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:12:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:12:32,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:12:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:12:32,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:12:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:12:32,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:12:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:12:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:12:32,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:12:32,036 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:12:32,230 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:12:32,233 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:12:32,635 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:12:32,903 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:12:32,904 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:12:32,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:32 BoogieIcfgContainer [2023-11-29 04:12:32,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:12:32,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:12:32,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:12:32,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:12:32,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:12:31" (1/3) ... [2023-11-29 04:12:32,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f2481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:32, skipping insertion in model container [2023-11-29 04:12:32,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (2/3) ... [2023-11-29 04:12:32,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f2481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:32, skipping insertion in model container [2023-11-29 04:12:32,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:32" (3/3) ... [2023-11-29 04:12:32,915 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2023-11-29 04:12:32,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:12:32,940 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 04:12:32,940 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:12:33,009 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:12:33,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 04:12:33,119 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2023-11-29 04:12:33,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:12:33,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-11-29 04:12:33,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 04:12:33,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 53 transitions, 115 flow [2023-11-29 04:12:33,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:12:33,146 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;@7230c989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:12:33,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 04:12:33,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:12:33,150 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:12:33,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:12:33,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:33,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:12:33,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:33,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 13434, now seen corresponding path program 1 times [2023-11-29 04:12:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510637990] [2023-11-29 04:12:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:33,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:33,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:33,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:33,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:12:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:33,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:12:33,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:33,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:12:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:33,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:33,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510637990] [2023-11-29 04:12:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510637990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:33,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:33,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520649715] [2023-11-29 04:12:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:33,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:33,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:33,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 04:12:33,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:33,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:33,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 04:12:33,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:33,942 INFO L124 PetriNetUnfolderBase]: 557/1145 cut-off events. [2023-11-29 04:12:33,942 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 04:12:33,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 1145 events. 557/1145 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8506 event pairs, 413 based on Foata normal form. 72/1124 useless extension candidates. Maximal degree in co-relation 2017. Up to 647 conditions per place. [2023-11-29 04:12:33,963 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 04:12:33,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 183 flow [2023-11-29 04:12:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:33,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:33,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:33,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:33,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:33,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:33,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:33,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:33,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:33,997 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 115 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:33,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 183 flow [2023-11-29 04:12:34,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:12:34,006 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-29 04:12:34,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-29 04:12:34,013 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-29 04:12:34,013 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-29 04:12:34,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:34,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:12:34,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:12:34,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:34,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:34,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:34,216 INFO L85 PathProgramCache]: Analyzing trace with hash 13435, now seen corresponding path program 1 times [2023-11-29 04:12:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:34,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505261689] [2023-11-29 04:12:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:34,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:34,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:34,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:12:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:34,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:12:34,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:34,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:12:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:34,344 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:34,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505261689] [2023-11-29 04:12:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505261689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:34,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:34,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969020697] [2023-11-29 04:12:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:34,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:34,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:34,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:34,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:34,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:34,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:34,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:34,714 INFO L124 PetriNetUnfolderBase]: 557/1144 cut-off events. [2023-11-29 04:12:34,715 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-29 04:12:34,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 1144 events. 557/1144 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8565 event pairs, 413 based on Foata normal form. 1/1052 useless extension candidates. Maximal degree in co-relation 2053. Up to 646 conditions per place. [2023-11-29 04:12:34,725 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 04:12:34,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 180 flow [2023-11-29 04:12:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:34,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:34,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:34,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:34,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:34,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:34,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,734 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:34,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 180 flow [2023-11-29 04:12:34,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:34,740 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 04:12:34,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 04:12:34,741 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-29 04:12:34,741 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 04:12:34,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:34,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:12:34,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:12:34,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:34,943 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:34,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 400623491, now seen corresponding path program 1 times [2023-11-29 04:12:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526668608] [2023-11-29 04:12:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:34,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:34,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:34,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:12:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:35,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:12:35,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:35,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:12:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:35,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:35,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526668608] [2023-11-29 04:12:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526668608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070290263] [2023-11-29 04:12:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:35,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:35,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 04:12:35,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:35,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:35,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 04:12:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:35,402 INFO L124 PetriNetUnfolderBase]: 558/1142 cut-off events. [2023-11-29 04:12:35,403 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-29 04:12:35,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 1142 events. 558/1142 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8474 event pairs, 413 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 2054. Up to 646 conditions per place. [2023-11-29 04:12:35,415 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 04:12:35,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 180 flow [2023-11-29 04:12:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-29 04:12:35,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2023-11-29 04:12:35,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-29 04:12:35,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-29 04:12:35,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:35,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-29 04:12:35,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:35,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:35,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:35,422 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 121 transitions. [2023-11-29 04:12:35,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 180 flow [2023-11-29 04:12:35,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:35,426 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 04:12:35,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, 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-29 04:12:35,427 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2023-11-29 04:12:35,428 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 04:12:35,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:35,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:35,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:12:35,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:12:35,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:35,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:35,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash 400623492, now seen corresponding path program 1 times [2023-11-29 04:12:35,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329609005] [2023-11-29 04:12:35,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:35,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:35,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:35,635 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:35,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:12:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:35,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:12:35,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:35,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:12:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:35,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:35,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:35,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329609005] [2023-11-29 04:12:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329609005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641909452] [2023-11-29 04:12:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:35,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:35,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:35,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:35,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:35,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:35,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:35,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:36,097 INFO L124 PetriNetUnfolderBase]: 557/1139 cut-off events. [2023-11-29 04:12:36,098 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-29 04:12:36,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1139 events. 557/1139 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8492 event pairs, 412 based on Foata normal form. 2/1053 useless extension candidates. Maximal degree in co-relation 2050. Up to 643 conditions per place. [2023-11-29 04:12:36,110 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 04:12:36,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-29 04:12:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:36,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:36,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:36,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:36,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:36,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:36,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,118 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:36,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-29 04:12:36,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:36,122 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 04:12:36,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 04:12:36,123 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2023-11-29 04:12:36,124 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 04:12:36,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:36,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:36,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:12:36,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:36,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:36,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -739286489, now seen corresponding path program 1 times [2023-11-29 04:12:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661789450] [2023-11-29 04:12:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:36,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:36,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:36,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:36,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:12:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:36,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:12:36,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:36,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:12:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:36,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:36,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661789450] [2023-11-29 04:12:36,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661789450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:36,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:36,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328769400] [2023-11-29 04:12:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:36,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:36,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:36,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:36,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:36,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 04:12:36,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:36,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 04:12:36,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:36,757 INFO L124 PetriNetUnfolderBase]: 564/1126 cut-off events. [2023-11-29 04:12:36,757 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-29 04:12:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1126 events. 564/1126 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8058 event pairs, 427 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 2050. Up to 644 conditions per place. [2023-11-29 04:12:36,768 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 04:12:36,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-29 04:12:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-29 04:12:36,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2023-11-29 04:12:36,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-29 04:12:36,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-29 04:12:36,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:36,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-29 04:12:36,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,773 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 121 transitions. [2023-11-29 04:12:36,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-29 04:12:36,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:36,777 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 04:12:36,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 04:12:36,778 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-11-29 04:12:36,779 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 04:12:36,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:36,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:36,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:12:36,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:36,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:36,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -739286488, now seen corresponding path program 1 times [2023-11-29 04:12:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:36,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604914322] [2023-11-29 04:12:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:36,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:36,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:36,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:12:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:37,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:12:37,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:37,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:12:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:37,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:37,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:37,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604914322] [2023-11-29 04:12:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604914322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:37,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470736700] [2023-11-29 04:12:37,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:37,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:37,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:37,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:37,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:37,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:37,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:37,368 INFO L124 PetriNetUnfolderBase]: 557/1110 cut-off events. [2023-11-29 04:12:37,368 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 04:12:37,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 1110 events. 557/1110 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7781 event pairs, 420 based on Foata normal form. 6/1048 useless extension candidates. Maximal degree in co-relation 2025. Up to 631 conditions per place. [2023-11-29 04:12:37,377 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 04:12:37,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-29 04:12:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-29 04:12:37,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-29 04:12:37,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-29 04:12:37,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-29 04:12:37,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:37,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-29 04:12:37,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,382 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 123 transitions. [2023-11-29 04:12:37,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-29 04:12:37,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:37,386 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 04:12:37,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 04:12:37,387 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -8 predicate places. [2023-11-29 04:12:37,387 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 04:12:37,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:37,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:37,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:12:37,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:37,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:37,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash 508908917, now seen corresponding path program 1 times [2023-11-29 04:12:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795979105] [2023-11-29 04:12:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:37,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:37,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:37,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:37,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:12:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:37,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:12:37,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:37,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:37,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:37,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795979105] [2023-11-29 04:12:37,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795979105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:37,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:37,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545530360] [2023-11-29 04:12:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:37,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:37,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:37,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 56 [2023-11-29 04:12:37,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:37,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 56 [2023-11-29 04:12:37,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:37,972 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2023-11-29 04:12:37,972 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 04:12:37,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 880 events. 459/880 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6068 event pairs, 67 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1643. Up to 585 conditions per place. [2023-11-29 04:12:37,981 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-29 04:12:37,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 178 flow [2023-11-29 04:12:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:12:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 04:12:37,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7559523809523809 [2023-11-29 04:12:37,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 04:12:37,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 04:12:37,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:37,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 04:12:37,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,985 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 127 transitions. [2023-11-29 04:12:37,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 178 flow [2023-11-29 04:12:37,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:37,988 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-29 04:12:37,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-29 04:12:37,989 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-11-29 04:12:37,989 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-29 04:12:37,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:37,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:37,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:37,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:12:38,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:38,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:38,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1106397159, now seen corresponding path program 1 times [2023-11-29 04:12:38,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:38,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477210859] [2023-11-29 04:12:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:38,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:38,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:38,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:12:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:38,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:12:38,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:38,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:38,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:38,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477210859] [2023-11-29 04:12:38,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477210859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:38,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:38,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:12:38,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728537211] [2023-11-29 04:12:38,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:38,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:12:38,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:38,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:12:38,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:38,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:38,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:38,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:38,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:38,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:38,723 INFO L124 PetriNetUnfolderBase]: 1217/2189 cut-off events. [2023-11-29 04:12:38,723 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-29 04:12:38,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4169 conditions, 2189 events. 1217/2189 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14674 event pairs, 107 based on Foata normal form. 72/2252 useless extension candidates. Maximal degree in co-relation 4158. Up to 1213 conditions per place. [2023-11-29 04:12:38,743 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 40 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2023-11-29 04:12:38,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 240 flow [2023-11-29 04:12:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:12:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2023-11-29 04:12:38,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-29 04:12:38,745 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 160 transitions. [2023-11-29 04:12:38,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 160 transitions. [2023-11-29 04:12:38,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:38,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 160 transitions. [2023-11-29 04:12:38,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:38,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:38,748 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:38,748 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 4 states and 160 transitions. [2023-11-29 04:12:38,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 240 flow [2023-11-29 04:12:38,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:38,751 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 124 flow [2023-11-29 04:12:38,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, 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=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 04:12:38,752 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-11-29 04:12:38,752 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 124 flow [2023-11-29 04:12:38,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:38,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:38,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:38,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-29 04:12:38,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:38,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:38,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1707535488, now seen corresponding path program 1 times [2023-11-29 04:12:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:38,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584338435] [2023-11-29 04:12:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:38,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:38,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:38,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:38,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:12:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:39,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:12:39,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:39,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:39,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584338435] [2023-11-29 04:12:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584338435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:39,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:39,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929141457] [2023-11-29 04:12:39,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:39,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:12:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:39,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:12:39,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:12:39,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:39,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:39,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:39,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:39,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:39,552 INFO L124 PetriNetUnfolderBase]: 801/1455 cut-off events. [2023-11-29 04:12:39,553 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-11-29 04:12:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1455 events. 801/1455 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8575 event pairs, 41 based on Foata normal form. 64/1510 useless extension candidates. Maximal degree in co-relation 3208. Up to 625 conditions per place. [2023-11-29 04:12:39,564 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 50 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2023-11-29 04:12:39,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 329 flow [2023-11-29 04:12:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:12:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:12:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2023-11-29 04:12:39,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2023-11-29 04:12:39,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 201 transitions. [2023-11-29 04:12:39,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 201 transitions. [2023-11-29 04:12:39,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:39,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 201 transitions. [2023-11-29 04:12:39,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:39,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:39,569 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:39,569 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 124 flow. Second operand 5 states and 201 transitions. [2023-11-29 04:12:39,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 329 flow [2023-11-29 04:12:39,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 319 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:12:39,573 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 164 flow [2023-11-29 04:12:39,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-11-29 04:12:39,574 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-29 04:12:39,575 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 164 flow [2023-11-29 04:12:39,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:39,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:39,575 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] [2023-11-29 04:12:39,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:12:39,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:39,776 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:39,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -863380028, now seen corresponding path program 1 times [2023-11-29 04:12:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:39,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338114437] [2023-11-29 04:12:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:39,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:39,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:39,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:39,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:12:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:39,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:12:39,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:40,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:40,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338114437] [2023-11-29 04:12:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338114437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:40,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:12:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887684107] [2023-11-29 04:12:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:40,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:40,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:40,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:40,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:40,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:40,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:40,316 INFO L124 PetriNetUnfolderBase]: 423/741 cut-off events. [2023-11-29 04:12:40,316 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2023-11-29 04:12:40,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 741 events. 423/741 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3354 event pairs, 29 based on Foata normal form. 36/768 useless extension candidates. Maximal degree in co-relation 1916. Up to 268 conditions per place. [2023-11-29 04:12:40,323 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 44 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2023-11-29 04:12:40,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 340 flow [2023-11-29 04:12:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:12:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2023-11-29 04:12:40,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6726190476190477 [2023-11-29 04:12:40,325 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 226 transitions. [2023-11-29 04:12:40,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 226 transitions. [2023-11-29 04:12:40,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:40,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 226 transitions. [2023-11-29 04:12:40,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:40,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:40,328 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:40,328 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 164 flow. Second operand 6 states and 226 transitions. [2023-11-29 04:12:40,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 340 flow [2023-11-29 04:12:40,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 315 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 04:12:40,332 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 178 flow [2023-11-29 04:12:40,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-11-29 04:12:40,333 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-11-29 04:12:40,333 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 178 flow [2023-11-29 04:12:40,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:40,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:40,334 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, 1, 1] [2023-11-29 04:12:40,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:12:40,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:40,538 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:40,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1662465804, now seen corresponding path program 1 times [2023-11-29 04:12:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:40,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892696114] [2023-11-29 04:12:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:40,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:40,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:40,541 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:40,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:12:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:40,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:12:40,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:43,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:43,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892696114] [2023-11-29 04:12:43,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892696114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:43,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:43,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:43,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351511716] [2023-11-29 04:12:43,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:43,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:43,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:43,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:43,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:44,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 04:12:44,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:44,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:44,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 04:12:44,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:45,141 INFO L124 PetriNetUnfolderBase]: 205/444 cut-off events. [2023-11-29 04:12:45,141 INFO L125 PetriNetUnfolderBase]: For 192/204 co-relation queries the response was YES. [2023-11-29 04:12:45,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 444 events. 205/444 cut-off events. For 192/204 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2049 event pairs, 170 based on Foata normal form. 8/426 useless extension candidates. Maximal degree in co-relation 971. Up to 292 conditions per place. [2023-11-29 04:12:45,144 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 19 selfloop transitions, 3 changer transitions 4/54 dead transitions. [2023-11-29 04:12:45,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 242 flow [2023-11-29 04:12:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:12:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2023-11-29 04:12:45,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5803571428571429 [2023-11-29 04:12:45,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 195 transitions. [2023-11-29 04:12:45,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 195 transitions. [2023-11-29 04:12:45,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:45,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 195 transitions. [2023-11-29 04:12:45,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,148 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 178 flow. Second operand 6 states and 195 transitions. [2023-11-29 04:12:45,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 242 flow [2023-11-29 04:12:45,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 186 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 04:12:45,151 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 124 flow [2023-11-29 04:12:45,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-11-29 04:12:45,152 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-29 04:12:45,152 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 124 flow [2023-11-29 04:12:45,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:45,153 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, 1, 1] [2023-11-29 04:12:45,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:12:45,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:45,353 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:45,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1692125340, now seen corresponding path program 1 times [2023-11-29 04:12:45,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:45,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34698953] [2023-11-29 04:12:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:45,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:45,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:12:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:45,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:12:45,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:45,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:45,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34698953] [2023-11-29 04:12:45,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34698953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:12:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799727679] [2023-11-29 04:12:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:45,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:45,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:45,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:45,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 04:12:45,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:45,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 04:12:45,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:45,817 INFO L124 PetriNetUnfolderBase]: 472/980 cut-off events. [2023-11-29 04:12:45,817 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 04:12:45,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 980 events. 472/980 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5538 event pairs, 134 based on Foata normal form. 8/941 useless extension candidates. Maximal degree in co-relation 1850. Up to 402 conditions per place. [2023-11-29 04:12:45,822 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 25 selfloop transitions, 1 changer transitions 23/74 dead transitions. [2023-11-29 04:12:45,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 286 flow [2023-11-29 04:12:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:12:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2023-11-29 04:12:45,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 04:12:45,825 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 224 transitions. [2023-11-29 04:12:45,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 224 transitions. [2023-11-29 04:12:45,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:45,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 224 transitions. [2023-11-29 04:12:45,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,828 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,828 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 124 flow. Second operand 6 states and 224 transitions. [2023-11-29 04:12:45,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 286 flow [2023-11-29 04:12:45,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 278 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:12:45,830 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 130 flow [2023-11-29 04:12:45,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-11-29 04:12:45,831 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-11-29 04:12:45,831 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 130 flow [2023-11-29 04:12:45,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:45,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:45,832 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, 1, 1] [2023-11-29 04:12:45,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:12:46,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:46,036 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:46,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1265484608, now seen corresponding path program 2 times [2023-11-29 04:12:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102119429] [2023-11-29 04:12:46,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:12:46,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:46,038 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:46,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:12:46,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:12:46,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:12:46,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:12:46,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:46,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:46,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102119429] [2023-11-29 04:12:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102119429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:46,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:12:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570868737] [2023-11-29 04:12:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:46,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:46,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:46,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 04:12:46,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:46,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:46,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 04:12:46,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:46,607 INFO L124 PetriNetUnfolderBase]: 616/1330 cut-off events. [2023-11-29 04:12:46,607 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 04:12:46,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 1330 events. 616/1330 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8152 event pairs, 137 based on Foata normal form. 8/1279 useless extension candidates. Maximal degree in co-relation 2538. Up to 457 conditions per place. [2023-11-29 04:12:46,613 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 24 selfloop transitions, 1 changer transitions 25/75 dead transitions. [2023-11-29 04:12:46,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 298 flow [2023-11-29 04:12:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:12:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2023-11-29 04:12:46,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2023-11-29 04:12:46,615 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 225 transitions. [2023-11-29 04:12:46,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 225 transitions. [2023-11-29 04:12:46,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:46,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 225 transitions. [2023-11-29 04:12:46,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:46,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:46,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:46,617 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 130 flow. Second operand 6 states and 225 transitions. [2023-11-29 04:12:46,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 298 flow [2023-11-29 04:12:46,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 287 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:12:46,620 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 134 flow [2023-11-29 04:12:46,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-11-29 04:12:46,621 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2023-11-29 04:12:46,622 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 134 flow [2023-11-29 04:12:46,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:46,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:46,622 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, 1, 1] [2023-11-29 04:12:46,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:12:46,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:46,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:46,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1784983602, now seen corresponding path program 3 times [2023-11-29 04:12:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014724520] [2023-11-29 04:12:46,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:12:46,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:46,826 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:46,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:12:46,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 04:12:46,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:12:46,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 04:12:46,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:47,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:47,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:47,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014724520] [2023-11-29 04:12:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014724520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:47,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:12:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159182538] [2023-11-29 04:12:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:47,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:12:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:12:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:47,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 04:12:47,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:47,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:12:47,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 04:12:47,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:12:48,413 INFO L124 PetriNetUnfolderBase]: 348/767 cut-off events. [2023-11-29 04:12:48,414 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:12:48,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 767 events. 348/767 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4157 event pairs, 82 based on Foata normal form. 8/719 useless extension candidates. Maximal degree in co-relation 1506. Up to 202 conditions per place. [2023-11-29 04:12:48,418 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 20 selfloop transitions, 4 changer transitions 21/72 dead transitions. [2023-11-29 04:12:48,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 280 flow [2023-11-29 04:12:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:12:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:12:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 325 transitions. [2023-11-29 04:12:48,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6448412698412699 [2023-11-29 04:12:48,421 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 325 transitions. [2023-11-29 04:12:48,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 325 transitions. [2023-11-29 04:12:48,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:12:48,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 325 transitions. [2023-11-29 04:12:48,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.111111111111114) internal successors, (325), 9 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:48,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:48,425 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:48,425 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 134 flow. Second operand 9 states and 325 transitions. [2023-11-29 04:12:48,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 280 flow [2023-11-29 04:12:48,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 269 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:12:48,428 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 144 flow [2023-11-29 04:12:48,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=144, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2023-11-29 04:12:48,429 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2023-11-29 04:12:48,429 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 144 flow [2023-11-29 04:12:48,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:48,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:12:48,430 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, 1, 1] [2023-11-29 04:12:48,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:12:48,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:48,633 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 04:12:48,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1005010526, now seen corresponding path program 4 times [2023-11-29 04:12:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:48,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191647489] [2023-11-29 04:12:48,634 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:12:48,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:48,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:48,635 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:48,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:12:48,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:12:48,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 04:12:48,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:12:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:12:48,981 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 04:12:48,982 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:12:48,983 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 04:12:48,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 04:12:48,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 04:12:48,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 04:12:48,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 04:12:48,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 04:12:48,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 04:12:48,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 04:12:48,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 04:12:48,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 04:12:48,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 04:12:48,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 04:12:48,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 04:12:48,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-29 04:12:49,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:49,193 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:49,200 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:12:49,200 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:12:49,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:12:49,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:12:49,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:12:49,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:12:49,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 04:12:49,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:12:49 BasicIcfg [2023-11-29 04:12:49,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:12:49,331 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:12:49,331 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:12:49,331 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:12:49,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:32" (3/4) ... [2023-11-29 04:12:49,334 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:12:49,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:12:49,336 INFO L158 Benchmark]: Toolchain (without parser) took 18241.11ms. Allocated memory was 77.6MB in the beginning and 197.1MB in the end (delta: 119.5MB). Free memory was 50.6MB in the beginning and 157.9MB in the end (delta: -107.2MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2023-11-29 04:12:49,336 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 58.7MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:49,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.01ms. Allocated memory is still 77.6MB. Free memory was 50.4MB in the beginning and 43.3MB in the end (delta: 7.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2023-11-29 04:12:49,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.75ms. Allocated memory is still 77.6MB. Free memory was 43.0MB in the beginning and 40.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:49,337 INFO L158 Benchmark]: Boogie Preprocessor took 69.50ms. Allocated memory is still 77.6MB. Free memory was 40.3MB in the beginning and 36.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:12:49,338 INFO L158 Benchmark]: RCFGBuilder took 961.68ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 36.7MB in the beginning and 57.5MB in the end (delta: -20.8MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-11-29 04:12:49,338 INFO L158 Benchmark]: TraceAbstraction took 16422.35ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 57.0MB in the beginning and 157.9MB in the end (delta: -100.9MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2023-11-29 04:12:49,339 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 197.1MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:49,341 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.38ms. Allocated memory is still 58.7MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.01ms. Allocated memory is still 77.6MB. Free memory was 50.4MB in the beginning and 43.3MB in the end (delta: 7.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.75ms. Allocated memory is still 77.6MB. Free memory was 43.0MB in the beginning and 40.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.50ms. Allocated memory is still 77.6MB. Free memory was 40.3MB in the beginning and 36.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 961.68ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 36.7MB in the beginning and 57.5MB in the end (delta: -20.8MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16422.35ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 57.0MB in the beginning and 157.9MB in the end (delta: -100.9MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 197.1MB. Free memory is still 157.9MB. 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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={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] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={7:0}, t261={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=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] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={7:0}, t261={6:0}, t262={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=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, 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] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 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) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, 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=1, 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] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, 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=1, 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] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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=1, 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] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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=1, 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] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, 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=1, 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] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L831] 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) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={7:0}, t261={6:0}, t262={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 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 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={7:0}, t261={6:0}, t262={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={7:0}, t261={6:0}, t262={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L873] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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", "mix010.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 858]: 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: 856]: 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, 83 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: 16.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 539 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1467 IncrementalHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 22 mSDtfsCounter, 1467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=10, 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.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 241 ConstructedInterpolants, 24 QuantifiedInterpolants, 2891 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1706 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:12:49,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3be42ee2-3ec8-4414-a747-ad70c3a7075f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample