./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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_13cf1fdd-c159-4eea-84f3-b553d7407120/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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:37:55,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:37:55,868 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 23:37:55,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:37:55,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:37:55,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:37:55,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:37:55,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:37:55,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:37:55,900 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:37:55,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:37:55,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:37:55,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:37:55,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:37:55,903 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:37:55,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:37:55,904 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:37:55,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:37:55,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:37:55,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:37:55,906 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:37:55,906 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:37:55,907 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:37:55,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:37:55,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:37:55,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:37:55,908 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:37:55,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:37:55,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:37:55,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:37:55,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:37:55,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:37:55,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:37:55,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:37:55,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:37:55,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:37:55,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:37:55,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:37:55,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:37:55,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:37:55,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:37:55,914 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_13cf1fdd-c159-4eea-84f3-b553d7407120/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_13cf1fdd-c159-4eea-84f3-b553d7407120/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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2023-11-28 23:37:56,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:37:56,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:37:56,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:37:56,146 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:37:56,146 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:37:56,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-28 23:37:58,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:37:59,128 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:37:59,129 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-28 23:37:59,145 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data/c56fc2a74/b4c48cd040814ebb917f662536c5054a/FLAGd56749b80 [2023-11-28 23:37:59,158 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data/c56fc2a74/b4c48cd040814ebb917f662536c5054a [2023-11-28 23:37:59,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:37:59,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:37:59,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:37:59,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:37:59,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:37:59,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b43c1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59, skipping insertion in model container [2023-11-28 23:37:59,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,217 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:37:59,561 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:37:59,572 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:37:59,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:37:59,656 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:37:59,656 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:37:59,664 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:37:59,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59 WrapperNode [2023-11-28 23:37:59,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:37:59,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:37:59,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:37:59,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:37:59,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,715 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2023-11-28 23:37:59,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:37:59,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:37:59,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:37:59,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:37:59,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,747 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-28 23:37:59,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:37:59,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:37:59,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:37:59,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:37:59,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (1/1) ... [2023-11-28 23:37:59,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:37:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:37:59,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:37:59,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:37:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:37:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:37:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:37:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:37:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:37:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:37:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:37:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:37:59,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:37:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:37:59,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:37:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:37:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 23:37:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 23:37:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:37:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:37:59,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:37:59,831 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:37:59,974 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:37:59,976 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:38:00,216 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:38:00,413 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:38:00,413 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:38:00,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:00 BoogieIcfgContainer [2023-11-28 23:38:00,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:38:00,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:38:00,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:38:00,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:38:00,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:37:59" (1/3) ... [2023-11-28 23:38:00,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9a5498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:00, skipping insertion in model container [2023-11-28 23:38:00,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:37:59" (2/3) ... [2023-11-28 23:38:00,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9a5498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:00, skipping insertion in model container [2023-11-28 23:38:00,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:00" (3/3) ... [2023-11-28 23:38:00,423 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-28 23:38:00,443 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:38:00,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-28 23:38:00,444 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:38:00,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:38:00,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 96 flow [2023-11-28 23:38:00,561 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2023-11-28 23:38:00,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:38:00,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-28 23:38:00,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 96 flow [2023-11-28 23:38:00,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 42 transitions, 90 flow [2023-11-28 23:38:00,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:38:00,590 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;@7b38e359, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:38:00,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-28 23:38:00,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:38:00,594 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:38:00,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:38:00,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:00,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:38:00,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:00,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 11495, now seen corresponding path program 1 times [2023-11-28 23:38:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380004791] [2023-11-28 23:38:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:00,853 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-28 23:38:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380004791] [2023-11-28 23:38:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380004791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:38:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732959633] [2023-11-28 23:38:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:00,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:00,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:00,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-28 23:38:00,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:00,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:00,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-28 23:38:00,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:01,087 INFO L124 PetriNetUnfolderBase]: 166/414 cut-off events. [2023-11-28 23:38:01,087 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 23:38:01,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 414 events. 166/414 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2526 event pairs, 122 based on Foata normal form. 30/400 useless extension candidates. Maximal degree in co-relation 707. Up to 220 conditions per place. [2023-11-28 23:38:01,094 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 22 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-28 23:38:01,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 142 flow [2023-11-28 23:38:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-28 23:38:01,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-28 23:38:01,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:01,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:01,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,119 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 93 transitions. [2023-11-28 23:38:01,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 142 flow [2023-11-28 23:38:01,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:01,125 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-28 23:38:01,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-28 23:38:01,131 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-28 23:38:01,131 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-28 23:38:01,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:01,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:38:01,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:38:01,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:01,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash 11496, now seen corresponding path program 1 times [2023-11-28 23:38:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:01,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482515132] [2023-11-28 23:38:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:01,244 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-28 23:38:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:01,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482515132] [2023-11-28 23:38:01,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482515132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:01,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:01,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:38:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112296593] [2023-11-28 23:38:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:01,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:01,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:01,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 44 [2023-11-28 23:38:01,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:01,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 44 [2023-11-28 23:38:01,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:01,388 INFO L124 PetriNetUnfolderBase]: 166/413 cut-off events. [2023-11-28 23:38:01,388 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 23:38:01,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 413 events. 166/413 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2540 event pairs, 122 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 722. Up to 219 conditions per place. [2023-11-28 23:38:01,393 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 21 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-28 23:38:01,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 140 flow [2023-11-28 23:38:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-28 23:38:01,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-28 23:38:01,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:01,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:01,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,398 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 93 transitions. [2023-11-28 23:38:01,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 140 flow [2023-11-28 23:38:01,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:01,401 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-28 23:38:01,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-28 23:38:01,402 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-11-28 23:38:01,402 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-28 23:38:01,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:01,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:38:01,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:38:01,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:01,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 342766167, now seen corresponding path program 1 times [2023-11-28 23:38:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:01,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522571836] [2023-11-28 23:38:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:01,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:01,462 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-28 23:38:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:01,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522571836] [2023-11-28 23:38:01,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522571836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:01,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:01,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:38:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622638538] [2023-11-28 23:38:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:01,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:01,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:01,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:01,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-28 23:38:01,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:01,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-28 23:38:01,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:01,595 INFO L124 PetriNetUnfolderBase]: 168/412 cut-off events. [2023-11-28 23:38:01,595 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 23:38:01,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 412 events. 168/412 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2486 event pairs, 80 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 726. Up to 220 conditions per place. [2023-11-28 23:38:01,599 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 22 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-28 23:38:01,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 140 flow [2023-11-28 23:38:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2023-11-28 23:38:01,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2023-11-28 23:38:01,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 91 transitions. [2023-11-28 23:38:01,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 91 transitions. [2023-11-28 23:38:01,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:01,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 91 transitions. [2023-11-28 23:38:01,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:01,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,604 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 91 transitions. [2023-11-28 23:38:01,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 140 flow [2023-11-28 23:38:01,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:01,606 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-28 23:38:01,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-28 23:38:01,607 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-11-28 23:38:01,608 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-28 23:38:01,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:01,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:38:01,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:38:01,608 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:01,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:01,609 INFO L85 PathProgramCache]: Analyzing trace with hash 342766168, now seen corresponding path program 1 times [2023-11-28 23:38:01,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:01,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292927745] [2023-11-28 23:38:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:01,683 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-28 23:38:01,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:01,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292927745] [2023-11-28 23:38:01,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292927745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:01,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:01,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:38:01,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763911712] [2023-11-28 23:38:01,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:01,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:01,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:01,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:01,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:01,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 44 [2023-11-28 23:38:01,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:01,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 44 [2023-11-28 23:38:01,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:01,821 INFO L124 PetriNetUnfolderBase]: 166/396 cut-off events. [2023-11-28 23:38:01,821 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-28 23:38:01,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 396 events. 166/396 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2297 event pairs, 100 based on Foata normal form. 3/366 useless extension candidates. Maximal degree in co-relation 708. Up to 215 conditions per place. [2023-11-28 23:38:01,825 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 21 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-28 23:38:01,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 136 flow [2023-11-28 23:38:01,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-28 23:38:01,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-28 23:38:01,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:01,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-28 23:38:01,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:01,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,830 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 93 transitions. [2023-11-28 23:38:01,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 136 flow [2023-11-28 23:38:01,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:01,832 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-28 23:38:01,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-28 23:38:01,833 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2023-11-28 23:38:01,833 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-28 23:38:01,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:01,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:38:01,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:38:01,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:01,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2085031351, now seen corresponding path program 1 times [2023-11-28 23:38:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062753594] [2023-11-28 23:38:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:01,952 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-28 23:38:01,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062753594] [2023-11-28 23:38:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062753594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:01,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:01,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:38:01,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948517209] [2023-11-28 23:38:01,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:01,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:01,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 44 [2023-11-28 23:38:01,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:01,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:01,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 44 [2023-11-28 23:38:01,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:02,052 INFO L124 PetriNetUnfolderBase]: 129/358 cut-off events. [2023-11-28 23:38:02,053 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-28 23:38:02,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 358 events. 129/358 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2045 event pairs, 18 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 606. Up to 184 conditions per place. [2023-11-28 23:38:02,056 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 21 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-11-28 23:38:02,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 146 flow [2023-11-28 23:38:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-28 23:38:02,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2023-11-28 23:38:02,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-28 23:38:02,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-28 23:38:02,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:02,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-28 23:38:02,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,060 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 98 transitions. [2023-11-28 23:38:02,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 146 flow [2023-11-28 23:38:02,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:02,062 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 74 flow [2023-11-28 23:38:02,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-28 23:38:02,063 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-11-28 23:38:02,063 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 74 flow [2023-11-28 23:38:02,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:02,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:38:02,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:38:02,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:02,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1675709266, now seen corresponding path program 1 times [2023-11-28 23:38:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384270294] [2023-11-28 23:38:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:02,328 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-28 23:38:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384270294] [2023-11-28 23:38:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384270294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:38:02,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575869276] [2023-11-28 23:38:02,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:02,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:38:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:02,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:38:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:38:02,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-28 23:38:02,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:02,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-28 23:38:02,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:02,563 INFO L124 PetriNetUnfolderBase]: 144/352 cut-off events. [2023-11-28 23:38:02,563 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-28 23:38:02,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 352 events. 144/352 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2048 event pairs, 60 based on Foata normal form. 15/355 useless extension candidates. Maximal degree in co-relation 630. Up to 215 conditions per place. [2023-11-28 23:38:02,566 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 16 selfloop transitions, 2 changer transitions 7/40 dead transitions. [2023-11-28 23:38:02,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 140 flow [2023-11-28 23:38:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:38:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:38:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2023-11-28 23:38:02,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2023-11-28 23:38:02,568 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 131 transitions. [2023-11-28 23:38:02,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 131 transitions. [2023-11-28 23:38:02,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:02,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 131 transitions. [2023-11-28 23:38:02,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.2) internal successors, (131), 5 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-28 23:38:02,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,571 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,571 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 74 flow. Second operand 5 states and 131 transitions. [2023-11-28 23:38:02,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 140 flow [2023-11-28 23:38:02,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:02,572 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-28 23:38:02,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-28 23:38:02,573 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-11-28 23:38:02,574 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-28 23:38:02,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:02,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:38:02,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:38:02,574 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:02,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1675709442, now seen corresponding path program 1 times [2023-11-28 23:38:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:02,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070957285] [2023-11-28 23:38:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:02,709 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-28 23:38:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:02,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070957285] [2023-11-28 23:38:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070957285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:02,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:02,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:38:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790103015] [2023-11-28 23:38:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:02,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:38:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:38:02,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:38:02,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-28 23:38:02,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-28 23:38:02,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:02,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-28 23:38:02,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:02,830 INFO L124 PetriNetUnfolderBase]: 161/371 cut-off events. [2023-11-28 23:38:02,830 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 23:38:02,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 371 events. 161/371 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1856 event pairs, 24 based on Foata normal form. 20/380 useless extension candidates. Maximal degree in co-relation 678. Up to 166 conditions per place. [2023-11-28 23:38:02,833 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 28 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-11-28 23:38:02,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 172 flow [2023-11-28 23:38:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:38:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:38:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2023-11-28 23:38:02,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6761363636363636 [2023-11-28 23:38:02,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 119 transitions. [2023-11-28 23:38:02,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 119 transitions. [2023-11-28 23:38:02,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:02,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 119 transitions. [2023-11-28 23:38:02,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.75) internal successors, (119), 4 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-28 23:38:02,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,837 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:02,837 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 4 states and 119 transitions. [2023-11-28 23:38:02,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 172 flow [2023-11-28 23:38:02,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:02,839 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 93 flow [2023-11-28 23:38:02,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-11-28 23:38:02,840 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2023-11-28 23:38:02,840 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 93 flow [2023-11-28 23:38:02,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-28 23:38:02,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:02,841 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-28 23:38:02,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:38:02,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:02,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:02,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1014867551, now seen corresponding path program 1 times [2023-11-28 23:38:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088749026] [2023-11-28 23:38:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:03,035 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-28 23:38:03,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:03,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088749026] [2023-11-28 23:38:03,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088749026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:03,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:03,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:38:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967957442] [2023-11-28 23:38:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:03,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:38:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:38:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:38:03,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-28 23:38:03,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 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-28 23:38:03,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:03,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-28 23:38:03,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:03,148 INFO L124 PetriNetUnfolderBase]: 84/198 cut-off events. [2023-11-28 23:38:03,148 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-28 23:38:03,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 198 events. 84/198 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 675 event pairs, 16 based on Foata normal form. 14/204 useless extension candidates. Maximal degree in co-relation 444. Up to 71 conditions per place. [2023-11-28 23:38:03,150 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 24 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2023-11-28 23:38:03,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 185 flow [2023-11-28 23:38:03,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:38:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:38:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2023-11-28 23:38:03,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2023-11-28 23:38:03,151 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 138 transitions. [2023-11-28 23:38:03,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 138 transitions. [2023-11-28 23:38:03,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:03,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 138 transitions. [2023-11-28 23:38:03,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:03,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:03,153 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:03,153 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 93 flow. Second operand 5 states and 138 transitions. [2023-11-28 23:38:03,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 185 flow [2023-11-28 23:38:03,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:03,156 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 109 flow [2023-11-28 23:38:03,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-28 23:38:03,157 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-11-28 23:38:03,157 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 109 flow [2023-11-28 23:38:03,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 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-28 23:38:03,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:03,157 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-28 23:38:03,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:38:03,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:03,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash 868246024, now seen corresponding path program 1 times [2023-11-28 23:38:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18838303] [2023-11-28 23:38:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:03,409 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-28 23:38:03,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18838303] [2023-11-28 23:38:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18838303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:03,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:03,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:38:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136552880] [2023-11-28 23:38:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:03,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:38:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:38:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:38:03,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2023-11-28 23:38:03,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 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-28 23:38:03,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:03,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2023-11-28 23:38:03,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:03,687 INFO L124 PetriNetUnfolderBase]: 183/455 cut-off events. [2023-11-28 23:38:03,687 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-11-28 23:38:03,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 455 events. 183/455 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2187 event pairs, 44 based on Foata normal form. 8/454 useless extension candidates. Maximal degree in co-relation 986. Up to 145 conditions per place. [2023-11-28 23:38:03,690 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 23 selfloop transitions, 6 changer transitions 24/67 dead transitions. [2023-11-28 23:38:03,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 298 flow [2023-11-28 23:38:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:38:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 23:38:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2023-11-28 23:38:03,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5880681818181818 [2023-11-28 23:38:03,692 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 207 transitions. [2023-11-28 23:38:03,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 207 transitions. [2023-11-28 23:38:03,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:03,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 207 transitions. [2023-11-28 23:38:03,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:03,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:03,695 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:03,695 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 109 flow. Second operand 8 states and 207 transitions. [2023-11-28 23:38:03,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 298 flow [2023-11-28 23:38:03,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 258 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-28 23:38:03,699 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 129 flow [2023-11-28 23:38:03,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=129, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-11-28 23:38:03,700 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-11-28 23:38:03,701 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 129 flow [2023-11-28 23:38:03,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 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-28 23:38:03,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:03,701 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-28 23:38:03,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:38:03,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:03,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:03,702 INFO L85 PathProgramCache]: Analyzing trace with hash -608392764, now seen corresponding path program 2 times [2023-11-28 23:38:03,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:03,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161568630] [2023-11-28 23:38:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:04,234 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-28 23:38:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:38:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161568630] [2023-11-28 23:38:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161568630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:04,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:04,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 23:38:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432188849] [2023-11-28 23:38:04,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:38:04,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:38:04,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:38:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:38:04,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2023-11-28 23:38:04,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 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-28 23:38:04,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:04,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2023-11-28 23:38:04,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:04,543 INFO L124 PetriNetUnfolderBase]: 128/318 cut-off events. [2023-11-28 23:38:04,543 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-28 23:38:04,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 318 events. 128/318 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1369 event pairs, 49 based on Foata normal form. 4/305 useless extension candidates. Maximal degree in co-relation 721. Up to 82 conditions per place. [2023-11-28 23:38:04,545 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 18 selfloop transitions, 7 changer transitions 26/65 dead transitions. [2023-11-28 23:38:04,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 317 flow [2023-11-28 23:38:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:38:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:38:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2023-11-28 23:38:04,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5631313131313131 [2023-11-28 23:38:04,547 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 223 transitions. [2023-11-28 23:38:04,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 223 transitions. [2023-11-28 23:38:04,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:04,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 223 transitions. [2023-11-28 23:38:04,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 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-28 23:38:04,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:04,549 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:04,550 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 129 flow. Second operand 9 states and 223 transitions. [2023-11-28 23:38:04,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 317 flow [2023-11-28 23:38:04,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 298 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-28 23:38:04,553 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 154 flow [2023-11-28 23:38:04,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2023-11-28 23:38:04,554 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2023-11-28 23:38:04,554 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 154 flow [2023-11-28 23:38:04,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 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-28 23:38:04,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:04,554 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-28 23:38:04,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:38:04,555 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:04,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash 406778450, now seen corresponding path program 3 times [2023-11-28 23:38:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:38:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517064707] [2023-11-28 23:38:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:38:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:38:04,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:38:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:38:04,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:38:04,640 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:38:04,640 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-28 23:38:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-28 23:38:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-28 23:38:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-28 23:38:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-28 23:38:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-28 23:38:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-28 23:38:04,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-28 23:38:04,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-28 23:38:04,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-28 23:38:04,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:38:04,643 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:38:04,648 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:38:04,648 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:38:04,684 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:38:04,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:38:04,694 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:38:04,695 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:38:04,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:38:04 BasicIcfg [2023-11-28 23:38:04,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:38:04,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:38:04,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:38:04,707 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:38:04,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:00" (3/4) ... [2023-11-28 23:38:04,708 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:38:04,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:38:04,709 INFO L158 Benchmark]: Toolchain (without parser) took 5548.19ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 117.6MB in the beginning and 118.3MB in the end (delta: -679.2kB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2023-11-28 23:38:04,710 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:38:04,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.50ms. Allocated memory is still 151.0MB. Free memory was 117.6MB in the beginning and 95.1MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-28 23:38:04,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.80ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 92.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:38:04,711 INFO L158 Benchmark]: Boogie Preprocessor took 47.95ms. Allocated memory is still 151.0MB. Free memory was 92.4MB in the beginning and 89.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:38:04,711 INFO L158 Benchmark]: RCFGBuilder took 649.27ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 89.3MB in the beginning and 148.5MB in the end (delta: -59.2MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2023-11-28 23:38:04,711 INFO L158 Benchmark]: TraceAbstraction took 4289.18ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 147.4MB in the beginning and 119.3MB in the end (delta: 28.1MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2023-11-28 23:38:04,712 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 226.5MB. Free memory was 119.3MB in the beginning and 118.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:38:04,713 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.15ms. Allocated memory is still 151.0MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.50ms. Allocated memory is still 151.0MB. Free memory was 117.6MB in the beginning and 95.1MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.80ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 92.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.95ms. Allocated memory is still 151.0MB. Free memory was 92.4MB in the beginning and 89.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 649.27ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 89.3MB in the beginning and 148.5MB in the end (delta: -59.2MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4289.18ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 147.4MB in the beginning and 119.3MB in the end (delta: 28.1MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 226.5MB. Free memory was 119.3MB in the beginning and 118.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 63 locations, 10 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: 4.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 725 IncrementalHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 31 mSDtfsCounter, 725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=10, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-28 23:38:04,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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_13cf1fdd-c159-4eea-84f3-b553d7407120/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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:38:06,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:38:06,750 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 23:38:06,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:38:06,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:38:06,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:38:06,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:38:06,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:38:06,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:38:06,794 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:38:06,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:38:06,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:38:06,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:38:06,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:38:06,797 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:38:06,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:38:06,798 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:38:06,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:38:06,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:38:06,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:38:06,800 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:38:06,802 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:38:06,802 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:38:06,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:38:06,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:38:06,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:38:06,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:38:06,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:38:06,804 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:38:06,805 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:38:06,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:38:06,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:38:06,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:38:06,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:38:06,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:38:06,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:38:06,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:38:06,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:38:06,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:38:06,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:38:06,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:38:06,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:38:06,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:38:06,808 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:38:06,809 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_13cf1fdd-c159-4eea-84f3-b553d7407120/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_13cf1fdd-c159-4eea-84f3-b553d7407120/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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2023-11-28 23:38:07,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:38:07,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:38:07,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:38:07,112 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:38:07,112 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:38:07,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-28 23:38:09,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:38:10,165 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:38:10,166 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-28 23:38:10,182 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data/c479f62ad/1a5e2161e998431f96c9191f60190f74/FLAGf88f17879 [2023-11-28 23:38:10,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/data/c479f62ad/1a5e2161e998431f96c9191f60190f74 [2023-11-28 23:38:10,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:38:10,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:38:10,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:38:10,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:38:10,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:38:10,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551c8ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10, skipping insertion in model container [2023-11-28 23:38:10,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:38:10,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:38:10,621 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:38:10,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:38:10,744 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:38:10,744 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:38:10,752 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:38:10,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10 WrapperNode [2023-11-28 23:38:10,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:38:10,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:38:10,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:38:10,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:38:10,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,805 INFO L138 Inliner]: procedures = 178, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2023-11-28 23:38:10,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:38:10,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:38:10,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:38:10,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:38:10,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,838 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-28 23:38:10,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:38:10,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:38:10,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:38:10,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:38:10,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (1/1) ... [2023-11-28 23:38:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:38:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:38:10,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:38:10,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:38:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:38:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 23:38:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 23:38:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:38:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:38:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:38:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:38:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:38:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:38:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:38:10,929 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:38:11,081 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:38:11,083 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:38:11,367 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:38:11,548 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:38:11,548 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:38:11,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:11 BoogieIcfgContainer [2023-11-28 23:38:11,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:38:11,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:38:11,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:38:11,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:38:11,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:38:10" (1/3) ... [2023-11-28 23:38:11,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4768932a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:11, skipping insertion in model container [2023-11-28 23:38:11,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:10" (2/3) ... [2023-11-28 23:38:11,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4768932a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:11, skipping insertion in model container [2023-11-28 23:38:11,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:11" (3/3) ... [2023-11-28 23:38:11,556 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-28 23:38:11,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:38:11,570 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-28 23:38:11,570 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:38:11,615 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:38:11,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 96 flow [2023-11-28 23:38:11,677 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2023-11-28 23:38:11,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:38:11,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-28 23:38:11,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 96 flow [2023-11-28 23:38:11,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 42 transitions, 90 flow [2023-11-28 23:38:11,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:38:11,702 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;@1ed919a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:38:11,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-28 23:38:11,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:38:11,711 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:38:11,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:38:11,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:11,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:38:11,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:11,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash 11559, now seen corresponding path program 1 times [2023-11-28 23:38:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871265345] [2023-11-28 23:38:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:11,732 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-28 23:38:11,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:11,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:11,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:11,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:38:11,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:11,899 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-28 23:38:11,910 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-28 23:38:11,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:11,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:11,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871265345] [2023-11-28 23:38:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871265345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:38:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923413508] [2023-11-28 23:38:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:11,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:11,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:11,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:11,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:11,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-28 23:38:11,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:11,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:11,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-28 23:38:11,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:12,160 INFO L124 PetriNetUnfolderBase]: 166/414 cut-off events. [2023-11-28 23:38:12,161 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 23:38:12,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 414 events. 166/414 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2526 event pairs, 122 based on Foata normal form. 30/400 useless extension candidates. Maximal degree in co-relation 707. Up to 220 conditions per place. [2023-11-28 23:38:12,167 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 22 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-28 23:38:12,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 142 flow [2023-11-28 23:38:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-28 23:38:12,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-28 23:38:12,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-28 23:38:12,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-28 23:38:12,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:12,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-28 23:38:12,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:12,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:12,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:12,193 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 93 transitions. [2023-11-28 23:38:12,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 142 flow [2023-11-28 23:38:12,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:12,199 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-28 23:38:12,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-28 23:38:12,204 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-28 23:38:12,205 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-28 23:38:12,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:12,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:12,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:38:12,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:12,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:12,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:12,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 11560, now seen corresponding path program 1 times [2023-11-28 23:38:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:12,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384864438] [2023-11-28 23:38:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:12,408 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-28 23:38:12,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:12,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:12,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:12,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:38:12,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:12,487 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-28 23:38:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:38:12,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:12,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:12,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384864438] [2023-11-28 23:38:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384864438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:12,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:38:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692381437] [2023-11-28 23:38:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:12,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:12,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:12,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 44 [2023-11-28 23:38:12,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:12,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:12,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 44 [2023-11-28 23:38:12,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:12,678 INFO L124 PetriNetUnfolderBase]: 166/413 cut-off events. [2023-11-28 23:38:12,678 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 23:38:12,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 413 events. 166/413 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2540 event pairs, 122 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 722. Up to 219 conditions per place. [2023-11-28 23:38:12,683 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 21 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-28 23:38:12,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 140 flow [2023-11-28 23:38:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-28 23:38:12,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-28 23:38:12,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-28 23:38:12,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-28 23:38:12,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:12,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-28 23:38:12,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:12,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:12,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:12,689 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 93 transitions. [2023-11-28 23:38:12,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 140 flow [2023-11-28 23:38:12,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:12,692 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-28 23:38:12,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-28 23:38:12,693 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-11-28 23:38:12,693 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-28 23:38:12,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:12,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:12,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:38:12,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 23:38:12,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:12,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:12,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 344674777, now seen corresponding path program 1 times [2023-11-28 23:38:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:12,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516143241] [2023-11-28 23:38:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:12,896 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-28 23:38:12,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:12,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:12,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:12,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:38:12,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:12,976 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-28 23:38:12,983 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-28 23:38:12,983 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:12,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:12,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516143241] [2023-11-28 23:38:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516143241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:12,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:12,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:38:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168325107] [2023-11-28 23:38:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:12,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:12,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:12,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:13,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2023-11-28 23:38:13,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:13,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2023-11-28 23:38:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:13,108 INFO L124 PetriNetUnfolderBase]: 168/407 cut-off events. [2023-11-28 23:38:13,109 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 23:38:13,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 407 events. 168/407 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2445 event pairs, 127 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 721. Up to 220 conditions per place. [2023-11-28 23:38:13,124 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 22 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-28 23:38:13,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 140 flow [2023-11-28 23:38:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2023-11-28 23:38:13,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2023-11-28 23:38:13,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 91 transitions. [2023-11-28 23:38:13,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 91 transitions. [2023-11-28 23:38:13,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:13,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 91 transitions. [2023-11-28 23:38:13,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:13,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,130 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 91 transitions. [2023-11-28 23:38:13,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 140 flow [2023-11-28 23:38:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:13,133 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-28 23:38:13,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-28 23:38:13,134 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-11-28 23:38:13,134 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-28 23:38:13,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:13,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:38:13,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-28 23:38:13,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:13,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:13,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 344674778, now seen corresponding path program 1 times [2023-11-28 23:38:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928182156] [2023-11-28 23:38:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:13,337 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-28 23:38:13,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:13,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:13,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:13,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:38:13,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:13,434 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-28 23:38:13,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-28 23:38:13,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:13,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928182156] [2023-11-28 23:38:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928182156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:38:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664127268] [2023-11-28 23:38:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:13,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:13,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 44 [2023-11-28 23:38:13,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:13,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 44 [2023-11-28 23:38:13,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:13,571 INFO L124 PetriNetUnfolderBase]: 166/402 cut-off events. [2023-11-28 23:38:13,572 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-28 23:38:13,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 402 events. 166/402 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2435 event pairs, 125 based on Foata normal form. 3/368 useless extension candidates. Maximal degree in co-relation 714. Up to 215 conditions per place. [2023-11-28 23:38:13,575 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 21 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-28 23:38:13,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 136 flow [2023-11-28 23:38:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-28 23:38:13,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-28 23:38:13,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-28 23:38:13,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-28 23:38:13,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:13,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-28 23:38:13,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-28 23:38:13,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,580 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 93 transitions. [2023-11-28 23:38:13,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 136 flow [2023-11-28 23:38:13,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:13,583 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-28 23:38:13,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-28 23:38:13,584 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2023-11-28 23:38:13,584 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-28 23:38:13,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:13,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:38:13,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-28 23:38:13,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:13,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:13,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1060203703, now seen corresponding path program 1 times [2023-11-28 23:38:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307871367] [2023-11-28 23:38:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:13,788 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-28 23:38:13,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:13,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:13,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:13,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:38:13,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:13,885 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-28 23:38:13,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:13,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:13,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307871367] [2023-11-28 23:38:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307871367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:13,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:13,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:38:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194928099] [2023-11-28 23:38:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:13,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:38:13,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:13,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:38:13,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:38:13,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 44 [2023-11-28 23:38:13,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:13,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 44 [2023-11-28 23:38:13,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:13,980 INFO L124 PetriNetUnfolderBase]: 129/358 cut-off events. [2023-11-28 23:38:13,980 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-28 23:38:13,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 358 events. 129/358 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2052 event pairs, 18 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 606. Up to 184 conditions per place. [2023-11-28 23:38:13,982 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 21 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-11-28 23:38:13,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 146 flow [2023-11-28 23:38:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:38:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:38:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-28 23:38:13,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2023-11-28 23:38:13,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-28 23:38:13,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-28 23:38:13,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:13,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-28 23:38:13,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,987 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 98 transitions. [2023-11-28 23:38:13,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 146 flow [2023-11-28 23:38:13,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:13,989 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 74 flow [2023-11-28 23:38:13,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-28 23:38:13,990 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-11-28 23:38:13,990 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 74 flow [2023-11-28 23:38:13,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:13,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:13,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:38:13,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:14,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2012560112, now seen corresponding path program 1 times [2023-11-28 23:38:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277720706] [2023-11-28 23:38:14,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:14,193 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-28 23:38:14,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:14,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:14,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:38:14,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:14,293 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-28 23:38:14,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:14,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:14,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277720706] [2023-11-28 23:38:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277720706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:38:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830452470] [2023-11-28 23:38:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:14,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:38:14,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:14,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:38:14,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:38:14,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-28 23:38:14,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-28 23:38:14,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:14,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-28 23:38:14,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:14,444 INFO L124 PetriNetUnfolderBase]: 180/418 cut-off events. [2023-11-28 23:38:14,444 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-28 23:38:14,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 418 events. 180/418 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2177 event pairs, 24 based on Foata normal form. 20/428 useless extension candidates. Maximal degree in co-relation 778. Up to 199 conditions per place. [2023-11-28 23:38:14,447 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2023-11-28 23:38:14,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 180 flow [2023-11-28 23:38:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:38:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:38:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2023-11-28 23:38:14,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-28 23:38:14,450 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 120 transitions. [2023-11-28 23:38:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 120 transitions. [2023-11-28 23:38:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:14,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 120 transitions. [2023-11-28 23:38:14,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-28 23:38:14,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:14,452 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:14,453 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 74 flow. Second operand 4 states and 120 transitions. [2023-11-28 23:38:14,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 180 flow [2023-11-28 23:38:14,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:14,455 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 96 flow [2023-11-28 23:38:14,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-11-28 23:38:14,456 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-11-28 23:38:14,456 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 96 flow [2023-11-28 23:38:14,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-28 23:38:14,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:14,457 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-28 23:38:14,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,660 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:14,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash 280917971, now seen corresponding path program 1 times [2023-11-28 23:38:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836759410] [2023-11-28 23:38:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:14,661 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-28 23:38:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:14,662 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:14,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:38:14,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:14,802 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-28 23:38:14,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:14,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:14,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836759410] [2023-11-28 23:38:14,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836759410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:38:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545707399] [2023-11-28 23:38:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:14,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:38:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:38:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:38:14,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-28 23:38:14,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 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-28 23:38:14,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:14,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-28 23:38:14,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:14,940 INFO L124 PetriNetUnfolderBase]: 88/210 cut-off events. [2023-11-28 23:38:14,940 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-28 23:38:14,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 210 events. 88/210 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 734 event pairs, 16 based on Foata normal form. 14/216 useless extension candidates. Maximal degree in co-relation 460. Up to 71 conditions per place. [2023-11-28 23:38:14,941 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 25 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2023-11-28 23:38:14,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 189 flow [2023-11-28 23:38:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:38:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:38:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2023-11-28 23:38:14,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2023-11-28 23:38:14,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 139 transitions. [2023-11-28 23:38:14,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 139 transitions. [2023-11-28 23:38:14,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:14,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 139 transitions. [2023-11-28 23:38:14,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:14,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:14,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:14,945 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 96 flow. Second operand 5 states and 139 transitions. [2023-11-28 23:38:14,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 189 flow [2023-11-28 23:38:14,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 23:38:14,948 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 112 flow [2023-11-28 23:38:14,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-11-28 23:38:14,949 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2023-11-28 23:38:14,950 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 112 flow [2023-11-28 23:38:14,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 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-28 23:38:14,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:14,950 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-28 23:38:14,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:15,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:15,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:15,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2059777592, now seen corresponding path program 1 times [2023-11-28 23:38:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:15,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305751213] [2023-11-28 23:38:15,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:15,152 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-28 23:38:15,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:15,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:15,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:15,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 23:38:15,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:15,602 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1633~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1634~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1633~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1634~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1633~0#1.base_51|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1633~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1634~0#1.base_47|)))) is different from true [2023-11-28 23:38:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:38:15,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:15,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305751213] [2023-11-28 23:38:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305751213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:38:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775756669] [2023-11-28 23:38:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:15,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:38:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:38:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-28 23:38:15,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2023-11-28 23:38:15,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:15,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:15,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2023-11-28 23:38:15,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:15,744 INFO L124 PetriNetUnfolderBase]: 52/156 cut-off events. [2023-11-28 23:38:15,744 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-28 23:38:15,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 156 events. 52/156 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 541 event pairs, 18 based on Foata normal form. 4/148 useless extension candidates. Maximal degree in co-relation 308. Up to 94 conditions per place. [2023-11-28 23:38:15,745 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 19 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2023-11-28 23:38:15,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 172 flow [2023-11-28 23:38:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:38:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:38:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2023-11-28 23:38:15,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-28 23:38:15,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 110 transitions. [2023-11-28 23:38:15,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 110 transitions. [2023-11-28 23:38:15,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:15,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 110 transitions. [2023-11-28 23:38:15,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:15,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:15,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:15,750 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 112 flow. Second operand 5 states and 110 transitions. [2023-11-28 23:38:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 172 flow [2023-11-28 23:38:15,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 144 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-28 23:38:15,752 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 107 flow [2023-11-28 23:38:15,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-28 23:38:15,753 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-11-28 23:38:15,754 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 107 flow [2023-11-28 23:38:15,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:15,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:15,754 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-28 23:38:15,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-28 23:38:15,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:15,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:15,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 522160136, now seen corresponding path program 1 times [2023-11-28 23:38:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:15,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373810326] [2023-11-28 23:38:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:38:15,959 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-28 23:38:15,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:15,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:15,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:16,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:38:16,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:16,086 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-28 23:38:16,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:16,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373810326] [2023-11-28 23:38:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373810326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:38:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20930643] [2023-11-28 23:38:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:38:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:38:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:38:16,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2023-11-28 23:38:16,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 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-28 23:38:16,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:16,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2023-11-28 23:38:16,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:16,244 INFO L124 PetriNetUnfolderBase]: 118/321 cut-off events. [2023-11-28 23:38:16,245 INFO L125 PetriNetUnfolderBase]: For 96/100 co-relation queries the response was YES. [2023-11-28 23:38:16,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 321 events. 118/321 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1385 event pairs, 57 based on Foata normal form. 4/313 useless extension candidates. Maximal degree in co-relation 694. Up to 139 conditions per place. [2023-11-28 23:38:16,247 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 32 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-11-28 23:38:16,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 236 flow [2023-11-28 23:38:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:38:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:38:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2023-11-28 23:38:16,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2023-11-28 23:38:16,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 139 transitions. [2023-11-28 23:38:16,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 139 transitions. [2023-11-28 23:38:16,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:16,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 139 transitions. [2023-11-28 23:38:16,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:16,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:16,251 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:16,251 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 107 flow. Second operand 5 states and 139 transitions. [2023-11-28 23:38:16,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 236 flow [2023-11-28 23:38:16,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:38:16,254 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 138 flow [2023-11-28 23:38:16,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-28 23:38:16,255 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2023-11-28 23:38:16,255 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 138 flow [2023-11-28 23:38:16,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 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-28 23:38:16,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:16,256 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-28 23:38:16,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:16,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:16,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:16,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash 583138628, now seen corresponding path program 2 times [2023-11-28 23:38:16,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:16,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393436279] [2023-11-28 23:38:16,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:38:16,461 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-28 23:38:16,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:16,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:16,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:16,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 23:38:16,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:38:16,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 23:38:16,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:16,783 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-28 23:38:16,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:38:16,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:38:16,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393436279] [2023-11-28 23:38:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393436279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:38:16,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:38:16,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 23:38:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133752561] [2023-11-28 23:38:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:38:16,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:38:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:38:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:38:16,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 44 [2023-11-28 23:38:16,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 138 flow. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:16,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:38:16,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 44 [2023-11-28 23:38:16,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:38:17,049 INFO L124 PetriNetUnfolderBase]: 155/440 cut-off events. [2023-11-28 23:38:17,050 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2023-11-28 23:38:17,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 440 events. 155/440 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2194 event pairs, 38 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 1059. Up to 165 conditions per place. [2023-11-28 23:38:17,053 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 35 selfloop transitions, 12 changer transitions 0/67 dead transitions. [2023-11-28 23:38:17,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 332 flow [2023-11-28 23:38:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:38:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:38:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2023-11-28 23:38:17,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6186868686868687 [2023-11-28 23:38:17,055 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 245 transitions. [2023-11-28 23:38:17,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 245 transitions. [2023-11-28 23:38:17,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:38:17,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 245 transitions. [2023-11-28 23:38:17,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:17,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:17,059 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:17,059 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 138 flow. Second operand 9 states and 245 transitions. [2023-11-28 23:38:17,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 332 flow [2023-11-28 23:38:17,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:38:17,063 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 230 flow [2023-11-28 23:38:17,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=230, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-11-28 23:38:17,064 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2023-11-28 23:38:17,064 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 230 flow [2023-11-28 23:38:17,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:38:17,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:38:17,065 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-28 23:38:17,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:17,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:17,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-28 23:38:17,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:38:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash 279853572, now seen corresponding path program 3 times [2023-11-28 23:38:17,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:38:17,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872565443] [2023-11-28 23:38:17,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:38:17,268 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-28 23:38:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:38:17,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:17,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:17,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-28 23:38:17,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-28 23:38:17,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:38:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:38:17,465 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-28 23:38:17,465 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:38:17,466 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-28 23:38:17,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-28 23:38:17,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-28 23:38:17,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-28 23:38:17,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-28 23:38:17,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-28 23:38:17,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-28 23:38:17,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-28 23:38:17,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-28 23:38:17,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-28 23:38:17,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:17,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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-28 23:38:17,670 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:38:17,676 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:38:17,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:38:17,717 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:38:17,720 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:38:17,729 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:38:17,730 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:38:17,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:38:17 BasicIcfg [2023-11-28 23:38:17,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:38:17,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:38:17,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:38:17,742 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:38:17,742 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:11" (3/4) ... [2023-11-28 23:38:17,744 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:38:17,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:38:17,746 INFO L158 Benchmark]: Toolchain (without parser) took 7548.65ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 57.7MB in the beginning and 78.8MB in the end (delta: -21.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-11-28 23:38:17,746 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:38:17,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.31ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 53.9MB in the end (delta: 3.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-11-28 23:38:17,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.06ms. Allocated memory is still 81.8MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:38:17,747 INFO L158 Benchmark]: Boogie Preprocessor took 52.20ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 48.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:38:17,748 INFO L158 Benchmark]: RCFGBuilder took 689.76ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 47.8MB in the end (delta: 163.1kB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-11-28 23:38:17,748 INFO L158 Benchmark]: TraceAbstraction took 6190.79ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 46.9MB in the beginning and 79.8MB in the end (delta: -32.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-11-28 23:38:17,749 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 119.5MB. Free memory was 79.8MB in the beginning and 78.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:38:17,751 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.20ms. Allocated memory is still 60.8MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.31ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 53.9MB in the end (delta: 3.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.06ms. Allocated memory is still 81.8MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.20ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 48.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 689.76ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 47.8MB in the end (delta: 163.1kB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6190.79ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 46.9MB in the beginning and 79.8MB in the end (delta: -32.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 119.5MB. Free memory was 79.8MB in the beginning and 78.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={7:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={7:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={7:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={7:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 63 locations, 10 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: 6.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 33 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619 IncrementalHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 11 mSDtfsCounter, 619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=10, InterpolantAutomatonStates: 43, 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.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 132 ConstructedInterpolants, 1 QuantifiedInterpolants, 951 SizeOfPredicates, 8 NumberOfNonLiveVariables, 932 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-28 23:38:17,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cf1fdd-c159-4eea-84f3-b553d7407120/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