./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe026_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 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU --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 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:10:11,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:10:11,861 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:10:11,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:10:11,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:10:11,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:10:11,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:10:11,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:10:11,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:10:11,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:10:11,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:10:11,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:10:11,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:10:11,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:10:11,917 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:10:11,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:10:11,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:10:11,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:10:11,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:10:11,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:10:11,920 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:10:11,923 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:10:11,923 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:10:11,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:10:11,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:10:11,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:10:11,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:10:11,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:10:11,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:10:11,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:10:11,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:10:11,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:10:11,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:10:11,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:11,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:10:11,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:10:11,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:10:11,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:10:11,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:10:11,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:10:11,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:10:11,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:10:11,947 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_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/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_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac [2024-10-31 22:10:12,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:10:12,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:10:12,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:10:12,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:10:12,329 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:10:12,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i Unable to find full path for "g++" [2024-10-31 22:10:14,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:10:14,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:10:14,874 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-31 22:10:14,893 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data/768907c21/8635ab75b1a44755b5c0189dac6431da/FLAG70990b4b2 [2024-10-31 22:10:15,110 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data/768907c21/8635ab75b1a44755b5c0189dac6431da [2024-10-31 22:10:15,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:10:15,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:10:15,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:15,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:10:15,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:10:15,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:15,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a83754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15, skipping insertion in model container [2024-10-31 22:10:15,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:15,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:10:15,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:15,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:10:15,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:15,940 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:10:15,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15 WrapperNode [2024-10-31 22:10:15,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:15,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:15,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:10:15,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:10:15,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:15,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,017 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2024-10-31 22:10:16,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:16,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:10:16,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:10:16,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:10:16,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,056 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:10:16,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:10:16,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:10:16,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:10:16,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:10:16,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (1/1) ... [2024-10-31 22:10:16,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:16,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:10:16,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:10:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:10:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:10:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:10:16,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:10:16,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:10:16,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:10:16,160 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:10:16,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:10:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:10:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:10:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:10:16,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:10:16,163 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:10:16,354 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:10:16,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:10:16,777 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:10:16,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:10:17,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:10:17,032 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:10:17,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:17 BoogieIcfgContainer [2024-10-31 22:10:17,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:10:17,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:10:17,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:10:17,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:10:17,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:10:15" (1/3) ... [2024-10-31 22:10:17,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62612c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:17, skipping insertion in model container [2024-10-31 22:10:17,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:15" (2/3) ... [2024-10-31 22:10:17,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62612c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:17, skipping insertion in model container [2024-10-31 22:10:17,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:17" (3/3) ... [2024-10-31 22:10:17,045 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-31 22:10:17,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:10:17,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:10:17,068 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:10:17,124 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:10:17,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2024-10-31 22:10:17,231 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-10-31 22:10:17,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:10:17,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-10-31 22:10:17,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2024-10-31 22:10:17,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2024-10-31 22:10:17,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:10:17,262 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@20226d56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:10:17,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 22:10:17,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:10:17,269 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-31 22:10:17,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:10:17,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:17,270 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:10:17,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:17,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash 11875931, now seen corresponding path program 1 times [2024-10-31 22:10:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:17,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979904947] [2024-10-31 22:10:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:17,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979904947] [2024-10-31 22:10:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979904947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:10:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512041647] [2024-10-31 22:10:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:17,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:17,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-10-31 22:10:17,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:17,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:17,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-10-31 22:10:17,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:18,515 INFO L124 PetriNetUnfolderBase]: 825/1526 cut-off events. [2024-10-31 22:10:18,516 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-31 22:10:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1526 events. 825/1526 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9667 event pairs, 129 based on Foata normal form. 96/1611 useless extension candidates. Maximal degree in co-relation 2796. Up to 1009 conditions per place. [2024-10-31 22:10:18,535 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-10-31 22:10:18,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2024-10-31 22:10:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-31 22:10:18,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-10-31 22:10:18,551 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2024-10-31 22:10:18,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2024-10-31 22:10:18,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:10:18,560 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-10-31 22:10:18,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=45, PETRI_TRANSITIONS=35} [2024-10-31 22:10:18,568 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2024-10-31 22:10:18,568 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-10-31 22:10:18,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:18,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:18,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:18,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:10:18,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 845269929, now seen corresponding path program 1 times [2024-10-31 22:10:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:18,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395723770] [2024-10-31 22:10:18,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:18,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395723770] [2024-10-31 22:10:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395723770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:10:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925061948] [2024-10-31 22:10:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:18,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:18,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-10-31 22:10:18,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:18,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:18,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-10-31 22:10:18,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:19,079 INFO L124 PetriNetUnfolderBase]: 721/1369 cut-off events. [2024-10-31 22:10:19,080 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-31 22:10:19,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 1369 events. 721/1369 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8523 event pairs, 721 based on Foata normal form. 48/1371 useless extension candidates. Maximal degree in co-relation 2579. Up to 1090 conditions per place. [2024-10-31 22:10:19,092 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-10-31 22:10:19,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 118 flow [2024-10-31 22:10:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-10-31 22:10:19,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-10-31 22:10:19,096 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 72 transitions. [2024-10-31 22:10:19,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 118 flow [2024-10-31 22:10:19,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:10:19,098 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2024-10-31 22:10:19,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-10-31 22:10:19,100 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-10-31 22:10:19,100 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2024-10-31 22:10:19,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:19,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:19,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:19,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:10:19,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:19,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:19,103 INFO L85 PathProgramCache]: Analyzing trace with hash 845271543, now seen corresponding path program 1 times [2024-10-31 22:10:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:19,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234149504] [2024-10-31 22:10:19,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234149504] [2024-10-31 22:10:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234149504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:19,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:19,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909904737] [2024-10-31 22:10:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:19,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:19,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:19,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-10-31 22:10:19,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:19,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:19,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-10-31 22:10:19,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:20,340 INFO L124 PetriNetUnfolderBase]: 1855/3065 cut-off events. [2024-10-31 22:10:20,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:10:20,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 3065 events. 1855/3065 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19085 event pairs, 763 based on Foata normal form. 0/2988 useless extension candidates. Maximal degree in co-relation 5869. Up to 1723 conditions per place. [2024-10-31 22:10:20,356 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 32 selfloop transitions, 3 changer transitions 48/93 dead transitions. [2024-10-31 22:10:20,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 364 flow [2024-10-31 22:10:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:10:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:10:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-10-31 22:10:20,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5726744186046512 [2024-10-31 22:10:20,363 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 8 states and 197 transitions. [2024-10-31 22:10:20,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 364 flow [2024-10-31 22:10:20,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:10:20,366 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 106 flow [2024-10-31 22:10:20,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2024-10-31 22:10:20,368 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2024-10-31 22:10:20,369 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 106 flow [2024-10-31 22:10:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:20,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:20,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:20,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:10:20,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:20,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1413021546, now seen corresponding path program 1 times [2024-10-31 22:10:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3191383] [2024-10-31 22:10:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:20,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3191383] [2024-10-31 22:10:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3191383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:20,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:20,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291288261] [2024-10-31 22:10:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:20,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:20,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-10-31 22:10:20,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:20,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:20,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-10-31 22:10:20,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:21,299 INFO L124 PetriNetUnfolderBase]: 1340/2301 cut-off events. [2024-10-31 22:10:21,300 INFO L125 PetriNetUnfolderBase]: For 930/930 co-relation queries the response was YES. [2024-10-31 22:10:21,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 2301 events. 1340/2301 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14400 event pairs, 314 based on Foata normal form. 90/2313 useless extension candidates. Maximal degree in co-relation 5169. Up to 1310 conditions per place. [2024-10-31 22:10:21,316 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 27 selfloop transitions, 2 changer transitions 31/73 dead transitions. [2024-10-31 22:10:21,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 314 flow [2024-10-31 22:10:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:10:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:10:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-10-31 22:10:21,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5548172757475083 [2024-10-31 22:10:21,320 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 106 flow. Second operand 7 states and 167 transitions. [2024-10-31 22:10:21,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 314 flow [2024-10-31 22:10:21,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 303 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-10-31 22:10:21,342 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 115 flow [2024-10-31 22:10:21,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=7, PETRI_FLOW=115, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2024-10-31 22:10:21,343 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2024-10-31 22:10:21,345 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 115 flow [2024-10-31 22:10:21,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:21,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:21,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:10:21,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1297551061, now seen corresponding path program 1 times [2024-10-31 22:10:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885528568] [2024-10-31 22:10:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885528568] [2024-10-31 22:10:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885528568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:21,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870652181] [2024-10-31 22:10:21,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:21,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:10:21,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:21,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:10:21,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:21,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-10-31 22:10:21,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:21,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:21,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-10-31 22:10:21,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:22,608 INFO L124 PetriNetUnfolderBase]: 2297/3763 cut-off events. [2024-10-31 22:10:22,609 INFO L125 PetriNetUnfolderBase]: For 2961/2963 co-relation queries the response was YES. [2024-10-31 22:10:22,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9433 conditions, 3763 events. 2297/3763 cut-off events. For 2961/2963 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23192 event pairs, 341 based on Foata normal form. 74/3835 useless extension candidates. Maximal degree in co-relation 9417. Up to 1639 conditions per place. [2024-10-31 22:10:22,631 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 39 selfloop transitions, 4 changer transitions 29/81 dead transitions. [2024-10-31 22:10:22,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 406 flow [2024-10-31 22:10:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-10-31 22:10:22,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5852713178294574 [2024-10-31 22:10:22,634 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 115 flow. Second operand 6 states and 151 transitions. [2024-10-31 22:10:22,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 406 flow [2024-10-31 22:10:22,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 388 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-10-31 22:10:22,667 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 120 flow [2024-10-31 22:10:22,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2024-10-31 22:10:22,668 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2024-10-31 22:10:22,668 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 120 flow [2024-10-31 22:10:22,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:22,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:22,669 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:22,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:10:22,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1906468565, now seen corresponding path program 2 times [2024-10-31 22:10:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:22,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382702000] [2024-10-31 22:10:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382702000] [2024-10-31 22:10:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382702000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:22,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:10:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099447418] [2024-10-31 22:10:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:22,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:22,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:22,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-10-31 22:10:22,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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) [2024-10-31 22:10:22,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:22,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-10-31 22:10:22,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:23,441 INFO L124 PetriNetUnfolderBase]: 1797/3073 cut-off events. [2024-10-31 22:10:23,441 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2024-10-31 22:10:23,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6839 conditions, 3073 events. 1797/3073 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18684 event pairs, 254 based on Foata normal form. 119/3143 useless extension candidates. Maximal degree in co-relation 6824. Up to 1561 conditions per place. [2024-10-31 22:10:23,466 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 43 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2024-10-31 22:10:23,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 270 flow [2024-10-31 22:10:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-10-31 22:10:23,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2024-10-31 22:10:23,469 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 120 flow. Second operand 4 states and 106 transitions. [2024-10-31 22:10:23,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 270 flow [2024-10-31 22:10:23,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 256 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-10-31 22:10:23,481 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 144 flow [2024-10-31 22:10:23,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2024-10-31 22:10:23,482 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2024-10-31 22:10:23,482 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 144 flow [2024-10-31 22:10:23,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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) [2024-10-31 22:10:23,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:23,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:23,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:10:23,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:23,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -763166058, now seen corresponding path program 1 times [2024-10-31 22:10:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5798486] [2024-10-31 22:10:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:23,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5798486] [2024-10-31 22:10:23,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5798486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:23,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:23,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028520594] [2024-10-31 22:10:23,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:23,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:23,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:23,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:23,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-10-31 22:10:23,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:23,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:23,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-10-31 22:10:23,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:24,318 INFO L124 PetriNetUnfolderBase]: 1253/2159 cut-off events. [2024-10-31 22:10:24,318 INFO L125 PetriNetUnfolderBase]: For 727/727 co-relation queries the response was YES. [2024-10-31 22:10:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 2159 events. 1253/2159 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12087 event pairs, 172 based on Foata normal form. 96/2217 useless extension candidates. Maximal degree in co-relation 5215. Up to 641 conditions per place. [2024-10-31 22:10:24,339 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 55 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-10-31 22:10:24,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 363 flow [2024-10-31 22:10:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:10:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:10:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-10-31 22:10:24,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-10-31 22:10:24,341 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 144 flow. Second operand 5 states and 135 transitions. [2024-10-31 22:10:24,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 363 flow [2024-10-31 22:10:24,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:10:24,345 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 196 flow [2024-10-31 22:10:24,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-10-31 22:10:24,347 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2024-10-31 22:10:24,347 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 196 flow [2024-10-31 22:10:24,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:24,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:24,348 INFO L204 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] [2024-10-31 22:10:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:10:24,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 219809568, now seen corresponding path program 1 times [2024-10-31 22:10:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885765092] [2024-10-31 22:10:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:24,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:24,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885765092] [2024-10-31 22:10:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885765092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:24,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904560205] [2024-10-31 22:10:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:24,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:10:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:10:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:24,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-10-31 22:10:24,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:24,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:24,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-10-31 22:10:24,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:25,250 INFO L124 PetriNetUnfolderBase]: 949/1591 cut-off events. [2024-10-31 22:10:25,250 INFO L125 PetriNetUnfolderBase]: For 1725/1725 co-relation queries the response was YES. [2024-10-31 22:10:25,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4404 conditions, 1591 events. 949/1591 cut-off events. For 1725/1725 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8408 event pairs, 162 based on Foata normal form. 44/1601 useless extension candidates. Maximal degree in co-relation 4387. Up to 586 conditions per place. [2024-10-31 22:10:25,262 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 49 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2024-10-31 22:10:25,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 385 flow [2024-10-31 22:10:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-10-31 22:10:25,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2024-10-31 22:10:25,264 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 196 flow. Second operand 6 states and 146 transitions. [2024-10-31 22:10:25,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 385 flow [2024-10-31 22:10:25,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 354 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-10-31 22:10:25,270 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 210 flow [2024-10-31 22:10:25,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-10-31 22:10:25,271 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2024-10-31 22:10:25,271 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 210 flow [2024-10-31 22:10:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:25,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:25,272 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:25,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:10:25,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:25,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1806349745, now seen corresponding path program 1 times [2024-10-31 22:10:25,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:25,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121786564] [2024-10-31 22:10:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:27,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:27,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121786564] [2024-10-31 22:10:27,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121786564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:27,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:27,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:10:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330003485] [2024-10-31 22:10:27,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:27,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:10:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:10:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:10:27,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-10-31 22:10:27,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 210 flow. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:27,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:27,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-10-31 22:10:27,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:27,951 INFO L124 PetriNetUnfolderBase]: 939/1857 cut-off events. [2024-10-31 22:10:27,951 INFO L125 PetriNetUnfolderBase]: For 2670/2963 co-relation queries the response was YES. [2024-10-31 22:10:27,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4928 conditions, 1857 events. 939/1857 cut-off events. For 2670/2963 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 12242 event pairs, 278 based on Foata normal form. 32/1701 useless extension candidates. Maximal degree in co-relation 4912. Up to 451 conditions per place. [2024-10-31 22:10:27,965 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 42 selfloop transitions, 5 changer transitions 21/91 dead transitions. [2024-10-31 22:10:27,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 474 flow [2024-10-31 22:10:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:10:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:10:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-10-31 22:10:27,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5726744186046512 [2024-10-31 22:10:27,968 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 210 flow. Second operand 8 states and 197 transitions. [2024-10-31 22:10:27,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 474 flow [2024-10-31 22:10:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 450 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-10-31 22:10:27,981 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 221 flow [2024-10-31 22:10:27,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2024-10-31 22:10:27,982 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2024-10-31 22:10:27,982 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 221 flow [2024-10-31 22:10:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:27,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:27,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:27,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:10:27,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 913424007, now seen corresponding path program 2 times [2024-10-31 22:10:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141480919] [2024-10-31 22:10:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:10:28,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:10:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:10:28,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:10:28,255 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:10:28,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-31 22:10:28,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-31 22:10:28,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-31 22:10:28,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-31 22:10:28,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-31 22:10:28,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-31 22:10:28,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-31 22:10:28,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:10:28,266 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:28,364 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:10:28,364 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:10:28,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:10:28 BasicIcfg [2024-10-31 22:10:28,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:10:28,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:10:28,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:10:28,374 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:10:28,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:17" (3/4) ... [2024-10-31 22:10:28,376 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:10:28,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:10:28,379 INFO L158 Benchmark]: Toolchain (without parser) took 13263.83ms. Allocated memory was 130.0MB in the beginning and 398.5MB in the end (delta: 268.4MB). Free memory was 93.2MB in the beginning and 273.3MB in the end (delta: -180.1MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2024-10-31 22:10:28,380 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 130.0MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:10:28,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 814.50ms. Allocated memory is still 130.0MB. Free memory was 92.8MB in the beginning and 67.2MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-31 22:10:28,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.22ms. Allocated memory is still 130.0MB. Free memory was 67.2MB in the beginning and 64.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:10:28,381 INFO L158 Benchmark]: Boogie Preprocessor took 56.84ms. Allocated memory is still 130.0MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:10:28,381 INFO L158 Benchmark]: RCFGBuilder took 956.56ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 61.0MB in the beginning and 101.5MB in the end (delta: -40.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-10-31 22:10:28,382 INFO L158 Benchmark]: TraceAbstraction took 11333.40ms. Allocated memory was 167.8MB in the beginning and 398.5MB in the end (delta: 230.7MB). Free memory was 100.4MB in the beginning and 273.3MB in the end (delta: -173.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2024-10-31 22:10:28,382 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 398.5MB. Free memory is still 273.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:10:28,384 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.40ms. Allocated memory is still 130.0MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 814.50ms. Allocated memory is still 130.0MB. Free memory was 92.8MB in the beginning and 67.2MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.22ms. Allocated memory is still 130.0MB. Free memory was 67.2MB in the beginning and 64.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.84ms. Allocated memory is still 130.0MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 956.56ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 61.0MB in the beginning and 101.5MB in the end (delta: -40.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11333.40ms. Allocated memory was 167.8MB in the beginning and 398.5MB in the end (delta: 230.7MB). Free memory was 100.4MB in the beginning and 273.3MB in the end (delta: -173.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 398.5MB. Free memory is still 273.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-1, t2394=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 833]: 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: 831]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 997 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 30 mSDtfsCounter, 997 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=9, InterpolantAutomatonStates: 50, 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.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 [2024-10-31 22:10:28,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU --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 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:10:31,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:10:31,489 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-31 22:10:31,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:10:31,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:10:31,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:10:31,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:10:31,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:10:31,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:10:31,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:10:31,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:10:31,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:10:31,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:10:31,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:10:31,545 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:10:31,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:10:31,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:10:31,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:10:31,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:10:31,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:10:31,547 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:10:31,550 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:10:31,550 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:10:31,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:10:31,551 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:10:31,551 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:10:31,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:10:31,552 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:10:31,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:10:31,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:10:31,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:10:31,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:10:31,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:10:31,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:10:31,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:10:31,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:31,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:10:31,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:10:31,557 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:10:31,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:10:31,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:10:31,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:10:31,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:10:31,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:10:31,568 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:10:31,569 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_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/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_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac [2024-10-31 22:10:31,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:10:32,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:10:32,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:10:32,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:10:32,026 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:10:32,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i Unable to find full path for "g++" [2024-10-31 22:10:34,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:10:34,393 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:10:34,396 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-31 22:10:34,418 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data/5e674ed1a/9f8125fc83d64278b7a93089168197a4/FLAG114480e46 [2024-10-31 22:10:34,600 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/data/5e674ed1a/9f8125fc83d64278b7a93089168197a4 [2024-10-31 22:10:34,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:10:34,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:10:34,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:34,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:10:34,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:10:34,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:34" (1/1) ... [2024-10-31 22:10:34,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec49e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:34, skipping insertion in model container [2024-10-31 22:10:34,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:34" (1/1) ... [2024-10-31 22:10:34,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:10:35,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:35,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:10:35,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:35,396 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:10:35,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35 WrapperNode [2024-10-31 22:10:35,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:35,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:35,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:10:35,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:10:35,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,474 INFO L138 Inliner]: procedures = 176, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2024-10-31 22:10:35,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:35,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:10:35,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:10:35,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:10:35,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:10:35,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:10:35,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:10:35,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:10:35,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:10:35,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (1/1) ... [2024-10-31 22:10:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:35,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:35,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:10:35,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:10:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:10:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:10:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:10:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:10:35,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:10:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:10:35,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:10:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:10:35,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:10:35,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:10:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:10:35,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:10:35,675 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:10:35,879 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:10:35,881 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:10:36,292 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:10:36,292 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:10:36,659 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:10:36,660 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:10:36,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:36 BoogieIcfgContainer [2024-10-31 22:10:36,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:10:36,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:10:36,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:10:36,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:10:36,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:10:34" (1/3) ... [2024-10-31 22:10:36,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e99bc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:36, skipping insertion in model container [2024-10-31 22:10:36,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:35" (2/3) ... [2024-10-31 22:10:36,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e99bc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:36, skipping insertion in model container [2024-10-31 22:10:36,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:36" (3/3) ... [2024-10-31 22:10:36,675 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-31 22:10:36,696 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:10:36,696 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:10:36,697 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:10:36,788 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:10:36,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2024-10-31 22:10:36,860 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-10-31 22:10:36,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:10:36,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-10-31 22:10:36,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2024-10-31 22:10:36,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2024-10-31 22:10:36,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:10:36,885 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@43fbd47e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:10:36,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 22:10:36,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:10:36,891 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-31 22:10:36,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:10:36,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:36,892 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:10:36,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:36,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 11937499, now seen corresponding path program 1 times [2024-10-31 22:10:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:10:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880691071] [2024-10-31 22:10:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:36,916 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 [2024-10-31 22:10:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:10:36,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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) [2024-10-31 22:10:36,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:37,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 22:10:37,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:37,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:10:37,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:10:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880691071] [2024-10-31 22:10:37,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880691071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:10:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145575374] [2024-10-31 22:10:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:37,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:10:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:37,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:37,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-10-31 22:10:37,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:37,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:37,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-10-31 22:10:37,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:37,742 INFO L124 PetriNetUnfolderBase]: 825/1526 cut-off events. [2024-10-31 22:10:37,743 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-31 22:10:37,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1526 events. 825/1526 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9667 event pairs, 129 based on Foata normal form. 96/1611 useless extension candidates. Maximal degree in co-relation 2796. Up to 1009 conditions per place. [2024-10-31 22:10:37,764 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-10-31 22:10:37,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2024-10-31 22:10:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-31 22:10:37,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-10-31 22:10:37,783 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2024-10-31 22:10:37,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2024-10-31 22:10:37,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:10:37,794 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-10-31 22:10:37,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=45, PETRI_TRANSITIONS=35} [2024-10-31 22:10:37,804 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2024-10-31 22:10:37,804 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-10-31 22:10:37,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:37,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:37,806 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:37,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:10:38,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:10:38,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:38,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 238572011, now seen corresponding path program 1 times [2024-10-31 22:10:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:10:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752889382] [2024-10-31 22:10:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:38,010 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 [2024-10-31 22:10:38,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:10:38,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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) [2024-10-31 22:10:38,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:38,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:10:38,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:38,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:10:38,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:10:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752889382] [2024-10-31 22:10:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752889382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:38,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:38,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:10:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80306894] [2024-10-31 22:10:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:38,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:38,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:10:38,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:38,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:38,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-10-31 22:10:38,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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) [2024-10-31 22:10:38,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:38,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-10-31 22:10:38,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:39,048 INFO L124 PetriNetUnfolderBase]: 1680/2953 cut-off events. [2024-10-31 22:10:39,049 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-10-31 22:10:39,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 2953 events. 1680/2953 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18867 event pairs, 188 based on Foata normal form. 100/3028 useless extension candidates. Maximal degree in co-relation 5676. Up to 1579 conditions per place. [2024-10-31 22:10:39,070 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 43 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-10-31 22:10:39,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 236 flow [2024-10-31 22:10:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-10-31 22:10:39,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.622093023255814 [2024-10-31 22:10:39,074 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 107 transitions. [2024-10-31 22:10:39,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 236 flow [2024-10-31 22:10:39,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:10:39,077 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow [2024-10-31 22:10:39,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-10-31 22:10:39,081 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-10-31 22:10:39,081 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow [2024-10-31 22:10:39,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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) [2024-10-31 22:10:39,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:39,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:39,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:10:39,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -525068277, now seen corresponding path program 1 times [2024-10-31 22:10:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:10:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073091847] [2024-10-31 22:10:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:39,286 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 [2024-10-31 22:10:39,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:10:39,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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) [2024-10-31 22:10:39,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:39,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:10:39,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:39,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:10:39,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:10:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073091847] [2024-10-31 22:10:39,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073091847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:39,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:39,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20847893] [2024-10-31 22:10:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:39,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:10:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:39,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-10-31 22:10:39,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:39,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:39,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-10-31 22:10:39,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:40,004 INFO L124 PetriNetUnfolderBase]: 1038/1831 cut-off events. [2024-10-31 22:10:40,005 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-10-31 22:10:40,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4064 conditions, 1831 events. 1038/1831 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 10162 event pairs, 100 based on Foata normal form. 82/1895 useless extension candidates. Maximal degree in co-relation 4052. Up to 697 conditions per place. [2024-10-31 22:10:40,019 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 54 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-10-31 22:10:40,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 329 flow [2024-10-31 22:10:40,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:10:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:10:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-10-31 22:10:40,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-10-31 22:10:40,022 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 135 transitions. [2024-10-31 22:10:40,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 329 flow [2024-10-31 22:10:40,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 319 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:10:40,027 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow [2024-10-31 22:10:40,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-10-31 22:10:40,028 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2024-10-31 22:10:40,028 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow [2024-10-31 22:10:40,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:40,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:40,029 INFO L204 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] [2024-10-31 22:10:40,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:40,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:10:40,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:40,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1188985298, now seen corresponding path program 1 times [2024-10-31 22:10:40,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:10:40,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172627032] [2024-10-31 22:10:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:40,233 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 [2024-10-31 22:10:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:10:40,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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) [2024-10-31 22:10:40,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:40,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 22:10:40,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:40,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:10:40,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:10:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172627032] [2024-10-31 22:10:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172627032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289911455] [2024-10-31 22:10:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:40,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:10:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:10:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:10:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:40,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-10-31 22:10:40,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:40,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:40,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-10-31 22:10:40,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:40,962 INFO L124 PetriNetUnfolderBase]: 581/980 cut-off events. [2024-10-31 22:10:40,963 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-10-31 22:10:40,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 980 events. 581/980 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4402 event pairs, 83 based on Foata normal form. 40/1002 useless extension candidates. Maximal degree in co-relation 2500. Up to 308 conditions per place. [2024-10-31 22:10:40,970 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 47 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-10-31 22:10:40,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 336 flow [2024-10-31 22:10:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-10-31 22:10:40,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.562015503875969 [2024-10-31 22:10:40,973 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 145 transitions. [2024-10-31 22:10:40,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 336 flow [2024-10-31 22:10:40,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 311 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-31 22:10:40,981 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2024-10-31 22:10:40,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-10-31 22:10:40,982 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-10-31 22:10:40,982 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2024-10-31 22:10:40,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:40,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:40,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:40,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:41,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:10:41,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:10:41,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 771383427, now seen corresponding path program 1 times [2024-10-31 22:10:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:10:41,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77159265] [2024-10-31 22:10:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:41,186 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 [2024-10-31 22:10:41,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:10:41,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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) [2024-10-31 22:10:41,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -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 [2024-10-31 22:10:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:41,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 22:10:41,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:41,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:10:41,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:10:41,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77159265] [2024-10-31 22:10:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77159265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:41,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:41,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:10:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580972880] [2024-10-31 22:10:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:41,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:10:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:41,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-10-31 22:10:41,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 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) [2024-10-31 22:10:41,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:41,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-10-31 22:10:41,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:41,544 INFO L124 PetriNetUnfolderBase]: 307/618 cut-off events. [2024-10-31 22:10:41,545 INFO L125 PetriNetUnfolderBase]: For 249/259 co-relation queries the response was YES. [2024-10-31 22:10:41,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 618 events. 307/618 cut-off events. For 249/259 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2994 event pairs, 288 based on Foata normal form. 8/590 useless extension candidates. Maximal degree in co-relation 1380. Up to 481 conditions per place. [2024-10-31 22:10:41,550 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/40 dead transitions. [2024-10-31 22:10:41,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 202 flow [2024-10-31 22:10:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-10-31 22:10:41,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-10-31 22:10:41,553 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 3 states and 72 transitions. [2024-10-31 22:10:41,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 202 flow [2024-10-31 22:10:41,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 146 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-31 22:10:41,557 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 106 flow [2024-10-31 22:10:41,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-10-31 22:10:41,558 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-10-31 22:10:41,558 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 106 flow [2024-10-31 22:10:41,558 INFO L472 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) [2024-10-31 22:10:41,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:41,559 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:41,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5f4668a-3b28-42c6-8353-3bcda0785fca/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0