./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/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_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/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_651485cf-d4c6-4497-b59c-980fca15ee47/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 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:43,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:43,702 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:06:43,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:43,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:43,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:43,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:43,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:43,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:06:43,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:06:43,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:43,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:43,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:43,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:43,762 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:43,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:43,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:06:43,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:06:43,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:06:43,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:43,765 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:06:43,770 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:06:43,770 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:06:43,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:43,771 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:06:43,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:43,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:06:43,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:06:43,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:43,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:43,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:43,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:06:43,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:43,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:43,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:43,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:43,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:06:43,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:06:43,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:43,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:43,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:43,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:43,778 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_651485cf-d4c6-4497-b59c-980fca15ee47/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_651485cf-d4c6-4497-b59c-980fca15ee47/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 -> 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad [2024-10-31 22:06:44,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:44,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:44,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:44,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:44,177 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:44,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i Unable to find full path for "g++" [2024-10-31 22:06:46,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:06:46,941 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:06:46,941 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-10-31 22:06:46,961 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/data/567688e3d/06743f54acbb48618613bc44788325e6/FLAGaaf4e89a6 [2024-10-31 22:06:47,194 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/data/567688e3d/06743f54acbb48618613bc44788325e6 [2024-10-31 22:06:47,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:06:47,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:06:47,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:47,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:06:47,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:06:47,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d33cb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47, skipping insertion in model container [2024-10-31 22:06:47,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:06:47,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:47,904 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:06:48,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:48,054 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:06:48,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48 WrapperNode [2024-10-31 22:06:48,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:48,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:48,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:06:48,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:06:48,065 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:06:48" (1/1) ... [2024-10-31 22:06:48,087 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:06:48" (1/1) ... [2024-10-31 22:06:48,140 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-10-31 22:06:48,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:48,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:06:48,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:06:48,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:06:48,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,201 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:06:48,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:06:48,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:06:48,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:06:48,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:06:48,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (1/1) ... [2024-10-31 22:06:48,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:06:48,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/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:06:48,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/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:06:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:06:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:06:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:06:48,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:06:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:06:48,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:06:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:06:48,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:06:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:06:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:06:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:06:48,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:06:48,331 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:06:48,483 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:06:48,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:06:48,974 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:06:48,974 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:06:49,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:06:49,210 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:06:49,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:49 BoogieIcfgContainer [2024-10-31 22:06:49,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:06:49,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:06:49,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:06:49,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:06:49,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:06:47" (1/3) ... [2024-10-31 22:06:49,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1593a43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:49, skipping insertion in model container [2024-10-31 22:06:49,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:48" (2/3) ... [2024-10-31 22:06:49,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1593a43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:49, skipping insertion in model container [2024-10-31 22:06:49,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:49" (3/3) ... [2024-10-31 22:06:49,221 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2024-10-31 22:06:49,245 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:06:49,245 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:06:49,246 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:06:49,354 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:06:49,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-10-31 22:06:49,475 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-10-31 22:06:49,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:06:49,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-10-31 22:06:49,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-10-31 22:06:49,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-10-31 22:06:49,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:06:49,517 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;@dddcfd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:06:49,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 22:06:49,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:06:49,532 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-31 22:06:49,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:06:49,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:49,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:49,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:06:49,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1143059156, now seen corresponding path program 1 times [2024-10-31 22:06:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:49,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275097861] [2024-10-31 22:06:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,214 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:06:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275097861] [2024-10-31 22:06:50,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275097861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:06:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646978482] [2024-10-31 22:06:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:50,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:50,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:50,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-10-31 22:06:50,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:50,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:50,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-10-31 22:06:50,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:50,669 INFO L124 PetriNetUnfolderBase]: 407/744 cut-off events. [2024-10-31 22:06:50,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:06:50,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 744 events. 407/744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4371 event pairs, 128 based on Foata normal form. 48/778 useless extension candidates. Maximal degree in co-relation 1396. Up to 496 conditions per place. [2024-10-31 22:06:50,682 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 27 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-10-31 22:06:50,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 169 flow [2024-10-31 22:06:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-31 22:06:50,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-10-31 22:06:50,702 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 99 transitions. [2024-10-31 22:06:50,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 169 flow [2024-10-31 22:06:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:06:50,711 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-10-31 22:06:50,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-10-31 22:06:50,720 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-10-31 22:06:50,721 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-10-31 22:06:50,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:50,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:50,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:50,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:06:50,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:06:50,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1459971501, now seen corresponding path program 1 times [2024-10-31 22:06:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:50,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82477229] [2024-10-31 22:06:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:50,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,870 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:06:50,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:50,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82477229] [2024-10-31 22:06:50,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82477229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:50,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:50,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:06:50,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493182763] [2024-10-31 22:06:50,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:50,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:50,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:50,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:50,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:50,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-10-31 22:06:50,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:50,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:50,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-10-31 22:06:50,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:51,131 INFO L124 PetriNetUnfolderBase]: 361/698 cut-off events. [2024-10-31 22:06:51,132 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-31 22:06:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 698 events. 361/698 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4849 event pairs, 361 based on Foata normal form. 24/695 useless extension candidates. Maximal degree in co-relation 1328. Up to 570 conditions per place. [2024-10-31 22:06:51,142 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-10-31 22:06:51,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-10-31 22:06:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-10-31 22:06:51,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-31 22:06:51,144 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-10-31 22:06:51,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-10-31 22:06:51,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:51,150 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-10-31 22:06:51,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-10-31 22:06:51,151 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-10-31 22:06:51,151 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-10-31 22:06:51,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:51,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:51,152 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:51,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:06:51,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:06:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1459972987, now seen corresponding path program 1 times [2024-10-31 22:06:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317652287] [2024-10-31 22:06:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:51,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,368 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:06:52,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:52,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317652287] [2024-10-31 22:06:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317652287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29137637] [2024-10-31 22:06:52,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:52,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:06:52,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:06:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:06:52,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-31 22:06:52,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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:06:52,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:52,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-31 22:06:52,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:53,479 INFO L124 PetriNetUnfolderBase]: 1575/2655 cut-off events. [2024-10-31 22:06:53,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:06:53,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 2655 events. 1575/2655 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 17252 event pairs, 463 based on Foata normal form. 0/2584 useless extension candidates. Maximal degree in co-relation 5045. Up to 1298 conditions per place. [2024-10-31 22:06:53,493 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 35 selfloop transitions, 9 changer transitions 64/121 dead transitions. [2024-10-31 22:06:53,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 121 transitions, 470 flow [2024-10-31 22:06:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:06:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-31 22:06:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 315 transitions. [2024-10-31 22:06:53,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-31 22:06:53,497 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 12 states and 315 transitions. [2024-10-31 22:06:53,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 121 transitions, 470 flow [2024-10-31 22:06:53,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:06:53,500 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 161 flow [2024-10-31 22:06:53,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=161, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2024-10-31 22:06:53,501 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-10-31 22:06:53,502 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 161 flow [2024-10-31 22:06:53,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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:06:53,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:53,502 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:06:53,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:06:53,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:06:53,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:53,504 INFO L85 PathProgramCache]: Analyzing trace with hash -844283526, now seen corresponding path program 1 times [2024-10-31 22:06:53,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:53,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494996893] [2024-10-31 22:06:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:53,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,133 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:06:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494996893] [2024-10-31 22:06:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494996893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:54,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:54,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:54,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983992730] [2024-10-31 22:06:54,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:54,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:54,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:54,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-10-31 22:06:54,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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:06:54,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:54,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-10-31 22:06:54,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:54,777 INFO L124 PetriNetUnfolderBase]: 1203/2248 cut-off events. [2024-10-31 22:06:54,778 INFO L125 PetriNetUnfolderBase]: For 4094/4248 co-relation queries the response was YES. [2024-10-31 22:06:54,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6914 conditions, 2248 events. 1203/2248 cut-off events. For 4094/4248 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15624 event pairs, 456 based on Foata normal form. 96/2234 useless extension candidates. Maximal degree in co-relation 6898. Up to 1316 conditions per place. [2024-10-31 22:06:54,803 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 27 selfloop transitions, 3 changer transitions 27/76 dead transitions. [2024-10-31 22:06:54,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 409 flow [2024-10-31 22:06:54,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:06:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:06:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-10-31 22:06:54,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-10-31 22:06:54,805 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 161 flow. Second operand 7 states and 185 transitions. [2024-10-31 22:06:54,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 409 flow [2024-10-31 22:06:54,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 379 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-10-31 22:06:54,840 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 182 flow [2024-10-31 22:06:54,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2024-10-31 22:06:54,842 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-10-31 22:06:54,844 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 182 flow [2024-10-31 22:06:54,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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:06:54,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:54,844 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:54,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:06:54,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:06:54,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash 695422254, now seen corresponding path program 1 times [2024-10-31 22:06:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159165800] [2024-10-31 22:06:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,591 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:06:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159165800] [2024-10-31 22:06:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159165800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:55,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:06:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538031491] [2024-10-31 22:06:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:55,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:06:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:06:55,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:06:55,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-31 22:06:55,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:55,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:55,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-31 22:06:55,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:56,628 INFO L124 PetriNetUnfolderBase]: 1847/3285 cut-off events. [2024-10-31 22:06:56,628 INFO L125 PetriNetUnfolderBase]: For 5384/5388 co-relation queries the response was YES. [2024-10-31 22:06:56,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10660 conditions, 3285 events. 1847/3285 cut-off events. For 5384/5388 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22995 event pairs, 519 based on Foata normal form. 85/3344 useless extension candidates. Maximal degree in co-relation 10642. Up to 1267 conditions per place. [2024-10-31 22:06:56,658 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 41 selfloop transitions, 10 changer transitions 29/94 dead transitions. [2024-10-31 22:06:56,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 594 flow [2024-10-31 22:06:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:06:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:06:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-10-31 22:06:56,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-31 22:06:56,661 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 182 flow. Second operand 8 states and 210 transitions. [2024-10-31 22:06:56,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 594 flow [2024-10-31 22:06:56,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 578 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-10-31 22:06:56,683 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 254 flow [2024-10-31 22:06:56,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=254, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2024-10-31 22:06:56,685 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2024-10-31 22:06:56,685 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 254 flow [2024-10-31 22:06:56,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:56,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:56,688 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:06:56,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:06:56,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:06:56,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1761659638, now seen corresponding path program 1 times [2024-10-31 22:06:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:56,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923841327] [2024-10-31 22:06:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:56,940 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:06:56,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:56,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923841327] [2024-10-31 22:06:56,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923841327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:56,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:56,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:06:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187840359] [2024-10-31 22:06:56,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:56,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:06:56,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:56,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:06:56,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:56,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-31 22:06:56,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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:06:56,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:56,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-31 22:06:56,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:58,030 INFO L124 PetriNetUnfolderBase]: 2956/4956 cut-off events. [2024-10-31 22:06:58,031 INFO L125 PetriNetUnfolderBase]: For 8767/9102 co-relation queries the response was YES. [2024-10-31 22:06:58,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15105 conditions, 4956 events. 2956/4956 cut-off events. For 8767/9102 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 32550 event pairs, 576 based on Foata normal form. 306/5093 useless extension candidates. Maximal degree in co-relation 15082. Up to 2751 conditions per place. [2024-10-31 22:06:58,077 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2024-10-31 22:06:58,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 481 flow [2024-10-31 22:06:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:06:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:06:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-10-31 22:06:58,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6277777777777778 [2024-10-31 22:06:58,080 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 254 flow. Second operand 4 states and 113 transitions. [2024-10-31 22:06:58,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 481 flow [2024-10-31 22:06:58,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 454 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-31 22:06:58,106 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 258 flow [2024-10-31 22:06:58,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-10-31 22:06:58,107 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2024-10-31 22:06:58,107 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 258 flow [2024-10-31 22:06:58,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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:06:58,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:58,108 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] [2024-10-31 22:06:58,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:06:58,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:06:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash -981758284, now seen corresponding path program 1 times [2024-10-31 22:06:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614546665] [2024-10-31 22:06:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:59,125 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:06:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:59,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614546665] [2024-10-31 22:06:59,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614546665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:59,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:59,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:06:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473166835] [2024-10-31 22:06:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:59,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:06:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:06:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:06:59,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-10-31 22:06:59,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 258 flow. Second operand has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 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:06:59,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:59,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-10-31 22:06:59,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:00,466 INFO L124 PetriNetUnfolderBase]: 1921/3681 cut-off events. [2024-10-31 22:07:00,466 INFO L125 PetriNetUnfolderBase]: For 5845/6019 co-relation queries the response was YES. [2024-10-31 22:07:00,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11667 conditions, 3681 events. 1921/3681 cut-off events. For 5845/6019 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27495 event pairs, 643 based on Foata normal form. 96/3574 useless extension candidates. Maximal degree in co-relation 11645. Up to 2227 conditions per place. [2024-10-31 22:07:00,511 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 41 selfloop transitions, 14 changer transitions 16/95 dead transitions. [2024-10-31 22:07:00,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 638 flow [2024-10-31 22:07:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:07:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-31 22:07:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2024-10-31 22:07:00,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5622222222222222 [2024-10-31 22:07:00,514 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 258 flow. Second operand 10 states and 253 transitions. [2024-10-31 22:07:00,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 638 flow [2024-10-31 22:07:00,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 95 transitions, 624 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-31 22:07:00,525 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 373 flow [2024-10-31 22:07:00,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=373, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2024-10-31 22:07:00,526 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2024-10-31 22:07:00,527 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 373 flow [2024-10-31 22:07:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 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:07:00,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:00,529 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] [2024-10-31 22:07:00,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:07:00,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:07:00,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1960423094, now seen corresponding path program 1 times [2024-10-31 22:07:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542429901] [2024-10-31 22:07:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:00,862 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:07:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542429901] [2024-10-31 22:07:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542429901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:07:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146979316] [2024-10-31 22:07:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:00,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:07:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:07:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:07:00,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-31 22:07:00,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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:07:00,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:00,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-31 22:07:00,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:01,633 INFO L124 PetriNetUnfolderBase]: 2018/3486 cut-off events. [2024-10-31 22:07:01,633 INFO L125 PetriNetUnfolderBase]: For 10603/10933 co-relation queries the response was YES. [2024-10-31 22:07:01,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12132 conditions, 3486 events. 2018/3486 cut-off events. For 10603/10933 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 21487 event pairs, 267 based on Foata normal form. 294/3662 useless extension candidates. Maximal degree in co-relation 12103. Up to 1181 conditions per place. [2024-10-31 22:07:01,667 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 61 selfloop transitions, 8 changer transitions 8/95 dead transitions. [2024-10-31 22:07:01,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 748 flow [2024-10-31 22:07:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:07:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:07:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-10-31 22:07:01,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2024-10-31 22:07:01,669 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 373 flow. Second operand 5 states and 143 transitions. [2024-10-31 22:07:01,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 748 flow [2024-10-31 22:07:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 95 transitions, 682 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-10-31 22:07:01,688 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 349 flow [2024-10-31 22:07:01,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=349, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2024-10-31 22:07:01,689 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2024-10-31 22:07:01,690 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 349 flow [2024-10-31 22:07:01,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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:07:01,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:01,690 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] [2024-10-31 22:07:01,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:07:01,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:07:01,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2028913496, now seen corresponding path program 1 times [2024-10-31 22:07:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:01,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892860953] [2024-10-31 22:07:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:01,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:01,967 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:07:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892860953] [2024-10-31 22:07:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892860953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:01,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:01,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320947075] [2024-10-31 22:07:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:01,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:01,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-31 22:07:01,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:01,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:01,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-31 22:07:01,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:02,765 INFO L124 PetriNetUnfolderBase]: 1515/2575 cut-off events. [2024-10-31 22:07:02,766 INFO L125 PetriNetUnfolderBase]: For 8286/8812 co-relation queries the response was YES. [2024-10-31 22:07:02,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9742 conditions, 2575 events. 1515/2575 cut-off events. For 8286/8812 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15433 event pairs, 244 based on Foata normal form. 199/2647 useless extension candidates. Maximal degree in co-relation 9712. Up to 948 conditions per place. [2024-10-31 22:07:02,794 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 11 changer transitions 16/87 dead transitions. [2024-10-31 22:07:02,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 639 flow [2024-10-31 22:07:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-10-31 22:07:02,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-10-31 22:07:02,796 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 349 flow. Second operand 6 states and 159 transitions. [2024-10-31 22:07:02,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 639 flow [2024-10-31 22:07:02,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 575 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-10-31 22:07:02,808 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 294 flow [2024-10-31 22:07:02,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2024-10-31 22:07:02,809 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2024-10-31 22:07:02,809 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 294 flow [2024-10-31 22:07:02,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:02,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:02,810 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, 1, 1] [2024-10-31 22:07:02,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:07:02,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:07:02,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1771740986, now seen corresponding path program 1 times [2024-10-31 22:07:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820771230] [2024-10-31 22:07:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:03,208 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:07:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:03,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820771230] [2024-10-31 22:07:03,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820771230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:03,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:03,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:07:03,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160261981] [2024-10-31 22:07:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:03,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:03,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:03,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:03,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-10-31 22:07:03,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:03,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:03,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-10-31 22:07:03,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:03,673 INFO L124 PetriNetUnfolderBase]: 725/1605 cut-off events. [2024-10-31 22:07:03,674 INFO L125 PetriNetUnfolderBase]: For 4052/4331 co-relation queries the response was YES. [2024-10-31 22:07:03,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 1605 events. 725/1605 cut-off events. For 4052/4331 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11177 event pairs, 155 based on Foata normal form. 31/1467 useless extension candidates. Maximal degree in co-relation 5010. Up to 535 conditions per place. [2024-10-31 22:07:03,687 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 28 selfloop transitions, 1 changer transitions 24/79 dead transitions. [2024-10-31 22:07:03,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 79 transitions, 515 flow [2024-10-31 22:07:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-10-31 22:07:03,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-10-31 22:07:03,689 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 294 flow. Second operand 6 states and 156 transitions. [2024-10-31 22:07:03,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 79 transitions, 515 flow [2024-10-31 22:07:03,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 444 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-10-31 22:07:03,709 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 234 flow [2024-10-31 22:07:03,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2024-10-31 22:07:03,710 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2024-10-31 22:07:03,711 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 234 flow [2024-10-31 22:07:03,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:03,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:03,711 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, 1, 1] [2024-10-31 22:07:03,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:07:03,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:07:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 576370338, now seen corresponding path program 2 times [2024-10-31 22:07:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:03,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360442800] [2024-10-31 22:07:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,708 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:07:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:05,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360442800] [2024-10-31 22:07:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360442800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:05,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:05,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:07:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903777562] [2024-10-31 22:07:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:05,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:07:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:05,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:07:05,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:07:05,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-10-31 22:07:05,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 47 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 0 states have call successors, (0), 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:07:05,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:05,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-10-31 22:07:05,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:06,323 INFO L124 PetriNetUnfolderBase]: 547/1212 cut-off events. [2024-10-31 22:07:06,323 INFO L125 PetriNetUnfolderBase]: For 1368/1476 co-relation queries the response was YES. [2024-10-31 22:07:06,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3374 conditions, 1212 events. 547/1212 cut-off events. For 1368/1476 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8110 event pairs, 202 based on Foata normal form. 22/1097 useless extension candidates. Maximal degree in co-relation 3350. Up to 398 conditions per place. [2024-10-31 22:07:06,331 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 20 selfloop transitions, 3 changer transitions 24/72 dead transitions. [2024-10-31 22:07:06,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 404 flow [2024-10-31 22:07:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:07:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:07:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-10-31 22:07:06,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5472222222222223 [2024-10-31 22:07:06,333 INFO L175 Difference]: Start difference. First operand has 73 places, 47 transitions, 234 flow. Second operand 8 states and 197 transitions. [2024-10-31 22:07:06,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 404 flow [2024-10-31 22:07:06,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 390 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-31 22:07:06,343 INFO L231 Difference]: Finished difference. Result has 77 places, 44 transitions, 228 flow [2024-10-31 22:07:06,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2024-10-31 22:07:06,344 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2024-10-31 22:07:06,344 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 44 transitions, 228 flow [2024-10-31 22:07:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 0 states have call successors, (0), 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:07:06,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:06,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:07:06,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-31 22:07:06,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -148768062, now seen corresponding path program 3 times [2024-10-31 22:07:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:06,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309732958] [2024-10-31 22:07:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:06,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:07:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:06,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:07:06,518 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:07:06,519 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-31 22:07:06,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-31 22:07:06,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-31 22:07:06,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-31 22:07:06,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-31 22:07:06,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-31 22:07:06,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-31 22:07:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:07:06,523 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:06,614 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:07:06,614 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:07:06,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:07:06 BasicIcfg [2024-10-31 22:07:06,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:07:06,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:07:06,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:07:06,620 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:07:06,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:49" (3/4) ... [2024-10-31 22:07:06,623 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:07:06,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:07:06,626 INFO L158 Benchmark]: Toolchain (without parser) took 19426.21ms. Allocated memory was 151.0MB in the beginning and 677.4MB in the end (delta: 526.4MB). Free memory was 115.4MB in the beginning and 579.3MB in the end (delta: -463.9MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-10-31 22:07:06,626 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:07:06,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 854.72ms. Allocated memory is still 151.0MB. Free memory was 115.4MB in the beginning and 104.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-31 22:07:06,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.39ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 101.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:07:06,630 INFO L158 Benchmark]: Boogie Preprocessor took 95.20ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 98.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:07:06,630 INFO L158 Benchmark]: RCFGBuilder took 970.45ms. Allocated memory is still 151.0MB. Free memory was 97.7MB in the beginning and 48.7MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-31 22:07:06,631 INFO L158 Benchmark]: TraceAbstraction took 17406.13ms. Allocated memory was 151.0MB in the beginning and 677.4MB in the end (delta: 526.4MB). Free memory was 48.0MB in the beginning and 580.3MB in the end (delta: -532.3MB). Peak memory consumption was 366.8MB. Max. memory is 16.1GB. [2024-10-31 22:07:06,631 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 677.4MB. Free memory was 580.3MB in the beginning and 579.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:07:06,633 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.31ms. Allocated memory is still 113.2MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 854.72ms. Allocated memory is still 151.0MB. Free memory was 115.4MB in the beginning and 104.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.39ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 101.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.20ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 98.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 970.45ms. Allocated memory is still 151.0MB. Free memory was 97.7MB in the beginning and 48.7MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17406.13ms. Allocated memory was 151.0MB in the beginning and 677.4MB in the end (delta: 526.4MB). Free memory was 48.0MB in the beginning and 580.3MB in the end (delta: -532.3MB). Peak memory consumption was 366.8MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 677.4MB. Free memory was 580.3MB in the beginning and 579.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, 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, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-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, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=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, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 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) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 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 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 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_p0_EAX=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 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) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 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 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 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) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 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_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [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_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L17] 0 __assert_fail ("0", "safe031_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 820]: 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, 70 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: 17.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 42 mSDtfsCounter, 1250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=7, InterpolantAutomatonStates: 72, 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.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:07:06,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/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_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/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_651485cf-d4c6-4497-b59c-980fca15ee47/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 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:09,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:09,543 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-31 22:07:09,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:09,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:09,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:09,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:09,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:09,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:07:09,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:07:09,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:09,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:09,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:09,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:09,615 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:09,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:09,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:09,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:07:09,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:09,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:09,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:07:09,617 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:07:09,618 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:07:09,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:09,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:07:09,618 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:07:09,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:09,619 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:07:09,619 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:07:09,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:09,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:09,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:09,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:09,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:07:09,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:09,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:09,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:09,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:09,625 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:07:09,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:07:09,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:09,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:09,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:09,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:09,627 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:07:09,627 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_651485cf-d4c6-4497-b59c-980fca15ee47/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_651485cf-d4c6-4497-b59c-980fca15ee47/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 -> 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad [2024-10-31 22:07:10,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:07:10,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:07:10,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:07:10,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:07:10,067 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:07:10,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_651485cf-d4c6-4497-b59c-980fca15ee47/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i Unable to find full path for "g++" [2024-10-31 22:07:12,137 INFO L533 CDTParser]: Created temporary CDT project at NULL