./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.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_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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_6208df7c-899e-478a-8f5a-50b12dfb672e/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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:22:11,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:22:11,740 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:22:11,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:22:11,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:22:11,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:22:11,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:22:11,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:22:11,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:22:11,769 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:22:11,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:22:11,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:22:11,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:22:11,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:22:11,772 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:22:11,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:22:11,773 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:22:11,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:22:11,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:22:11,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:22:11,775 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:22:11,776 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:22:11,777 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:22:11,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:22:11,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:22:11,778 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:22:11,778 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:22:11,778 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:22:11,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:22:11,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:22:11,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:22:11,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:22:11,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:22:11,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:22:11,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:22:11,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:22:11,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:22:11,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:22:11,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:22:11,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:22:11,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:22:11,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_6208df7c-899e-478a-8f5a-50b12dfb672e/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_6208df7c-899e-478a-8f5a-50b12dfb672e/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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2023-11-29 06:22:12,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:22:12,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:22:12,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:22:12,026 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:22:12,027 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:22:12,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 06:22:14,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:22:14,951 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:22:14,952 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 06:22:14,967 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data/4b960d957/73aa5cd2d6ba4a2ca655260b06b46802/FLAGe71928f62 [2023-11-29 06:22:14,988 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data/4b960d957/73aa5cd2d6ba4a2ca655260b06b46802 [2023-11-29 06:22:14,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:22:14,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:22:14,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:22:14,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:22:14,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:22:14,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:22:14" (1/1) ... [2023-11-29 06:22:15,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b36e163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15, skipping insertion in model container [2023-11-29 06:22:15,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:22:14" (1/1) ... [2023-11-29 06:22:15,065 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:22:15,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:22:15,376 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:22:15,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:22:15,464 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:22:15,464 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:22:15,472 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:22:15,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15 WrapperNode [2023-11-29 06:22:15,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:22:15,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:22:15,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:22:15,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:22:15,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,526 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-11-29 06:22:15,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:22:15,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:22:15,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:22:15,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:22:15,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,564 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 06:22:15,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:22:15,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:22:15,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:22:15,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:22:15,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (1/1) ... [2023-11-29 06:22:15,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:22:15,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:22:15,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:22:15,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:22:15,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:22:15,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:22:15,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:22:15,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:22:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:22:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:22:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:22:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:22:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 06:22:15,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 06:22:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 06:22:15,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 06:22:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 06:22:15,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 06:22:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:22:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:22:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:22:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:22:15,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:22:15,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:22:15,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:22:15,670 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 06:22:15,810 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:22:15,811 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:22:16,100 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:22:16,282 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:22:16,283 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:22:16,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:22:16 BoogieIcfgContainer [2023-11-29 06:22:16,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:22:16,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:22:16,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:22:16,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:22:16,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:22:14" (1/3) ... [2023-11-29 06:22:16,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ea59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:22:16, skipping insertion in model container [2023-11-29 06:22:16,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:22:15" (2/3) ... [2023-11-29 06:22:16,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ea59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:22:16, skipping insertion in model container [2023-11-29 06:22:16,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:22:16" (3/3) ... [2023-11-29 06:22:16,292 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 06:22:16,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:22:16,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 06:22:16,312 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:22:16,364 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:22:16,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 06:22:16,433 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2023-11-29 06:22:16,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:22:16,436 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 113 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 06:22:16,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 06:22:16,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 53 transitions, 115 flow [2023-11-29 06:22:16,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:22:16,457 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;@24691809, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:22:16,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 06:22:16,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:22:16,461 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 06:22:16,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:22:16,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:16,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:22:16,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:16,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash 12739, now seen corresponding path program 1 times [2023-11-29 06:22:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907310589] [2023-11-29 06:22:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:16,778 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 06:22:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907310589] [2023-11-29 06:22:16,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907310589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:16,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:22:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117748996] [2023-11-29 06:22:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:16,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:22:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:22:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:22:16,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:22:16,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:16,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:16,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:22:16,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:17,272 INFO L124 PetriNetUnfolderBase]: 1057/2055 cut-off events. [2023-11-29 06:22:17,272 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 06:22:17,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 2055 events. 1057/2055 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13997 event pairs, 791 based on Foata normal form. 120/1973 useless extension candidates. Maximal degree in co-relation 3667. Up to 1193 conditions per place. [2023-11-29 06:22:17,291 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 30 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 06:22:17,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 189 flow [2023-11-29 06:22:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:22:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:22:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-29 06:22:17,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2023-11-29 06:22:17,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-29 06:22:17,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-29 06:22:17,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:17,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-29 06:22:17,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:17,311 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 06:22:17,312 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 06:22:17,314 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 115 flow. Second operand 3 states and 122 transitions. [2023-11-29 06:22:17,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 189 flow [2023-11-29 06:22:17,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:22:17,320 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-29 06:22:17,322 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 06:22:17,325 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-29 06:22:17,325 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-29 06:22:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:17,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:17,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:22:17,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:22:17,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:17,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash 12740, now seen corresponding path program 1 times [2023-11-29 06:22:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621108972] [2023-11-29 06:22:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:17,445 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 06:22:17,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621108972] [2023-11-29 06:22:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621108972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:17,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:17,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:22:17,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536218150] [2023-11-29 06:22:17,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:17,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:22:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:22:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:22:17,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 06:22:17,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 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 06:22:17,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:17,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 06:22:17,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:17,822 INFO L124 PetriNetUnfolderBase]: 1057/2054 cut-off events. [2023-11-29 06:22:17,823 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 06:22:17,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 2054 events. 1057/2054 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14039 event pairs, 791 based on Foata normal form. 1/1853 useless extension candidates. Maximal degree in co-relation 3727. Up to 1192 conditions per place. [2023-11-29 06:22:17,841 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 06:22:17,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 186 flow [2023-11-29 06:22:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:22:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:22:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-29 06:22:17,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2023-11-29 06:22:17,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-29 06:22:17,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-29 06:22:17,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:17,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-29 06:22:17,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:17,847 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 06:22:17,847 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 06:22:17,847 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 122 transitions. [2023-11-29 06:22:17,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 186 flow [2023-11-29 06:22:17,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:17,852 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 06:22:17,852 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 06:22:17,853 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-29 06:22:17,853 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 06:22:17,853 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 06:22:17,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:17,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:22:17,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:22:17,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:17,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash 379894083, now seen corresponding path program 1 times [2023-11-29 06:22:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147434117] [2023-11-29 06:22:17,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:17,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:17,977 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 06:22:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:17,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147434117] [2023-11-29 06:22:17,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147434117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:17,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:17,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:22:17,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998678334] [2023-11-29 06:22:17,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:17,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:22:17,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:22:17,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:22:17,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 06:22:17,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 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 06:22:17,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:17,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 06:22:17,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:18,281 INFO L124 PetriNetUnfolderBase]: 825/1487 cut-off events. [2023-11-29 06:22:18,282 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 06:22:18,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1487 events. 825/1487 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8803 event pairs, 457 based on Foata normal form. 0/1466 useless extension candidates. Maximal degree in co-relation 2804. Up to 1009 conditions per place. [2023-11-29 06:22:18,294 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 33 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2023-11-29 06:22:18,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 216 flow [2023-11-29 06:22:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:22:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:22:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-29 06:22:18,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7797619047619048 [2023-11-29 06:22:18,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-29 06:22:18,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-29 06:22:18,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:18,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-29 06:22:18,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:18,299 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 06:22:18,299 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 06:22:18,299 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 131 transitions. [2023-11-29 06:22:18,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 216 flow [2023-11-29 06:22:18,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:18,302 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 102 flow [2023-11-29 06:22:18,302 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=102, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-29 06:22:18,303 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2023-11-29 06:22:18,303 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 102 flow [2023-11-29 06:22:18,303 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 06:22:18,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:18,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:22:18,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:22:18,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:18,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash 379892579, now seen corresponding path program 1 times [2023-11-29 06:22:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615601455] [2023-11-29 06:22:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:18,356 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 06:22:18,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:18,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615601455] [2023-11-29 06:22:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615601455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:18,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:18,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:22:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251823132] [2023-11-29 06:22:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:18,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:22:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:18,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:22:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:22:18,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:22:18,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:18,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:18,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:22:18,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:18,645 INFO L124 PetriNetUnfolderBase]: 724/1471 cut-off events. [2023-11-29 06:22:18,646 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-29 06:22:18,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 1471 events. 724/1471 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9820 event pairs, 416 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 2688. Up to 940 conditions per place. [2023-11-29 06:22:18,658 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 06:22:18,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-29 06:22:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:22:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:22:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:22:18,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2023-11-29 06:22:18,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:22:18,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:22:18,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:18,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:22:18,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:18,662 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 06:22:18,662 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 06:22:18,663 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 102 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:22:18,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-29 06:22:18,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:18,665 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 06:22:18,665 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 06:22:18,666 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-11-29 06:22:18,666 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 06:22:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:18,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:18,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:22:18,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:22:18,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:18,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 379892580, now seen corresponding path program 1 times [2023-11-29 06:22:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069493707] [2023-11-29 06:22:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:18,730 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 06:22:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069493707] [2023-11-29 06:22:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069493707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:18,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:18,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:22:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909560993] [2023-11-29 06:22:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:18,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:22:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:18,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:22:18,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:22:18,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 06:22:18,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 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 06:22:18,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:18,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 06:22:18,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:19,011 INFO L124 PetriNetUnfolderBase]: 721/1464 cut-off events. [2023-11-29 06:22:19,011 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 06:22:19,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 1464 events. 721/1464 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9775 event pairs, 416 based on Foata normal form. 4/1399 useless extension candidates. Maximal degree in co-relation 2633. Up to 933 conditions per place. [2023-11-29 06:22:19,023 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 06:22:19,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 170 flow [2023-11-29 06:22:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:22:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:22:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:22:19,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2023-11-29 06:22:19,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:22:19,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:22:19,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:19,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:22:19,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:19,026 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 06:22:19,027 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 06:22:19,027 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:22:19,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 170 flow [2023-11-29 06:22:19,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:19,029 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 06:22:19,029 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 06:22:19,030 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -8 predicate places. [2023-11-29 06:22:19,030 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 06:22:19,030 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 06:22:19,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:19,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:22:19,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:22:19,031 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:19,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 141384815, now seen corresponding path program 1 times [2023-11-29 06:22:19,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791697094] [2023-11-29 06:22:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:19,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:19,077 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 06:22:19,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:19,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791697094] [2023-11-29 06:22:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791697094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:22:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401277073] [2023-11-29 06:22:19,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:19,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:22:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:22:19,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:22:19,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:22:19,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:19,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:19,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:22:19,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:19,343 INFO L124 PetriNetUnfolderBase]: 738/1469 cut-off events. [2023-11-29 06:22:19,343 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 06:22:19,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 1469 events. 738/1469 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9732 event pairs, 260 based on Foata normal form. 0/1426 useless extension candidates. Maximal degree in co-relation 2667. Up to 934 conditions per place. [2023-11-29 06:22:19,352 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 06:22:19,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 170 flow [2023-11-29 06:22:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:22:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:22:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:22:19,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2023-11-29 06:22:19,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:22:19,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:22:19,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:19,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:22:19,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:19,355 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 06:22:19,355 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 06:22:19,355 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:22:19,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 170 flow [2023-11-29 06:22:19,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:19,358 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 06:22:19,358 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=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-29 06:22:19,359 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-11-29 06:22:19,359 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 06:22:19,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:19,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:19,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:22:19,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:22:19,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:19,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 141384816, now seen corresponding path program 1 times [2023-11-29 06:22:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950895653] [2023-11-29 06:22:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:19,418 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 06:22:19,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:19,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950895653] [2023-11-29 06:22:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950895653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:19,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:22:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066949340] [2023-11-29 06:22:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:19,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:22:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:22:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:22:19,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 06:22:19,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 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 06:22:19,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:19,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 06:22:19,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:19,643 INFO L124 PetriNetUnfolderBase]: 721/1440 cut-off events. [2023-11-29 06:22:19,643 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 06:22:19,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 1440 events. 721/1440 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9559 event pairs, 260 based on Foata normal form. 12/1413 useless extension candidates. Maximal degree in co-relation 2617. Up to 905 conditions per place. [2023-11-29 06:22:19,652 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 06:22:19,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 166 flow [2023-11-29 06:22:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:22:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:22:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:22:19,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2023-11-29 06:22:19,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:22:19,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:22:19,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:19,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:22:19,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:19,656 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 06:22:19,656 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 06:22:19,656 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:22:19,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 166 flow [2023-11-29 06:22:19,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:19,659 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-29 06:22:19,659 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=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-29 06:22:19,660 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2023-11-29 06:22:19,660 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-29 06:22:19,660 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 06:22:19,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:19,661 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 06:22:19,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:22:19,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:19,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1750502056, now seen corresponding path program 1 times [2023-11-29 06:22:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652487568] [2023-11-29 06:22:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:20,123 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 06:22:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652487568] [2023-11-29 06:22:20,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652487568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:20,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:20,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:22:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026803583] [2023-11-29 06:22:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:20,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:22:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:20,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:22:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:22:20,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 06:22:20,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:20,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:20,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 06:22:20,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:20,856 INFO L124 PetriNetUnfolderBase]: 1504/2794 cut-off events. [2023-11-29 06:22:20,856 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-11-29 06:22:20,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5235 conditions, 2794 events. 1504/2794 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 20088 event pairs, 477 based on Foata normal form. 60/2823 useless extension candidates. Maximal degree in co-relation 5225. Up to 916 conditions per place. [2023-11-29 06:22:20,874 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 51 selfloop transitions, 6 changer transitions 11/87 dead transitions. [2023-11-29 06:22:20,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 332 flow [2023-11-29 06:22:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:22:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:22:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2023-11-29 06:22:20,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6760204081632653 [2023-11-29 06:22:20,876 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 265 transitions. [2023-11-29 06:22:20,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 265 transitions. [2023-11-29 06:22:20,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:20,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 265 transitions. [2023-11-29 06:22:20,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:20,878 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 06:22:20,879 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 06:22:20,879 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 7 states and 265 transitions. [2023-11-29 06:22:20,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 332 flow [2023-11-29 06:22:20,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:20,881 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 129 flow [2023-11-29 06:22:20,881 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-11-29 06:22:20,882 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2023-11-29 06:22:20,882 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 129 flow [2023-11-29 06:22:20,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:20,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:20,883 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 06:22:20,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:22:20,883 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:20,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1750503308, now seen corresponding path program 1 times [2023-11-29 06:22:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126348643] [2023-11-29 06:22:20,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:21,084 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 06:22:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:21,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126348643] [2023-11-29 06:22:21,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126348643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:21,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:21,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:22:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468487893] [2023-11-29 06:22:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:21,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:22:21,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:22:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:22:21,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2023-11-29 06:22:21,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:21,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:21,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2023-11-29 06:22:21,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:23,111 INFO L124 PetriNetUnfolderBase]: 10443/16818 cut-off events. [2023-11-29 06:22:23,111 INFO L125 PetriNetUnfolderBase]: For 1751/1753 co-relation queries the response was YES. [2023-11-29 06:22:23,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33959 conditions, 16818 events. 10443/16818 cut-off events. For 1751/1753 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 128708 event pairs, 2654 based on Foata normal form. 0/16320 useless extension candidates. Maximal degree in co-relation 33943. Up to 6321 conditions per place. [2023-11-29 06:22:23,181 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 91 selfloop transitions, 31 changer transitions 16/153 dead transitions. [2023-11-29 06:22:23,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 665 flow [2023-11-29 06:22:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:22:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:22:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 353 transitions. [2023-11-29 06:22:23,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7003968253968254 [2023-11-29 06:22:23,183 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 353 transitions. [2023-11-29 06:22:23,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 353 transitions. [2023-11-29 06:22:23,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:23,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 353 transitions. [2023-11-29 06:22:23,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.22222222222222) internal successors, (353), 9 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:23,187 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 06:22:23,187 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 06:22:23,187 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 129 flow. Second operand 9 states and 353 transitions. [2023-11-29 06:22:23,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 153 transitions, 665 flow [2023-11-29 06:22:23,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 153 transitions, 660 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 06:22:23,197 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 367 flow [2023-11-29 06:22:23,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=367, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-11-29 06:22:23,198 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2023-11-29 06:22:23,198 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 367 flow [2023-11-29 06:22:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:23,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:23,198 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] [2023-11-29 06:22:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:22:23,199 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:23,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -225130261, now seen corresponding path program 1 times [2023-11-29 06:22:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:23,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938361087] [2023-11-29 06:22:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:23,365 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 06:22:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:23,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938361087] [2023-11-29 06:22:23,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938361087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:23,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:22:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884770335] [2023-11-29 06:22:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:23,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:22:23,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:23,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:22:23,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:22:23,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2023-11-29 06:22:23,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:23,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:23,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2023-11-29 06:22:23,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:25,840 INFO L124 PetriNetUnfolderBase]: 11769/19022 cut-off events. [2023-11-29 06:22:25,840 INFO L125 PetriNetUnfolderBase]: For 27320/27325 co-relation queries the response was YES. [2023-11-29 06:22:25,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57971 conditions, 19022 events. 11769/19022 cut-off events. For 27320/27325 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 147802 event pairs, 1333 based on Foata normal form. 406/19388 useless extension candidates. Maximal degree in co-relation 57948. Up to 4455 conditions per place. [2023-11-29 06:22:25,933 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 127 selfloop transitions, 52 changer transitions 17/211 dead transitions. [2023-11-29 06:22:25,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 211 transitions, 1440 flow [2023-11-29 06:22:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:22:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 06:22:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 439 transitions. [2023-11-29 06:22:25,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6532738095238095 [2023-11-29 06:22:25,936 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 439 transitions. [2023-11-29 06:22:25,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 439 transitions. [2023-11-29 06:22:25,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:25,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 439 transitions. [2023-11-29 06:22:25,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 36.583333333333336) internal successors, (439), 12 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:25,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:25,941 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:25,941 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 367 flow. Second operand 12 states and 439 transitions. [2023-11-29 06:22:25,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 211 transitions, 1440 flow [2023-11-29 06:22:26,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 211 transitions, 1440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:22:26,084 INFO L231 Difference]: Finished difference. Result has 91 places, 109 transitions, 837 flow [2023-11-29 06:22:26,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=837, PETRI_PLACES=91, PETRI_TRANSITIONS=109} [2023-11-29 06:22:26,085 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 30 predicate places. [2023-11-29 06:22:26,085 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 109 transitions, 837 flow [2023-11-29 06:22:26,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:26,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:26,086 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] [2023-11-29 06:22:26,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:22:26,086 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:26,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1025225745, now seen corresponding path program 1 times [2023-11-29 06:22:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244057243] [2023-11-29 06:22:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:26,309 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 06:22:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244057243] [2023-11-29 06:22:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244057243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:26,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:26,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:22:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129552342] [2023-11-29 06:22:26,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:26,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:22:26,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:26,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:22:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:22:26,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2023-11-29 06:22:26,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 109 transitions, 837 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:26,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:26,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2023-11-29 06:22:26,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:29,269 INFO L124 PetriNetUnfolderBase]: 13050/21062 cut-off events. [2023-11-29 06:22:29,270 INFO L125 PetriNetUnfolderBase]: For 56110/56115 co-relation queries the response was YES. [2023-11-29 06:22:29,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74912 conditions, 21062 events. 13050/21062 cut-off events. For 56110/56115 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 165932 event pairs, 2600 based on Foata normal form. 170/21220 useless extension candidates. Maximal degree in co-relation 74879. Up to 6040 conditions per place. [2023-11-29 06:22:29,465 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 111 selfloop transitions, 61 changer transitions 99/286 dead transitions. [2023-11-29 06:22:29,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 286 transitions, 2603 flow [2023-11-29 06:22:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:22:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 06:22:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 445 transitions. [2023-11-29 06:22:29,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6622023809523809 [2023-11-29 06:22:29,468 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 445 transitions. [2023-11-29 06:22:29,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 445 transitions. [2023-11-29 06:22:29,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:29,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 445 transitions. [2023-11-29 06:22:29,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:29,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:29,471 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:29,471 INFO L175 Difference]: Start difference. First operand has 91 places, 109 transitions, 837 flow. Second operand 12 states and 445 transitions. [2023-11-29 06:22:29,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 286 transitions, 2603 flow [2023-11-29 06:22:30,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 286 transitions, 2579 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-29 06:22:30,167 INFO L231 Difference]: Finished difference. Result has 111 places, 114 transitions, 1145 flow [2023-11-29 06:22:30,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1145, PETRI_PLACES=111, PETRI_TRANSITIONS=114} [2023-11-29 06:22:30,168 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 50 predicate places. [2023-11-29 06:22:30,168 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 114 transitions, 1145 flow [2023-11-29 06:22:30,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:30,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:30,168 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] [2023-11-29 06:22:30,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:22:30,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:30,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 813035719, now seen corresponding path program 1 times [2023-11-29 06:22:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023670936] [2023-11-29 06:22:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:30,700 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 06:22:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:30,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023670936] [2023-11-29 06:22:30,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023670936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:30,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:30,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:22:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20359043] [2023-11-29 06:22:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:30,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:22:30,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:22:30,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:22:30,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2023-11-29 06:22:30,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 114 transitions, 1145 flow. Second operand has 10 states, 10 states have (on average 27.5) internal successors, (275), 10 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:30,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:30,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2023-11-29 06:22:30,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:34,439 INFO L124 PetriNetUnfolderBase]: 12510/22901 cut-off events. [2023-11-29 06:22:34,439 INFO L125 PetriNetUnfolderBase]: For 102854/107060 co-relation queries the response was YES. [2023-11-29 06:22:34,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81797 conditions, 22901 events. 12510/22901 cut-off events. For 102854/107060 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 222616 event pairs, 6941 based on Foata normal form. 912/22408 useless extension candidates. Maximal degree in co-relation 81752. Up to 9426 conditions per place. [2023-11-29 06:22:34,591 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 86 selfloop transitions, 21 changer transitions 38/209 dead transitions. [2023-11-29 06:22:34,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 209 transitions, 2395 flow [2023-11-29 06:22:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:22:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:22:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2023-11-29 06:22:34,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2023-11-29 06:22:34,593 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 272 transitions. [2023-11-29 06:22:34,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 272 transitions. [2023-11-29 06:22:34,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:34,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 272 transitions. [2023-11-29 06:22:34,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:34,595 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 06:22:34,595 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 06:22:34,595 INFO L175 Difference]: Start difference. First operand has 111 places, 114 transitions, 1145 flow. Second operand 8 states and 272 transitions. [2023-11-29 06:22:34,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 209 transitions, 2395 flow [2023-11-29 06:22:35,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 209 transitions, 2077 flow, removed 69 selfloop flow, removed 12 redundant places. [2023-11-29 06:22:35,885 INFO L231 Difference]: Finished difference. Result has 109 places, 133 transitions, 1272 flow [2023-11-29 06:22:35,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1272, PETRI_PLACES=109, PETRI_TRANSITIONS=133} [2023-11-29 06:22:35,886 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 48 predicate places. [2023-11-29 06:22:35,886 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 133 transitions, 1272 flow [2023-11-29 06:22:35,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.5) internal successors, (275), 10 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:35,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:35,887 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] [2023-11-29 06:22:35,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:22:35,887 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:35,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash 771342091, now seen corresponding path program 2 times [2023-11-29 06:22:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:35,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782183225] [2023-11-29 06:22:35,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:36,434 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 06:22:36,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:36,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782183225] [2023-11-29 06:22:36,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782183225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:36,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:36,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:22:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257131256] [2023-11-29 06:22:36,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:36,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:22:36,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:36,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:22:36,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:22:36,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 06:22:36,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 133 transitions, 1272 flow. Second operand has 10 states, 10 states have (on average 28.5) internal successors, (285), 10 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:36,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:36,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 06:22:36,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:42,723 INFO L124 PetriNetUnfolderBase]: 17737/33140 cut-off events. [2023-11-29 06:22:42,723 INFO L125 PetriNetUnfolderBase]: For 129951/136025 co-relation queries the response was YES. [2023-11-29 06:22:42,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122964 conditions, 33140 events. 17737/33140 cut-off events. For 129951/136025 co-relation queries the response was YES. Maximal size of possible extension queue 2353. Compared 344502 event pairs, 8238 based on Foata normal form. 1103/32291 useless extension candidates. Maximal degree in co-relation 122918. Up to 16568 conditions per place. [2023-11-29 06:22:42,972 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 102 selfloop transitions, 29 changer transitions 40/235 dead transitions. [2023-11-29 06:22:42,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 235 transitions, 2579 flow [2023-11-29 06:22:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:22:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:22:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 316 transitions. [2023-11-29 06:22:42,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2023-11-29 06:22:42,974 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 316 transitions. [2023-11-29 06:22:42,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 316 transitions. [2023-11-29 06:22:42,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:42,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 316 transitions. [2023-11-29 06:22:42,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:42,978 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 06:22:42,978 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 06:22:42,979 INFO L175 Difference]: Start difference. First operand has 109 places, 133 transitions, 1272 flow. Second operand 9 states and 316 transitions. [2023-11-29 06:22:42,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 235 transitions, 2579 flow [2023-11-29 06:22:44,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 235 transitions, 2545 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-29 06:22:44,786 INFO L231 Difference]: Finished difference. Result has 122 places, 151 transitions, 1572 flow [2023-11-29 06:22:44,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1572, PETRI_PLACES=122, PETRI_TRANSITIONS=151} [2023-11-29 06:22:44,787 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 61 predicate places. [2023-11-29 06:22:44,788 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 1572 flow [2023-11-29 06:22:44,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 28.5) internal successors, (285), 10 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:44,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:44,788 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] [2023-11-29 06:22:44,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:22:44,789 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:44,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1028243893, now seen corresponding path program 3 times [2023-11-29 06:22:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316521381] [2023-11-29 06:22:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:45,394 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 06:22:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316521381] [2023-11-29 06:22:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316521381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:22:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467914995] [2023-11-29 06:22:45,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:45,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:22:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:22:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:22:45,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2023-11-29 06:22:45,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 1572 flow. Second operand has 10 states, 10 states have (on average 27.5) internal successors, (275), 10 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:45,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:45,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2023-11-29 06:22:45,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:22:52,240 INFO L124 PetriNetUnfolderBase]: 17029/32453 cut-off events. [2023-11-29 06:22:52,240 INFO L125 PetriNetUnfolderBase]: For 179963/185792 co-relation queries the response was YES. [2023-11-29 06:22:52,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136202 conditions, 32453 events. 17029/32453 cut-off events. For 179963/185792 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 342085 event pairs, 8376 based on Foata normal form. 1035/31587 useless extension candidates. Maximal degree in co-relation 136149. Up to 21071 conditions per place. [2023-11-29 06:22:52,561 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 65 selfloop transitions, 45 changer transitions 34/203 dead transitions. [2023-11-29 06:22:52,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 203 transitions, 2433 flow [2023-11-29 06:22:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:22:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:22:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 263 transitions. [2023-11-29 06:22:52,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5870535714285714 [2023-11-29 06:22:52,563 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 263 transitions. [2023-11-29 06:22:52,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 263 transitions. [2023-11-29 06:22:52,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:22:52,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 263 transitions. [2023-11-29 06:22:52,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:52,566 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 06:22:52,566 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 06:22:52,566 INFO L175 Difference]: Start difference. First operand has 122 places, 151 transitions, 1572 flow. Second operand 8 states and 263 transitions. [2023-11-29 06:22:52,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 203 transitions, 2433 flow [2023-11-29 06:22:54,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 203 transitions, 2382 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-11-29 06:22:54,608 INFO L231 Difference]: Finished difference. Result has 126 places, 142 transitions, 1527 flow [2023-11-29 06:22:54,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1527, PETRI_PLACES=126, PETRI_TRANSITIONS=142} [2023-11-29 06:22:54,609 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 65 predicate places. [2023-11-29 06:22:54,609 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 142 transitions, 1527 flow [2023-11-29 06:22:54,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.5) internal successors, (275), 10 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:22:54,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:22:54,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:22:54,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:22:54,610 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:22:54,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 575603058, now seen corresponding path program 1 times [2023-11-29 06:22:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:22:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064335375] [2023-11-29 06:22:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:22:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:54,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 06:22:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:54,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064335375] [2023-11-29 06:22:54,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064335375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:22:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847495971] [2023-11-29 06:22:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:22:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:22:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:22:54,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 06:22:54,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 142 transitions, 1527 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 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 06:22:54,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:22:54,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 06:22:54,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:02,383 INFO L124 PetriNetUnfolderBase]: 25933/45884 cut-off events. [2023-11-29 06:23:02,383 INFO L125 PetriNetUnfolderBase]: For 234491/245328 co-relation queries the response was YES. [2023-11-29 06:23:02,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174767 conditions, 45884 events. 25933/45884 cut-off events. For 234491/245328 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 440722 event pairs, 3745 based on Foata normal form. 1991/46330 useless extension candidates. Maximal degree in co-relation 174715. Up to 25604 conditions per place. [2023-11-29 06:23:02,803 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 108 selfloop transitions, 5 changer transitions 4/170 dead transitions. [2023-11-29 06:23:02,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 170 transitions, 1902 flow [2023-11-29 06:23:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:23:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:23:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2023-11-29 06:23:02,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098214285714286 [2023-11-29 06:23:02,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 159 transitions. [2023-11-29 06:23:02,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 159 transitions. [2023-11-29 06:23:02,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:02,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 159 transitions. [2023-11-29 06:23:02,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:02,807 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 06:23:02,807 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 06:23:02,807 INFO L175 Difference]: Start difference. First operand has 126 places, 142 transitions, 1527 flow. Second operand 4 states and 159 transitions. [2023-11-29 06:23:02,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 170 transitions, 1902 flow [2023-11-29 06:23:04,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 170 transitions, 1814 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-11-29 06:23:04,287 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 1250 flow [2023-11-29 06:23:04,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1250, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2023-11-29 06:23:04,288 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 65 predicate places. [2023-11-29 06:23:04,288 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 1250 flow [2023-11-29 06:23:04,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 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 06:23:04,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:04,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:23:04,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:23:04,288 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:04,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1904788309, now seen corresponding path program 1 times [2023-11-29 06:23:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:23:04,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804217134] [2023-11-29 06:23:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:23:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:04,428 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 06:23:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:23:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804217134] [2023-11-29 06:23:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804217134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:04,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:23:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486436980] [2023-11-29 06:23:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:04,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:23:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:23:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:23:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:23:04,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 06:23:04,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 1250 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:04,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:04,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 06:23:04,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:09,249 INFO L124 PetriNetUnfolderBase]: 15556/27509 cut-off events. [2023-11-29 06:23:09,250 INFO L125 PetriNetUnfolderBase]: For 131086/137353 co-relation queries the response was YES. [2023-11-29 06:23:09,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106763 conditions, 27509 events. 15556/27509 cut-off events. For 131086/137353 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 240677 event pairs, 1831 based on Foata normal form. 1449/27973 useless extension candidates. Maximal degree in co-relation 106709. Up to 8649 conditions per place. [2023-11-29 06:23:09,663 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 110 selfloop transitions, 8 changer transitions 11/170 dead transitions. [2023-11-29 06:23:09,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 170 transitions, 1791 flow [2023-11-29 06:23:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:23:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:23:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2023-11-29 06:23:09,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2023-11-29 06:23:09,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 201 transitions. [2023-11-29 06:23:09,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 201 transitions. [2023-11-29 06:23:09,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:09,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 201 transitions. [2023-11-29 06:23:09,666 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 06:23:09,667 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 06:23:09,667 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 06:23:09,667 INFO L175 Difference]: Start difference. First operand has 126 places, 130 transitions, 1250 flow. Second operand 5 states and 201 transitions. [2023-11-29 06:23:09,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 170 transitions, 1791 flow [2023-11-29 06:23:09,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 170 transitions, 1731 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 06:23:09,964 INFO L231 Difference]: Finished difference. Result has 126 places, 113 transitions, 1026 flow [2023-11-29 06:23:09,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1026, PETRI_PLACES=126, PETRI_TRANSITIONS=113} [2023-11-29 06:23:09,965 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 65 predicate places. [2023-11-29 06:23:09,965 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 113 transitions, 1026 flow [2023-11-29 06:23:09,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:09,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:09,965 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] [2023-11-29 06:23:09,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:23:09,965 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:09,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash 941539333, now seen corresponding path program 1 times [2023-11-29 06:23:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:23:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773494845] [2023-11-29 06:23:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:23:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:10,405 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 06:23:10,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:23:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773494845] [2023-11-29 06:23:10,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773494845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:10,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:23:10,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337024841] [2023-11-29 06:23:10,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:10,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:23:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:23:10,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:23:10,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:23:10,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:23:10,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 113 transitions, 1026 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:10,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:10,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:23:10,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:15,528 INFO L124 PetriNetUnfolderBase]: 14792/28946 cut-off events. [2023-11-29 06:23:15,528 INFO L125 PetriNetUnfolderBase]: For 105608/112004 co-relation queries the response was YES. [2023-11-29 06:23:15,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105430 conditions, 28946 events. 14792/28946 cut-off events. For 105608/112004 co-relation queries the response was YES. Maximal size of possible extension queue 1802. Compared 296535 event pairs, 5509 based on Foata normal form. 763/27780 useless extension candidates. Maximal degree in co-relation 105375. Up to 12005 conditions per place. [2023-11-29 06:23:15,812 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 79 selfloop transitions, 29 changer transitions 47/197 dead transitions. [2023-11-29 06:23:15,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 197 transitions, 1887 flow [2023-11-29 06:23:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:23:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 06:23:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 448 transitions. [2023-11-29 06:23:15,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 06:23:15,815 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 448 transitions. [2023-11-29 06:23:15,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 448 transitions. [2023-11-29 06:23:15,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:15,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 448 transitions. [2023-11-29 06:23:15,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 37.333333333333336) internal successors, (448), 12 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 06:23:15,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:15,822 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:15,822 INFO L175 Difference]: Start difference. First operand has 126 places, 113 transitions, 1026 flow. Second operand 12 states and 448 transitions. [2023-11-29 06:23:15,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 197 transitions, 1887 flow [2023-11-29 06:23:16,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 197 transitions, 1742 flow, removed 37 selfloop flow, removed 9 redundant places. [2023-11-29 06:23:16,195 INFO L231 Difference]: Finished difference. Result has 131 places, 112 transitions, 1053 flow [2023-11-29 06:23:16,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1053, PETRI_PLACES=131, PETRI_TRANSITIONS=112} [2023-11-29 06:23:16,196 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 70 predicate places. [2023-11-29 06:23:16,196 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 112 transitions, 1053 flow [2023-11-29 06:23:16,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:16,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:16,197 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] [2023-11-29 06:23:16,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:23:16,198 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:16,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash -738395257, now seen corresponding path program 2 times [2023-11-29 06:23:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:23:16,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520684160] [2023-11-29 06:23:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:23:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:16,487 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 06:23:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:23:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520684160] [2023-11-29 06:23:16,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520684160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:16,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:16,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:23:16,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854604403] [2023-11-29 06:23:16,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:16,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:23:16,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:23:16,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:23:16,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:23:16,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 06:23:16,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 112 transitions, 1053 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:16,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:16,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 06:23:16,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:19,932 INFO L124 PetriNetUnfolderBase]: 13591/23296 cut-off events. [2023-11-29 06:23:19,932 INFO L125 PetriNetUnfolderBase]: For 120021/127416 co-relation queries the response was YES. [2023-11-29 06:23:20,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95420 conditions, 23296 events. 13591/23296 cut-off events. For 120021/127416 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 198475 event pairs, 1841 based on Foata normal form. 976/23418 useless extension candidates. Maximal degree in co-relation 95364. Up to 8480 conditions per place. [2023-11-29 06:23:20,076 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 108 selfloop transitions, 11 changer transitions 6/157 dead transitions. [2023-11-29 06:23:20,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 157 transitions, 1706 flow [2023-11-29 06:23:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:23:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:23:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2023-11-29 06:23:20,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2023-11-29 06:23:20,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 225 transitions. [2023-11-29 06:23:20,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 225 transitions. [2023-11-29 06:23:20,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:20,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 225 transitions. [2023-11-29 06:23:20,079 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 06:23:20,079 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 06:23:20,079 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 06:23:20,080 INFO L175 Difference]: Start difference. First operand has 131 places, 112 transitions, 1053 flow. Second operand 6 states and 225 transitions. [2023-11-29 06:23:20,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 157 transitions, 1706 flow [2023-11-29 06:23:20,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 157 transitions, 1595 flow, removed 46 selfloop flow, removed 13 redundant places. [2023-11-29 06:23:20,191 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 945 flow [2023-11-29 06:23:20,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2023-11-29 06:23:20,191 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 53 predicate places. [2023-11-29 06:23:20,191 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 945 flow [2023-11-29 06:23:20,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:20,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:20,192 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 06:23:20,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:23:20,192 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:20,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash -814919035, now seen corresponding path program 1 times [2023-11-29 06:23:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:23:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419739896] [2023-11-29 06:23:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:23:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:20,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 06:23:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:23:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419739896] [2023-11-29 06:23:20,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419739896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:23:20,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120345805] [2023-11-29 06:23:20,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:20,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:23:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:23:20,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:23:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:23:20,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2023-11-29 06:23:20,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 945 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 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 06:23:20,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:20,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2023-11-29 06:23:20,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:23,786 INFO L124 PetriNetUnfolderBase]: 15191/27787 cut-off events. [2023-11-29 06:23:23,786 INFO L125 PetriNetUnfolderBase]: For 109666/113446 co-relation queries the response was YES. [2023-11-29 06:23:24,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109659 conditions, 27787 events. 15191/27787 cut-off events. For 109666/113446 co-relation queries the response was YES. Maximal size of possible extension queue 2031. Compared 266866 event pairs, 2417 based on Foata normal form. 518/25992 useless extension candidates. Maximal degree in co-relation 109611. Up to 9430 conditions per place. [2023-11-29 06:23:24,133 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 97 selfloop transitions, 14 changer transitions 99/233 dead transitions. [2023-11-29 06:23:24,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 233 transitions, 2431 flow [2023-11-29 06:23:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:23:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:23:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 302 transitions. [2023-11-29 06:23:24,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5992063492063492 [2023-11-29 06:23:24,135 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 302 transitions. [2023-11-29 06:23:24,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 302 transitions. [2023-11-29 06:23:24,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:24,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 302 transitions. [2023-11-29 06:23:24,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:24,138 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 06:23:24,139 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 06:23:24,139 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 945 flow. Second operand 9 states and 302 transitions. [2023-11-29 06:23:24,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 233 transitions, 2431 flow [2023-11-29 06:23:25,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 233 transitions, 2281 flow, removed 57 selfloop flow, removed 8 redundant places. [2023-11-29 06:23:25,116 INFO L231 Difference]: Finished difference. Result has 113 places, 92 transitions, 761 flow [2023-11-29 06:23:25,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=761, PETRI_PLACES=113, PETRI_TRANSITIONS=92} [2023-11-29 06:23:25,116 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 52 predicate places. [2023-11-29 06:23:25,116 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 92 transitions, 761 flow [2023-11-29 06:23:25,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 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 06:23:25,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:25,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:23:25,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 06:23:25,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:25,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1661660307, now seen corresponding path program 2 times [2023-11-29 06:23:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:23:25,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800400603] [2023-11-29 06:23:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:23:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:25,848 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 06:23:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:23:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800400603] [2023-11-29 06:23:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800400603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:25,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:25,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:23:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731229068] [2023-11-29 06:23:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:25,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:23:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:23:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:23:25,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:23:25,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:23:25,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 92 transitions, 761 flow. Second operand has 9 states, 9 states have (on average 30.88888888888889) internal successors, (278), 9 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:25,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:25,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:23:25,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:27,457 INFO L124 PetriNetUnfolderBase]: 5467/11581 cut-off events. [2023-11-29 06:23:27,457 INFO L125 PetriNetUnfolderBase]: For 33878/36810 co-relation queries the response was YES. [2023-11-29 06:23:27,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38644 conditions, 11581 events. 5467/11581 cut-off events. For 33878/36810 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 113020 event pairs, 2508 based on Foata normal form. 353/10600 useless extension candidates. Maximal degree in co-relation 38597. Up to 5004 conditions per place. [2023-11-29 06:23:27,511 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 49 selfloop transitions, 22 changer transitions 27/134 dead transitions. [2023-11-29 06:23:27,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 134 transitions, 1169 flow [2023-11-29 06:23:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:23:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:23:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2023-11-29 06:23:27,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-29 06:23:27,513 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 324 transitions. [2023-11-29 06:23:27,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 324 transitions. [2023-11-29 06:23:27,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:27,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 324 transitions. [2023-11-29 06:23:27,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:27,515 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 06:23:27,516 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 06:23:27,516 INFO L175 Difference]: Start difference. First operand has 113 places, 92 transitions, 761 flow. Second operand 9 states and 324 transitions. [2023-11-29 06:23:27,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 134 transitions, 1169 flow [2023-11-29 06:23:27,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 134 transitions, 1059 flow, removed 10 selfloop flow, removed 11 redundant places. [2023-11-29 06:23:27,708 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 793 flow [2023-11-29 06:23:27,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2023-11-29 06:23:27,708 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 50 predicate places. [2023-11-29 06:23:27,708 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 793 flow [2023-11-29 06:23:27,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.88888888888889) internal successors, (278), 9 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:27,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:27,709 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 06:23:27,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 06:23:27,709 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:27,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1919079513, now seen corresponding path program 3 times [2023-11-29 06:23:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:23:27,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873635868] [2023-11-29 06:23:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:23:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:23:27,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:23:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:23:27,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:23:27,848 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:23:27,848 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 06:23:27,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 06:23:27,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 06:23:27,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 06:23:27,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 06:23:27,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 06:23:27,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 06:23:27,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 06:23:27,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 06:23:27,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 06:23:27,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 06:23:27,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 06:23:27,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 06:23:27,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 06:23:27,852 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:23:27,858 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:23:27,858 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:23:27,913 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 06:23:27,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:23:27,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 06:23:27,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:23:27,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:23:27,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:23:27 BasicIcfg [2023-11-29 06:23:27,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:23:27,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:23:27,944 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:23:27,945 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:23:27,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:22:16" (3/4) ... [2023-11-29 06:23:27,947 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:23:27,948 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:23:27,948 INFO L158 Benchmark]: Toolchain (without parser) took 72955.91ms. Allocated memory was 182.5MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 155.8MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2023-11-29 06:23:27,948 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:23:27,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.23ms. Allocated memory is still 182.5MB. Free memory was 155.8MB in the beginning and 131.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 06:23:27,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.55ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 129.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:23:27,949 INFO L158 Benchmark]: Boogie Preprocessor took 60.23ms. Allocated memory is still 182.5MB. Free memory was 129.5MB in the beginning and 125.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:23:27,950 INFO L158 Benchmark]: RCFGBuilder took 694.71ms. Allocated memory is still 182.5MB. Free memory was 125.5MB in the beginning and 75.1MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-29 06:23:27,950 INFO L158 Benchmark]: TraceAbstraction took 71658.26ms. Allocated memory was 182.5MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 74.5MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2023-11-29 06:23:27,950 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 8.1GB. Free memory is still 4.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:23:27,952 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.14ms. Allocated memory is still 111.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.23ms. Allocated memory is still 182.5MB. Free memory was 155.8MB in the beginning and 131.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.55ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 129.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.23ms. Allocated memory is still 182.5MB. Free memory was 129.5MB in the beginning and 125.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 694.71ms. Allocated memory is still 182.5MB. Free memory was 125.5MB in the beginning and 75.1MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 71658.26ms. Allocated memory was 182.5MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 74.5MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 8.1GB. Free memory is still 4.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L852] 0 pthread_t t635; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L868] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 851]: 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: 853]: 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: 71.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 65.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1287 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1135 mSDsluCounter, 367 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4261 IncrementalHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 81 mSDtfsCounter, 4261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1572occurred in iteration=13, InterpolantAutomatonStates: 131, 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.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 3590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 06:23:27,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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_6208df7c-899e-478a-8f5a-50b12dfb672e/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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:23:30,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:23:30,251 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 06:23:30,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:23:30,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:23:30,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:23:30,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:23:30,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:23:30,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:23:30,285 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:23:30,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:23:30,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:23:30,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:23:30,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:23:30,288 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:23:30,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:23:30,289 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:23:30,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:23:30,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:23:30,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:23:30,291 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:23:30,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:23:30,292 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:23:30,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:23:30,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:23:30,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:23:30,293 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:23:30,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:23:30,294 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:23:30,294 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:23:30,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:23:30,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:23:30,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:23:30,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:23:30,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:23:30,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:23:30,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:23:30,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:23:30,297 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:23:30,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:23:30,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:23:30,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:23:30,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:23:30,297 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:23:30,298 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_6208df7c-899e-478a-8f5a-50b12dfb672e/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_6208df7c-899e-478a-8f5a-50b12dfb672e/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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2023-11-29 06:23:30,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:23:30,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:23:30,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:23:30,596 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:23:30,596 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:23:30,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 06:23:33,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:23:33,631 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:23:33,632 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 06:23:33,648 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data/38dbae2e7/7d2f09039179433eb2bb02e66a4c5140/FLAGdb4397b84 [2023-11-29 06:23:33,663 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/data/38dbae2e7/7d2f09039179433eb2bb02e66a4c5140 [2023-11-29 06:23:33,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:23:33,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:23:33,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:23:33,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:23:33,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:23:33,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:23:33" (1/1) ... [2023-11-29 06:23:33,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370792f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:33, skipping insertion in model container [2023-11-29 06:23:33,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:23:33" (1/1) ... [2023-11-29 06:23:33,723 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:23:34,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:23:34,096 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:23:34,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:23:34,205 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:23:34,205 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:23:34,211 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:23:34,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34 WrapperNode [2023-11-29 06:23:34,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:23:34,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:23:34,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:23:34,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:23:34,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,262 INFO L138 Inliner]: procedures = 179, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2023-11-29 06:23:34,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:23:34,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:23:34,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:23:34,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:23:34,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,292 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 06:23:34,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:23:34,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:23:34,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:23:34,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:23:34,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (1/1) ... [2023-11-29 06:23:34,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:23:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:23:34,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:23:34,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:23:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:23:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:23:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:23:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:23:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:23:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:23:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:23:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:23:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:23:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:23:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:23:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:23:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 06:23:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 06:23:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 06:23:34,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 06:23:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 06:23:34,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 06:23:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:23:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:23:34,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:23:34,382 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 06:23:34,536 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:23:34,538 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:23:34,874 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:23:35,072 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:23:35,072 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:23:35,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:35 BoogieIcfgContainer [2023-11-29 06:23:35,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:23:35,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:23:35,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:23:35,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:23:35,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:23:33" (1/3) ... [2023-11-29 06:23:35,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec6184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:23:35, skipping insertion in model container [2023-11-29 06:23:35,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:34" (2/3) ... [2023-11-29 06:23:35,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec6184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:23:35, skipping insertion in model container [2023-11-29 06:23:35,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:35" (3/3) ... [2023-11-29 06:23:35,082 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 06:23:35,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:23:35,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 06:23:35,100 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:23:35,154 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:23:35,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 06:23:35,227 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2023-11-29 06:23:35,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:23:35,231 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 113 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 06:23:35,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 56 transitions, 124 flow [2023-11-29 06:23:35,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 53 transitions, 115 flow [2023-11-29 06:23:35,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:23:35,250 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;@1f1a51ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:23:35,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 06:23:35,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:23:35,253 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 06:23:35,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:23:35,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:35,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:23:35,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:35,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash 12803, now seen corresponding path program 1 times [2023-11-29 06:23:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26354351] [2023-11-29 06:23:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:35,269 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 06:23:35,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:35,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:35,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:35,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:23:35,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:35,442 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 06:23:35,453 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 06:23:35,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:35,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:35,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26354351] [2023-11-29 06:23:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26354351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:23:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419846404] [2023-11-29 06:23:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:35,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:23:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:35,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:23:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:23:35,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:23:35,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:35,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:35,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:23:35,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:35,981 INFO L124 PetriNetUnfolderBase]: 1057/2055 cut-off events. [2023-11-29 06:23:35,981 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 06:23:35,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 2055 events. 1057/2055 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13997 event pairs, 791 based on Foata normal form. 120/1973 useless extension candidates. Maximal degree in co-relation 3667. Up to 1193 conditions per place. [2023-11-29 06:23:36,004 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 30 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 06:23:36,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 189 flow [2023-11-29 06:23:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:23:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:23:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-29 06:23:36,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2023-11-29 06:23:36,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-29 06:23:36,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-29 06:23:36,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:36,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-29 06:23:36,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:36,028 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 06:23:36,028 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 06:23:36,030 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 115 flow. Second operand 3 states and 122 transitions. [2023-11-29 06:23:36,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 189 flow [2023-11-29 06:23:36,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:23:36,044 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-29 06:23:36,046 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 06:23:36,050 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-29 06:23:36,050 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-29 06:23:36,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:36,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:36,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:23:36,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:36,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:36,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:36,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash 12804, now seen corresponding path program 1 times [2023-11-29 06:23:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:36,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158145787] [2023-11-29 06:23:36,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:36,253 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 06:23:36,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:36,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:36,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:36,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:23:36,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:36,367 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 06:23:36,377 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 06:23:36,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:36,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:36,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158145787] [2023-11-29 06:23:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158145787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:36,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:23:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529484612] [2023-11-29 06:23:36,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:36,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:23:36,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:36,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:23:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:23:36,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 06:23:36,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 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 06:23:36,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:36,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 06:23:36,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:36,807 INFO L124 PetriNetUnfolderBase]: 1057/2054 cut-off events. [2023-11-29 06:23:36,807 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 06:23:36,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 2054 events. 1057/2054 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14024 event pairs, 791 based on Foata normal form. 1/1853 useless extension candidates. Maximal degree in co-relation 3727. Up to 1192 conditions per place. [2023-11-29 06:23:36,827 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 06:23:36,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 186 flow [2023-11-29 06:23:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:23:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:23:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-29 06:23:36,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2023-11-29 06:23:36,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-29 06:23:36,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-29 06:23:36,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:36,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-29 06:23:36,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:36,833 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 06:23:36,833 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 06:23:36,834 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 122 transitions. [2023-11-29 06:23:36,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 186 flow [2023-11-29 06:23:36,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:36,838 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 06:23:36,839 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 06:23:36,840 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-29 06:23:36,840 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 06:23:36,840 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 06:23:36,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:36,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:23:36,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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)] Forceful destruction successful, exit code 0 [2023-11-29 06:23:37,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:37,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:37,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 381802693, now seen corresponding path program 1 times [2023-11-29 06:23:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964422512] [2023-11-29 06:23:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:37,043 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 06:23:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:37,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:37,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:37,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:23:37,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:37,144 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 06:23:37,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:37,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964422512] [2023-11-29 06:23:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964422512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:23:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828314333] [2023-11-29 06:23:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:37,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:23:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:23:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:23:37,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-29 06:23:37,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 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 06:23:37,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:37,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-29 06:23:37,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:37,429 INFO L124 PetriNetUnfolderBase]: 825/1751 cut-off events. [2023-11-29 06:23:37,430 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 06:23:37,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3079 conditions, 1751 events. 825/1751 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12304 event pairs, 129 based on Foata normal form. 0/1728 useless extension candidates. Maximal degree in co-relation 3068. Up to 1009 conditions per place. [2023-11-29 06:23:37,440 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 33 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2023-11-29 06:23:37,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 216 flow [2023-11-29 06:23:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:23:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:23:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-29 06:23:37,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7797619047619048 [2023-11-29 06:23:37,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-29 06:23:37,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-29 06:23:37,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:37,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-29 06:23:37,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:37,445 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 06:23:37,446 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 06:23:37,446 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 131 transitions. [2023-11-29 06:23:37,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 216 flow [2023-11-29 06:23:37,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:37,448 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 102 flow [2023-11-29 06:23:37,449 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=102, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-29 06:23:37,449 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2023-11-29 06:23:37,450 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 102 flow [2023-11-29 06:23:37,450 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 06:23:37,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:37,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:23:37,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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)] Forceful destruction successful, exit code 0 [2023-11-29 06:23:37,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:37,651 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:37,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash 381801189, now seen corresponding path program 1 times [2023-11-29 06:23:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17342066] [2023-11-29 06:23:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:37,652 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 06:23:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:37,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:37,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:37,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:23:37,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:37,739 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 06:23:37,749 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 06:23:37,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:37,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17342066] [2023-11-29 06:23:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17342066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:37,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:23:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986259082] [2023-11-29 06:23:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:23:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:23:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:23:37,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:23:37,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:37,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:37,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:23:37,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:38,061 INFO L124 PetriNetUnfolderBase]: 724/1458 cut-off events. [2023-11-29 06:23:38,061 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-29 06:23:38,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 1458 events. 724/1458 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9667 event pairs, 550 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 2675. Up to 940 conditions per place. [2023-11-29 06:23:38,074 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 06:23:38,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-29 06:23:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:23:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:23:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:23:38,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2023-11-29 06:23:38,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:23:38,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:23:38,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:38,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:23:38,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:38,078 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 06:23:38,078 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 06:23:38,079 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 102 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:23:38,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-29 06:23:38,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:38,081 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 06:23:38,081 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 06:23:38,082 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-11-29 06:23:38,082 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 06:23:38,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:38,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:38,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:23:38,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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)] Forceful destruction successful, exit code 0 [2023-11-29 06:23:38,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:38,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:38,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash 381801190, now seen corresponding path program 1 times [2023-11-29 06:23:38,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101949313] [2023-11-29 06:23:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:38,287 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 06:23:38,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:38,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:38,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:38,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:23:38,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:38,378 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 06:23:38,390 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 06:23:38,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:38,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:38,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101949313] [2023-11-29 06:23:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101949313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:23:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426667749] [2023-11-29 06:23:38,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:38,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:23:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:38,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:23:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:23:38,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 06:23:38,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 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 06:23:38,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:38,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 06:23:38,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:38,671 INFO L124 PetriNetUnfolderBase]: 721/1464 cut-off events. [2023-11-29 06:23:38,671 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 06:23:38,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 1464 events. 721/1464 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9803 event pairs, 416 based on Foata normal form. 4/1399 useless extension candidates. Maximal degree in co-relation 2633. Up to 933 conditions per place. [2023-11-29 06:23:38,682 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 06:23:38,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 170 flow [2023-11-29 06:23:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:23:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:23:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:23:38,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2023-11-29 06:23:38,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:23:38,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:23:38,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:38,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:23:38,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:38,687 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 06:23:38,687 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 06:23:38,687 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:23:38,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 170 flow [2023-11-29 06:23:38,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:38,690 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 06:23:38,690 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 06:23:38,691 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -8 predicate places. [2023-11-29 06:23:38,691 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 06:23:38,692 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 06:23:38,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:38,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:23:38,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:38,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:38,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:38,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1166212463, now seen corresponding path program 1 times [2023-11-29 06:23:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:38,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910269371] [2023-11-29 06:23:38,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:38,895 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 06:23:38,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:38,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:38,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:38,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:23:38,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:38,974 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 06:23:38,979 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 06:23:38,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:38,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910269371] [2023-11-29 06:23:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910269371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:23:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178618132] [2023-11-29 06:23:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:38,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:23:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:38,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:23:38,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:23:39,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-29 06:23:39,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:39,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:39,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-29 06:23:39,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:39,238 INFO L124 PetriNetUnfolderBase]: 738/1469 cut-off events. [2023-11-29 06:23:39,238 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 06:23:39,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 1469 events. 738/1469 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9712 event pairs, 260 based on Foata normal form. 0/1426 useless extension candidates. Maximal degree in co-relation 2667. Up to 934 conditions per place. [2023-11-29 06:23:39,247 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 06:23:39,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 170 flow [2023-11-29 06:23:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:23:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:23:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:23:39,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2023-11-29 06:23:39,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:23:39,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:23:39,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:39,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:23:39,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:39,251 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 06:23:39,251 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 06:23:39,251 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:23:39,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 170 flow [2023-11-29 06:23:39,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:39,254 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 06:23:39,254 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=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-29 06:23:39,255 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-11-29 06:23:39,255 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 06:23:39,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:39,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:39,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:23:39,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:39,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:39,458 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:39,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1166212464, now seen corresponding path program 1 times [2023-11-29 06:23:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443158335] [2023-11-29 06:23:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:39,459 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 06:23:39,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:39,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:39,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:39,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:23:39,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:39,545 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 06:23:39,556 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 06:23:39,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:39,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443158335] [2023-11-29 06:23:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443158335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:23:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325691574] [2023-11-29 06:23:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:39,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:23:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:23:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:23:39,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 06:23:39,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 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 06:23:39,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:39,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 06:23:39,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:39,818 INFO L124 PetriNetUnfolderBase]: 721/1420 cut-off events. [2023-11-29 06:23:39,819 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 06:23:39,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1420 events. 721/1420 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9207 event pairs, 420 based on Foata normal form. 12/1393 useless extension candidates. Maximal degree in co-relation 2597. Up to 905 conditions per place. [2023-11-29 06:23:39,831 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 06:23:39,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 166 flow [2023-11-29 06:23:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:23:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:23:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:23:39,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2023-11-29 06:23:39,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:23:39,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:23:39,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:39,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:23:39,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:39,835 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 06:23:39,835 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 06:23:39,835 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:23:39,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 166 flow [2023-11-29 06:23:39,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:39,837 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-29 06:23:39,837 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=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-29 06:23:39,838 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2023-11-29 06:23:39,838 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-29 06:23:39,838 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 06:23:39,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:39,838 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 06:23:39,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:40,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:40,039 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:40,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 835210472, now seen corresponding path program 1 times [2023-11-29 06:23:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862019669] [2023-11-29 06:23:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:40,040 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 06:23:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:40,041 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:40,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:40,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:23:40,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:40,153 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 06:23:40,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:40,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862019669] [2023-11-29 06:23:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862019669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:40,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:23:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086152124] [2023-11-29 06:23:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:40,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:23:40,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:40,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:23:40,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:23:40,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 06:23:40,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:40,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:40,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 06:23:40,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:40,557 INFO L124 PetriNetUnfolderBase]: 1680/2974 cut-off events. [2023-11-29 06:23:40,557 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-29 06:23:40,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5654 conditions, 2974 events. 1680/2974 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19663 event pairs, 188 based on Foata normal form. 100/3029 useless extension candidates. Maximal degree in co-relation 5644. Up to 1579 conditions per place. [2023-11-29 06:23:40,579 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 43 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2023-11-29 06:23:40,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 248 flow [2023-11-29 06:23:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:23:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:23:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2023-11-29 06:23:40,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098214285714286 [2023-11-29 06:23:40,581 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 159 transitions. [2023-11-29 06:23:40,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 159 transitions. [2023-11-29 06:23:40,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:40,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 159 transitions. [2023-11-29 06:23:40,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:40,583 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 06:23:40,583 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 06:23:40,583 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 4 states and 159 transitions. [2023-11-29 06:23:40,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 248 flow [2023-11-29 06:23:40,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:40,587 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 124 flow [2023-11-29 06:23:40,587 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 06:23:40,588 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-11-29 06:23:40,588 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 124 flow [2023-11-29 06:23:40,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:40,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:40,589 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 06:23:40,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 06:23:40,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:40,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:40,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -21515366, now seen corresponding path program 1 times [2023-11-29 06:23:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089123965] [2023-11-29 06:23:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:40,793 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 06:23:40,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:40,794 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:40,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:40,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:23:40,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:40,940 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 06:23:40,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:40,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089123965] [2023-11-29 06:23:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089123965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:40,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:40,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:23:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368517341] [2023-11-29 06:23:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:40,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:23:40,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:40,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:23:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:23:40,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 06:23:40,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:40,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:40,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 06:23:40,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:41,229 INFO L124 PetriNetUnfolderBase]: 1038/1852 cut-off events. [2023-11-29 06:23:41,229 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-11-29 06:23:41,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4085 conditions, 1852 events. 1038/1852 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10698 event pairs, 100 based on Foata normal form. 82/1897 useless extension candidates. Maximal degree in co-relation 4072. Up to 697 conditions per place. [2023-11-29 06:23:41,238 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 54 selfloop transitions, 8 changer transitions 1/81 dead transitions. [2023-11-29 06:23:41,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 343 flow [2023-11-29 06:23:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:23:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:23:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2023-11-29 06:23:41,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-29 06:23:41,240 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 200 transitions. [2023-11-29 06:23:41,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 200 transitions. [2023-11-29 06:23:41,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:41,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 200 transitions. [2023-11-29 06:23:41,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:41,241 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 06:23:41,242 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 06:23:41,242 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 124 flow. Second operand 5 states and 200 transitions. [2023-11-29 06:23:41,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 343 flow [2023-11-29 06:23:41,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 333 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 06:23:41,245 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 164 flow [2023-11-29 06:23:41,246 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 06:23:41,246 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-29 06:23:41,247 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 164 flow [2023-11-29 06:23:41,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:41,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:41,247 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 06:23:41,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:41,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:41,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:41,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1562510249, now seen corresponding path program 1 times [2023-11-29 06:23:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097090893] [2023-11-29 06:23:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:41,451 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 06:23:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:41,452 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:41,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:41,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:23:41,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:41,640 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 06:23:41,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:41,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097090893] [2023-11-29 06:23:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097090893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:41,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:41,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:23:41,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184899117] [2023-11-29 06:23:41,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:41,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:23:41,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:41,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:23:41,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:23:41,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-29 06:23:41,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:41,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:41,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-29 06:23:41,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:41,944 INFO L124 PetriNetUnfolderBase]: 581/1001 cut-off events. [2023-11-29 06:23:41,944 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2023-11-29 06:23:41,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 1001 events. 581/1001 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4675 event pairs, 83 based on Foata normal form. 40/1009 useless extension candidates. Maximal degree in co-relation 2520. Up to 308 conditions per place. [2023-11-29 06:23:41,949 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 47 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2023-11-29 06:23:41,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 350 flow [2023-11-29 06:23:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:23:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:23:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2023-11-29 06:23:41,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6636904761904762 [2023-11-29 06:23:41,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 223 transitions. [2023-11-29 06:23:41,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 223 transitions. [2023-11-29 06:23:41,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:41,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 223 transitions. [2023-11-29 06:23:41,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:41,953 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 06:23:41,953 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 06:23:41,953 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 164 flow. Second operand 6 states and 223 transitions. [2023-11-29 06:23:41,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 350 flow [2023-11-29 06:23:41,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 325 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 06:23:41,957 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 178 flow [2023-11-29 06:23:41,957 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 06:23:41,958 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-11-29 06:23:41,958 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 178 flow [2023-11-29 06:23:41,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:41,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:41,958 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 06:23:41,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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)] Forceful destruction successful, exit code 0 [2023-11-29 06:23:42,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:42,159 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:42,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1844219007, now seen corresponding path program 1 times [2023-11-29 06:23:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544538724] [2023-11-29 06:23:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:42,160 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 06:23:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:42,160 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:42,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:42,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:23:42,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:42,815 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t633~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t635~0#1.base_37| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t634~0#1.base_47| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t633~0#1.base_51| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t633~0#1.base_51|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t634~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t635~0#1.base_37|)) (= (select .cse0 |v_ULTIMATE.start_main_~#t634~0#1.base_47|) (_ bv0 1)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t633~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t634~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t635~0#1.base_37| (_ bv0 1)) |c_#valid|)))) is different from true [2023-11-29 06:23:42,816 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 06:23:42,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:42,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544538724] [2023-11-29 06:23:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544538724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:42,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:23:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486033963] [2023-11-29 06:23:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:42,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:23:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:42,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:23:42,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 06:23:42,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 56 [2023-11-29 06:23:42,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:42,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:42,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 56 [2023-11-29 06:23:42,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:43,106 INFO L124 PetriNetUnfolderBase]: 339/702 cut-off events. [2023-11-29 06:23:43,106 INFO L125 PetriNetUnfolderBase]: For 264/276 co-relation queries the response was YES. [2023-11-29 06:23:43,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 702 events. 339/702 cut-off events. For 264/276 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3557 event pairs, 70 based on Foata normal form. 8/677 useless extension candidates. Maximal degree in co-relation 1529. Up to 458 conditions per place. [2023-11-29 06:23:43,111 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 31 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-11-29 06:23:43,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 282 flow [2023-11-29 06:23:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:23:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:23:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2023-11-29 06:23:43,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2023-11-29 06:23:43,113 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 165 transitions. [2023-11-29 06:23:43,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 165 transitions. [2023-11-29 06:23:43,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:43,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 165 transitions. [2023-11-29 06:23:43,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:43,115 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 06:23:43,116 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 06:23:43,116 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 178 flow. Second operand 6 states and 165 transitions. [2023-11-29 06:23:43,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 282 flow [2023-11-29 06:23:43,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 226 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 06:23:43,119 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 154 flow [2023-11-29 06:23:43,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-11-29 06:23:43,120 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2023-11-29 06:23:43,120 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 154 flow [2023-11-29 06:23:43,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:43,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:43,121 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 06:23:43,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:43,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:43,321 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:43,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash 446280819, now seen corresponding path program 1 times [2023-11-29 06:23:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:43,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417959526] [2023-11-29 06:23:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:43,322 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 06:23:43,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:43,323 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:43,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:43,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:23:43,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:43,865 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 06:23:43,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:43,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:43,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417959526] [2023-11-29 06:23:43,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417959526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:43,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:43,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:23:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25531061] [2023-11-29 06:23:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:43,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:23:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:43,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:23:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:23:43,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-29 06:23:43,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 154 flow. Second operand has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:43,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:43,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-29 06:23:43,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:44,299 INFO L124 PetriNetUnfolderBase]: 499/1047 cut-off events. [2023-11-29 06:23:44,299 INFO L125 PetriNetUnfolderBase]: For 319/355 co-relation queries the response was YES. [2023-11-29 06:23:44,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 1047 events. 499/1047 cut-off events. For 319/355 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5620 event pairs, 94 based on Foata normal form. 8/1011 useless extension candidates. Maximal degree in co-relation 2380. Up to 373 conditions per place. [2023-11-29 06:23:44,314 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 59 selfloop transitions, 9 changer transitions 0/95 dead transitions. [2023-11-29 06:23:44,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 440 flow [2023-11-29 06:23:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:23:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:23:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 333 transitions. [2023-11-29 06:23:44,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2023-11-29 06:23:44,316 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 333 transitions. [2023-11-29 06:23:44,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 333 transitions. [2023-11-29 06:23:44,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:44,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 333 transitions. [2023-11-29 06:23:44,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 37.0) internal successors, (333), 9 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:44,319 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 06:23:44,320 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 06:23:44,320 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 154 flow. Second operand 9 states and 333 transitions. [2023-11-29 06:23:44,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 440 flow [2023-11-29 06:23:44,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 06:23:44,323 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 194 flow [2023-11-29 06:23:44,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=194, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 06:23:44,324 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2023-11-29 06:23:44,324 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 194 flow [2023-11-29 06:23:44,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:44,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:44,325 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 06:23:44,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:44,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:44,529 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:44,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 445456611, now seen corresponding path program 2 times [2023-11-29 06:23:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:44,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030318435] [2023-11-29 06:23:44,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:23:44,530 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 06:23:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:44,531 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:44,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:44,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:23:44,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:23:44,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:23:44,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:44,740 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 06:23:44,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:44,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:44,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030318435] [2023-11-29 06:23:44,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030318435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:44,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:44,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:23:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634338881] [2023-11-29 06:23:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:44,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:23:44,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:23:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:23:44,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 06:23:44,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:44,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:44,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 06:23:44,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:45,076 INFO L124 PetriNetUnfolderBase]: 1092/2076 cut-off events. [2023-11-29 06:23:45,076 INFO L125 PetriNetUnfolderBase]: For 996/1064 co-relation queries the response was YES. [2023-11-29 06:23:45,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5282 conditions, 2076 events. 1092/2076 cut-off events. For 996/1064 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12209 event pairs, 263 based on Foata normal form. 8/2008 useless extension candidates. Maximal degree in co-relation 5265. Up to 854 conditions per place. [2023-11-29 06:23:45,087 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 63 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2023-11-29 06:23:45,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 494 flow [2023-11-29 06:23:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:23:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:23:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2023-11-29 06:23:45,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6636904761904762 [2023-11-29 06:23:45,089 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 223 transitions. [2023-11-29 06:23:45,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 223 transitions. [2023-11-29 06:23:45,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:45,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 223 transitions. [2023-11-29 06:23:45,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:45,091 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 06:23:45,091 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 06:23:45,092 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 194 flow. Second operand 6 states and 223 transitions. [2023-11-29 06:23:45,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 494 flow [2023-11-29 06:23:45,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 483 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:23:45,096 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 271 flow [2023-11-29 06:23:45,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2023-11-29 06:23:45,096 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2023-11-29 06:23:45,097 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 271 flow [2023-11-29 06:23:45,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:45,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:45,097 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 06:23:45,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:45,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:45,298 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:45,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1255665283, now seen corresponding path program 3 times [2023-11-29 06:23:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426649608] [2023-11-29 06:23:45,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:23:45,299 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 06:23:45,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:45,300 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:45,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:45,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 06:23:45,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:23:45,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:23:45,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:45,438 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 06:23:45,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:23:45,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:45,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426649608] [2023-11-29 06:23:45,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426649608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:23:45,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:23:45,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:23:45,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029062408] [2023-11-29 06:23:45,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:23:45,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:23:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:45,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:23:45,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:23:45,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-29 06:23:45,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:45,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:23:45,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-29 06:23:45,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:23:45,914 INFO L124 PetriNetUnfolderBase]: 2000/3747 cut-off events. [2023-11-29 06:23:45,914 INFO L125 PetriNetUnfolderBase]: For 2272/2340 co-relation queries the response was YES. [2023-11-29 06:23:45,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9847 conditions, 3747 events. 2000/3747 cut-off events. For 2272/2340 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 25238 event pairs, 678 based on Foata normal form. 8/3577 useless extension candidates. Maximal degree in co-relation 9827. Up to 1520 conditions per place. [2023-11-29 06:23:45,933 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 60 selfloop transitions, 14 changer transitions 0/100 dead transitions. [2023-11-29 06:23:45,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 611 flow [2023-11-29 06:23:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:23:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:23:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2023-11-29 06:23:45,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6678571428571428 [2023-11-29 06:23:45,935 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 187 transitions. [2023-11-29 06:23:45,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 187 transitions. [2023-11-29 06:23:45,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:23:45,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 187 transitions. [2023-11-29 06:23:45,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:45,937 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 06:23:45,937 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 06:23:45,937 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 271 flow. Second operand 5 states and 187 transitions. [2023-11-29 06:23:45,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 611 flow [2023-11-29 06:23:45,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 610 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 06:23:45,944 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 458 flow [2023-11-29 06:23:45,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2023-11-29 06:23:45,945 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 18 predicate places. [2023-11-29 06:23:45,945 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 458 flow [2023-11-29 06:23:45,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:23:45,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:23:45,945 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 06:23:45,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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)] Forceful destruction successful, exit code 0 [2023-11-29 06:23:46,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:46,146 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:23:46,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:46,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1374688111, now seen corresponding path program 4 times [2023-11-29 06:23:46,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:46,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212761845] [2023-11-29 06:23:46,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:23:46,147 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 06:23:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:46,148 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:46,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:46,279 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:23:46,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 06:23:46,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:23:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:23:46,415 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 06:23:46,415 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:23:46,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 06:23:46,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 06:23:46,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 06:23:46,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 06:23:46,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 06:23:46,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 06:23:46,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 06:23:46,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 06:23:46,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 06:23:46,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 06:23:46,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 06:23:46,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 06:23:46,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 06:23:46,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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)] Ended with exit code 0 [2023-11-29 06:23:46,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 06:23:46,621 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:23:46,625 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:23:46,625 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:23:46,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 06:23:46,690 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:23:46,691 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 06:23:46,706 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:23:46,707 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:23:46,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:23:46 BasicIcfg [2023-11-29 06:23:46,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:23:46,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:23:46,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:23:46,720 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:23:46,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:35" (3/4) ... [2023-11-29 06:23:46,722 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:23:46,724 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:23:46,724 INFO L158 Benchmark]: Toolchain (without parser) took 13057.43ms. Allocated memory was 75.5MB in the beginning and 335.5MB in the end (delta: 260.0MB). Free memory was 50.2MB in the beginning and 258.6MB in the end (delta: -208.4MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2023-11-29 06:23:46,725 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 75.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:23:46,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.09ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 44.2MB in the end (delta: 5.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-11-29 06:23:46,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.87ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 41.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:23:46,726 INFO L158 Benchmark]: Boogie Preprocessor took 52.36ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 38.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:23:46,726 INFO L158 Benchmark]: RCFGBuilder took 756.58ms. Allocated memory was 75.5MB in the beginning and 104.9MB in the end (delta: 29.4MB). Free memory was 38.0MB in the beginning and 53.3MB in the end (delta: -15.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2023-11-29 06:23:46,727 INFO L158 Benchmark]: TraceAbstraction took 11644.22ms. Allocated memory was 104.9MB in the beginning and 335.5MB in the end (delta: 230.7MB). Free memory was 52.6MB in the beginning and 258.6MB in the end (delta: -205.9MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-11-29 06:23:46,727 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 335.5MB. Free memory is still 258.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:23:46,729 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.17ms. Allocated memory is still 75.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.09ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 44.2MB in the end (delta: 5.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.87ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 41.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.36ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 38.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 756.58ms. Allocated memory was 75.5MB in the beginning and 104.9MB in the end (delta: 29.4MB). Free memory was 38.0MB in the beginning and 53.3MB in the end (delta: -15.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11644.22ms. Allocated memory was 104.9MB in the beginning and 335.5MB in the end (delta: 230.7MB). Free memory was 52.6MB in the beginning and 258.6MB in the end (delta: -205.9MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 335.5MB. Free memory is still 258.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={7:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={7:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={7:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={7:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={7:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L868] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 851]: 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: 853]: 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: 11.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 544 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 447 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 58 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1400 IncrementalHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 37 mSDtfsCounter, 1400 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=14, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 235 ConstructedInterpolants, 1 QuantifiedInterpolants, 1772 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1640 ConjunctsInSsa, 77 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 06:23:46,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6208df7c-899e-478a-8f5a-50b12dfb672e/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample