./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:22:24,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:22:24,920 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 20:22:24,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:22:24,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:22:24,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:22:24,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:22:24,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:22:24,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:22:24,957 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:22:24,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:22:24,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:22:24,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:22:24,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:22:24,960 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:22:24,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:22:24,961 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:22:24,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:22:24,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:22:24,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:22:24,964 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:22:24,964 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:22:24,965 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:22:24,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:22:24,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:22:24,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:22:24,967 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:22:24,967 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:22:24,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:22:24,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:22:24,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:22:24,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:22:24,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:24,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:22:24,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:22:24,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:22:24,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:22:24,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:22:24,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:22:24,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:22:24,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:22:24,971 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_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2023-11-28 20:22:25,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:22:25,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:22:25,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:22:25,222 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:22:25,222 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:22:25,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-28 20:22:28,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:22:28,246 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:22:28,246 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-28 20:22:28,263 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data/3b2e085a3/d4ea9b6aa738496f8342c035f36c05d9/FLAG980042417 [2023-11-28 20:22:28,275 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data/3b2e085a3/d4ea9b6aa738496f8342c035f36c05d9 [2023-11-28 20:22:28,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:22:28,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:22:28,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:28,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:22:28,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:22:28,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1494c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28, skipping insertion in model container [2023-11-28 20:22:28,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:22:28,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:28,643 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:22:28,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:28,728 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:22:28,728 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:22:28,734 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:22:28,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28 WrapperNode [2023-11-28 20:22:28,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:28,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:28,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:22:28,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:22:28,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,788 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-28 20:22:28,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:28,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:22:28,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:22:28,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:22:28,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,825 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-28 20:22:28,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:22:28,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:22:28,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:22:28,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:22:28,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (1/1) ... [2023-11-28 20:22:28,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:28,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:28,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:22:28,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:22:28,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:22:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:22:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:22:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:22:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:22:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:22:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:22:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:22:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 20:22:28,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 20:22:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 20:22:28,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 20:22:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 20:22:28,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 20:22:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:22:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:22:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:22:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:22:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:22:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:22:28,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:22:28,930 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:22:29,067 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:22:29,069 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:22:29,358 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:22:29,568 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:22:29,568 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:22:29,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:29 BoogieIcfgContainer [2023-11-28 20:22:29,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:22:29,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:22:29,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:22:29,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:22:29,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:28" (1/3) ... [2023-11-28 20:22:29,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3472fe9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:29, skipping insertion in model container [2023-11-28 20:22:29,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:28" (2/3) ... [2023-11-28 20:22:29,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3472fe9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:29, skipping insertion in model container [2023-11-28 20:22:29,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:29" (3/3) ... [2023-11-28 20:22:29,578 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-28 20:22:29,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:22:29,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-28 20:22:29,596 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:22:29,646 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 20:22:29,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 20:22:29,717 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-28 20:22:29,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:22:29,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-28 20:22:29,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 20:22:29,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-28 20:22:29,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:22:29,744 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6faaf056, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:22:29,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-28 20:22:29,747 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:22:29,747 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 20:22:29,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:22:29,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:29,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:22:29,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:29,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash 12211, now seen corresponding path program 1 times [2023-11-28 20:22:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:29,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033705610] [2023-11-28 20:22:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:30,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:30,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033705610] [2023-11-28 20:22:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033705610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:30,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:30,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:22:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000630262] [2023-11-28 20:22:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:30,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:30,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:30,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:30,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:30,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:30,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:30,534 INFO L124 PetriNetUnfolderBase]: 872/1688 cut-off events. [2023-11-28 20:22:30,534 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-28 20:22:30,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1688 events. 872/1688 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11221 event pairs, 680 based on Foata normal form. 90/1586 useless extension candidates. Maximal degree in co-relation 3040. Up to 1037 conditions per place. [2023-11-28 20:22:30,555 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-28 20:22:30,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 179 flow [2023-11-28 20:22:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 20:22:30,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 20:22:30,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 20:22:30,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 20:22:30,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:30,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 20:22:30,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:30,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:30,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:30,581 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 112 transitions. [2023-11-28 20:22:30,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 179 flow [2023-11-28 20:22:30,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:22:30,588 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-28 20:22:30,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-28 20:22:30,593 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 20:22:30,594 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-28 20:22:30,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:30,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:30,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:22:30,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:22:30,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:30,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 12212, now seen corresponding path program 1 times [2023-11-28 20:22:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:30,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283992395] [2023-11-28 20:22:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283992395] [2023-11-28 20:22:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283992395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:22:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147022614] [2023-11-28 20:22:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:30,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:30,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:30,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:22:30,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:30,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:30,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:22:30,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:31,025 INFO L124 PetriNetUnfolderBase]: 872/1687 cut-off events. [2023-11-28 20:22:31,025 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 20:22:31,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1687 events. 872/1687 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11204 event pairs, 680 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 3085. Up to 1036 conditions per place. [2023-11-28 20:22:31,039 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-28 20:22:31,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-28 20:22:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 20:22:31,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 20:22:31,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 20:22:31,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 20:22:31,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:31,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 20:22:31,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,045 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 112 transitions. [2023-11-28 20:22:31,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-28 20:22:31,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:31,050 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-28 20:22:31,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-28 20:22:31,051 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-28 20:22:31,051 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-28 20:22:31,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:31,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:22:31,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:22:31,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:31,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 364148980, now seen corresponding path program 1 times [2023-11-28 20:22:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286898615] [2023-11-28 20:22:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:31,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:31,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286898615] [2023-11-28 20:22:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286898615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693975647] [2023-11-28 20:22:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:31,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:31,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:31,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:31,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:31,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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) [2023-11-28 20:22:31,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:31,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:31,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:31,455 INFO L124 PetriNetUnfolderBase]: 876/1686 cut-off events. [2023-11-28 20:22:31,455 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 20:22:31,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 1686 events. 876/1686 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11387 event pairs, 472 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 3093. Up to 1039 conditions per place. [2023-11-28 20:22:31,469 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-28 20:22:31,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 176 flow [2023-11-28 20:22:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-28 20:22:31,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-28 20:22:31,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-28 20:22:31,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-28 20:22:31,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:31,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-28 20:22:31,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,474 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 110 transitions. [2023-11-28 20:22:31,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 176 flow [2023-11-28 20:22:31,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:31,478 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-28 20:22:31,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-28 20:22:31,479 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-28 20:22:31,479 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-28 20:22:31,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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) [2023-11-28 20:22:31,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:31,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:22:31,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:22:31,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:31,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash 364148981, now seen corresponding path program 1 times [2023-11-28 20:22:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:31,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148542164] [2023-11-28 20:22:31,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:31,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148542164] [2023-11-28 20:22:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148542164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348006794] [2023-11-28 20:22:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:31,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:31,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:31,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:31,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:22:31,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:31,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:22:31,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:31,875 INFO L124 PetriNetUnfolderBase]: 872/1656 cut-off events. [2023-11-28 20:22:31,876 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-28 20:22:31,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3069 conditions, 1656 events. 872/1656 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11229 event pairs, 694 based on Foata normal form. 5/1487 useless extension candidates. Maximal degree in co-relation 3059. Up to 1030 conditions per place. [2023-11-28 20:22:31,889 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-28 20:22:31,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-28 20:22:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 20:22:31,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 20:22:31,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 20:22:31,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 20:22:31,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:31,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 20:22:31,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,894 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 112 transitions. [2023-11-28 20:22:31,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-28 20:22:31,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:31,898 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-28 20:22:31,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-28 20:22:31,899 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-28 20:22:31,899 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-28 20:22:31,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:31,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:22:31,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:22:31,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:31,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 364149572, now seen corresponding path program 1 times [2023-11-28 20:22:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:31,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536591975] [2023-11-28 20:22:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:31,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:31,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536591975] [2023-11-28 20:22:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536591975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:31,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:22:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910795037] [2023-11-28 20:22:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:31,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:31,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:31,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-28 20:22:31,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:31,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:31,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-28 20:22:31,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:32,236 INFO L124 PetriNetUnfolderBase]: 680/1250 cut-off events. [2023-11-28 20:22:32,236 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-28 20:22:32,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2364 conditions, 1250 events. 680/1250 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7308 event pairs, 364 based on Foata normal form. 0/1229 useless extension candidates. Maximal degree in co-relation 2354. Up to 844 conditions per place. [2023-11-28 20:22:32,245 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 33 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-28 20:22:32,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 208 flow [2023-11-28 20:22:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-28 20:22:32,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2023-11-28 20:22:32,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-28 20:22:32,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-28 20:22:32,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:32,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-28 20:22:32,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,250 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 122 transitions. [2023-11-28 20:22:32,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 208 flow [2023-11-28 20:22:32,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:32,253 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-28 20:22:32,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-28 20:22:32,254 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 20:22:32,254 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-28 20:22:32,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:32,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:32,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:22:32,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:32,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -724757703, now seen corresponding path program 1 times [2023-11-28 20:22:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907428136] [2023-11-28 20:22:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:32,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907428136] [2023-11-28 20:22:32,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907428136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:32,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:32,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:32,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920034777] [2023-11-28 20:22:32,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:32,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:32,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:32,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:32,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:32,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:32,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:32,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:32,525 INFO L124 PetriNetUnfolderBase]: 622/1203 cut-off events. [2023-11-28 20:22:32,526 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2023-11-28 20:22:32,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 1203 events. 622/1203 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7561 event pairs, 359 based on Foata normal form. 0/1152 useless extension candidates. Maximal degree in co-relation 2268. Up to 811 conditions per place. [2023-11-28 20:22:32,536 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-28 20:22:32,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 162 flow [2023-11-28 20:22:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2023-11-28 20:22:32,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2023-11-28 20:22:32,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 107 transitions. [2023-11-28 20:22:32,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 107 transitions. [2023-11-28 20:22:32,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:32,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 107 transitions. [2023-11-28 20:22:32,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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) [2023-11-28 20:22:32,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,540 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 107 transitions. [2023-11-28 20:22:32,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 162 flow [2023-11-28 20:22:32,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:32,542 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-28 20:22:32,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-28 20:22:32,543 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-28 20:22:32,543 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-28 20:22:32,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:32,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:32,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:22:32,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:32,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash -724757702, now seen corresponding path program 1 times [2023-11-28 20:22:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117028123] [2023-11-28 20:22:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:32,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117028123] [2023-11-28 20:22:32,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117028123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:32,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:32,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:32,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730635205] [2023-11-28 20:22:32,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:32,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:32,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:32,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:32,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:32,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:22:32,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:32,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:22:32,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:32,836 INFO L124 PetriNetUnfolderBase]: 605/1174 cut-off events. [2023-11-28 20:22:32,837 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-28 20:22:32,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 1174 events. 605/1174 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7379 event pairs, 351 based on Foata normal form. 12/1143 useless extension candidates. Maximal degree in co-relation 2175. Up to 782 conditions per place. [2023-11-28 20:22:32,846 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 25 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-28 20:22:32,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 156 flow [2023-11-28 20:22:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-28 20:22:32,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6855345911949685 [2023-11-28 20:22:32,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-28 20:22:32,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-28 20:22:32,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:32,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-28 20:22:32,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,851 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 109 transitions. [2023-11-28 20:22:32,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 156 flow [2023-11-28 20:22:32,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:32,853 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-28 20:22:32,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-28 20:22:32,854 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-28 20:22:32,854 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-28 20:22:32,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:32,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:32,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:32,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:22:32,855 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:32,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1169256111, now seen corresponding path program 1 times [2023-11-28 20:22:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602625250] [2023-11-28 20:22:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602625250] [2023-11-28 20:22:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602625250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:22:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479836099] [2023-11-28 20:22:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:33,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:22:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:22:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:22:33,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:22:33,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:33,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:33,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:22:33,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:34,083 INFO L124 PetriNetUnfolderBase]: 828/1513 cut-off events. [2023-11-28 20:22:34,083 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-28 20:22:34,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 1513 events. 828/1513 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9251 event pairs, 12 based on Foata normal form. 48/1543 useless extension candidates. Maximal degree in co-relation 2849. Up to 825 conditions per place. [2023-11-28 20:22:34,094 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 37 selfloop transitions, 4 changer transitions 10/66 dead transitions. [2023-11-28 20:22:34,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 246 flow [2023-11-28 20:22:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:22:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:22:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2023-11-28 20:22:34,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5929919137466307 [2023-11-28 20:22:34,095 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 220 transitions. [2023-11-28 20:22:34,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 220 transitions. [2023-11-28 20:22:34,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:34,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 220 transitions. [2023-11-28 20:22:34,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.428571428571427) internal successors, (220), 7 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:34,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:34,098 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:34,099 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 7 states and 220 transitions. [2023-11-28 20:22:34,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 246 flow [2023-11-28 20:22:34,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:34,101 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 88 flow [2023-11-28 20:22:34,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=88, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-28 20:22:34,102 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 20:22:34,102 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 88 flow [2023-11-28 20:22:34,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:34,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:34,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:34,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:22:34,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:34,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1169254827, now seen corresponding path program 1 times [2023-11-28 20:22:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:34,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111212312] [2023-11-28 20:22:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111212312] [2023-11-28 20:22:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111212312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365265743] [2023-11-28 20:22:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:35,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:35,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:35,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:35,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:35,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:22:35,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:35,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:35,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:22:35,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:36,037 INFO L124 PetriNetUnfolderBase]: 2046/3497 cut-off events. [2023-11-28 20:22:36,038 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-11-28 20:22:36,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6747 conditions, 3497 events. 2046/3497 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22325 event pairs, 295 based on Foata normal form. 0/3395 useless extension candidates. Maximal degree in co-relation 6736. Up to 1454 conditions per place. [2023-11-28 20:22:36,058 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 35 selfloop transitions, 8 changer transitions 71/128 dead transitions. [2023-11-28 20:22:36,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 128 transitions, 502 flow [2023-11-28 20:22:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:22:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-28 20:22:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 405 transitions. [2023-11-28 20:22:36,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6367924528301887 [2023-11-28 20:22:36,061 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 405 transitions. [2023-11-28 20:22:36,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 405 transitions. [2023-11-28 20:22:36,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:36,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 405 transitions. [2023-11-28 20:22:36,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 33.75) internal successors, (405), 12 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:36,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:36,065 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:36,065 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 88 flow. Second operand 12 states and 405 transitions. [2023-11-28 20:22:36,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 128 transitions, 502 flow [2023-11-28 20:22:36,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 128 transitions, 493 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:36,069 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 181 flow [2023-11-28 20:22:36,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=181, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2023-11-28 20:22:36,070 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-28 20:22:36,070 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 181 flow [2023-11-28 20:22:36,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:36,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:36,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:36,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:22:36,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:36,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:36,071 INFO L85 PathProgramCache]: Analyzing trace with hash -241276364, now seen corresponding path program 1 times [2023-11-28 20:22:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:36,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002767201] [2023-11-28 20:22:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:36,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:36,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:36,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002767201] [2023-11-28 20:22:36,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002767201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:36,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:36,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:36,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233026471] [2023-11-28 20:22:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:36,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:36,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:36,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:36,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:22:36,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:36,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:36,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:22:36,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:37,508 INFO L124 PetriNetUnfolderBase]: 1530/2703 cut-off events. [2023-11-28 20:22:37,508 INFO L125 PetriNetUnfolderBase]: For 6538/6541 co-relation queries the response was YES. [2023-11-28 20:22:37,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9388 conditions, 2703 events. 1530/2703 cut-off events. For 6538/6541 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17053 event pairs, 439 based on Foata normal form. 71/2765 useless extension candidates. Maximal degree in co-relation 9366. Up to 1614 conditions per place. [2023-11-28 20:22:37,525 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 41 selfloop transitions, 16 changer transitions 44/115 dead transitions. [2023-11-28 20:22:37,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 115 transitions, 781 flow [2023-11-28 20:22:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:22:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 20:22:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 338 transitions. [2023-11-28 20:22:37,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6377358490566037 [2023-11-28 20:22:37,528 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 338 transitions. [2023-11-28 20:22:37,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 338 transitions. [2023-11-28 20:22:37,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:37,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 338 transitions. [2023-11-28 20:22:37,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 33.8) internal successors, (338), 10 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:37,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:37,532 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:37,532 INFO L175 Difference]: Start difference. First operand has 67 places, 42 transitions, 181 flow. Second operand 10 states and 338 transitions. [2023-11-28 20:22:37,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 115 transitions, 781 flow [2023-11-28 20:22:37,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 703 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-11-28 20:22:37,548 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 291 flow [2023-11-28 20:22:37,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=291, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2023-11-28 20:22:37,549 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-28 20:22:37,550 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 291 flow [2023-11-28 20:22:37,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:37,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:37,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:37,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:22:37,550 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:37,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1262208165, now seen corresponding path program 1 times [2023-11-28 20:22:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118407113] [2023-11-28 20:22:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:38,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118407113] [2023-11-28 20:22:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118407113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384576748] [2023-11-28 20:22:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:38,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-28 20:22:38,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:38,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:38,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-28 20:22:38,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:38,840 INFO L124 PetriNetUnfolderBase]: 2228/3700 cut-off events. [2023-11-28 20:22:38,841 INFO L125 PetriNetUnfolderBase]: For 9011/9017 co-relation queries the response was YES. [2023-11-28 20:22:38,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13699 conditions, 3700 events. 2228/3700 cut-off events. For 9011/9017 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23268 event pairs, 379 based on Foata normal form. 81/3755 useless extension candidates. Maximal degree in co-relation 13672. Up to 1336 conditions per place. [2023-11-28 20:22:38,883 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 51 selfloop transitions, 9 changer transitions 63/136 dead transitions. [2023-11-28 20:22:38,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 136 transitions, 1084 flow [2023-11-28 20:22:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:22:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 20:22:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 301 transitions. [2023-11-28 20:22:38,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6310272536687631 [2023-11-28 20:22:38,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 301 transitions. [2023-11-28 20:22:38,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 301 transitions. [2023-11-28 20:22:38,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:38,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 301 transitions. [2023-11-28 20:22:38,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.44444444444444) internal successors, (301), 9 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:38,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:38,889 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:38,889 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 291 flow. Second operand 9 states and 301 transitions. [2023-11-28 20:22:38,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 136 transitions, 1084 flow [2023-11-28 20:22:38,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 1036 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-11-28 20:22:38,918 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 287 flow [2023-11-28 20:22:38,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=287, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2023-11-28 20:22:38,919 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-28 20:22:38,919 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 287 flow [2023-11-28 20:22:38,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:38,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:38,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:38,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:22:38,920 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:38,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2041813929, now seen corresponding path program 1 times [2023-11-28 20:22:38,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:38,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183692848] [2023-11-28 20:22:38,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:38,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:39,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:39,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183692848] [2023-11-28 20:22:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183692848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:39,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:39,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839262515] [2023-11-28 20:22:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:39,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:39,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:39,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:39,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:39,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:39,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:39,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:39,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:39,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:39,855 INFO L124 PetriNetUnfolderBase]: 1309/2293 cut-off events. [2023-11-28 20:22:39,855 INFO L125 PetriNetUnfolderBase]: For 7164/7311 co-relation queries the response was YES. [2023-11-28 20:22:39,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8693 conditions, 2293 events. 1309/2293 cut-off events. For 7164/7311 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13478 event pairs, 518 based on Foata normal form. 182/2418 useless extension candidates. Maximal degree in co-relation 8666. Up to 1508 conditions per place. [2023-11-28 20:22:39,871 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 35 selfloop transitions, 3 changer transitions 33/92 dead transitions. [2023-11-28 20:22:39,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 92 transitions, 669 flow [2023-11-28 20:22:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:22:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:22:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2023-11-28 20:22:39,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6522911051212938 [2023-11-28 20:22:39,873 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 242 transitions. [2023-11-28 20:22:39,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 242 transitions. [2023-11-28 20:22:39,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:39,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 242 transitions. [2023-11-28 20:22:39,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:39,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:39,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:39,875 INFO L175 Difference]: Start difference. First operand has 70 places, 48 transitions, 287 flow. Second operand 7 states and 242 transitions. [2023-11-28 20:22:39,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 92 transitions, 669 flow [2023-11-28 20:22:39,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 600 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-28 20:22:39,887 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 279 flow [2023-11-28 20:22:39,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-11-28 20:22:39,888 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-28 20:22:39,888 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 279 flow [2023-11-28 20:22:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:39,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:39,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:39,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:22:39,889 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:39,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1796389807, now seen corresponding path program 1 times [2023-11-28 20:22:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:39,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872885621] [2023-11-28 20:22:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872885621] [2023-11-28 20:22:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872885621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:40,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431931376] [2023-11-28 20:22:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:40,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:40,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:40,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:40,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:40,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:40,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:40,673 INFO L124 PetriNetUnfolderBase]: 1273/2218 cut-off events. [2023-11-28 20:22:40,673 INFO L125 PetriNetUnfolderBase]: For 6656/6814 co-relation queries the response was YES. [2023-11-28 20:22:40,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8623 conditions, 2218 events. 1273/2218 cut-off events. For 6656/6814 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12933 event pairs, 500 based on Foata normal form. 173/2330 useless extension candidates. Maximal degree in co-relation 8598. Up to 1363 conditions per place. [2023-11-28 20:22:40,690 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 42 selfloop transitions, 8 changer transitions 31/102 dead transitions. [2023-11-28 20:22:40,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 753 flow [2023-11-28 20:22:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:22:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:22:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2023-11-28 20:22:40,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6533018867924528 [2023-11-28 20:22:40,692 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 277 transitions. [2023-11-28 20:22:40,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 277 transitions. [2023-11-28 20:22:40,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:40,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 277 transitions. [2023-11-28 20:22:40,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:40,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:40,695 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:40,695 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 279 flow. Second operand 8 states and 277 transitions. [2023-11-28 20:22:40,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 753 flow [2023-11-28 20:22:40,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 102 transitions, 738 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-28 20:22:40,706 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 341 flow [2023-11-28 20:22:40,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=341, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-11-28 20:22:40,706 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2023-11-28 20:22:40,707 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 341 flow [2023-11-28 20:22:40,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:40,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:40,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:40,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:22:40,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:40,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1165898107, now seen corresponding path program 2 times [2023-11-28 20:22:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442365631] [2023-11-28 20:22:40,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:41,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442365631] [2023-11-28 20:22:41,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442365631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:41,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9165612] [2023-11-28 20:22:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:41,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:41,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:41,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 341 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:41,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:41,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:41,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:41,566 INFO L124 PetriNetUnfolderBase]: 1236/2119 cut-off events. [2023-11-28 20:22:41,566 INFO L125 PetriNetUnfolderBase]: For 8569/8758 co-relation queries the response was YES. [2023-11-28 20:22:41,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9006 conditions, 2119 events. 1236/2119 cut-off events. For 8569/8758 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12017 event pairs, 392 based on Foata normal form. 198/2264 useless extension candidates. Maximal degree in co-relation 8977. Up to 1353 conditions per place. [2023-11-28 20:22:41,577 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 44 selfloop transitions, 5 changer transitions 31/101 dead transitions. [2023-11-28 20:22:41,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 101 transitions, 809 flow [2023-11-28 20:22:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:22:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:22:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2023-11-28 20:22:41,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6438679245283019 [2023-11-28 20:22:41,580 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 273 transitions. [2023-11-28 20:22:41,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 273 transitions. [2023-11-28 20:22:41,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:41,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 273 transitions. [2023-11-28 20:22:41,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:41,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:41,583 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:41,583 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 341 flow. Second operand 8 states and 273 transitions. [2023-11-28 20:22:41,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 101 transitions, 809 flow [2023-11-28 20:22:41,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 757 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-11-28 20:22:41,599 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 326 flow [2023-11-28 20:22:41,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2023-11-28 20:22:41,599 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2023-11-28 20:22:41,599 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 326 flow [2023-11-28 20:22:41,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:41,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:41,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:41,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:22:41,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:41,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 495987245, now seen corresponding path program 1 times [2023-11-28 20:22:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701221678] [2023-11-28 20:22:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701221678] [2023-11-28 20:22:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701221678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:42,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:22:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526052533] [2023-11-28 20:22:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:22:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:22:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:22:42,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:42,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:42,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:42,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:42,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:42,568 INFO L124 PetriNetUnfolderBase]: 1289/2241 cut-off events. [2023-11-28 20:22:42,568 INFO L125 PetriNetUnfolderBase]: For 9478/9689 co-relation queries the response was YES. [2023-11-28 20:22:42,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9445 conditions, 2241 events. 1289/2241 cut-off events. For 9478/9689 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12965 event pairs, 413 based on Foata normal form. 224/2414 useless extension candidates. Maximal degree in co-relation 9414. Up to 1418 conditions per place. [2023-11-28 20:22:42,580 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 48 selfloop transitions, 10 changer transitions 35/114 dead transitions. [2023-11-28 20:22:42,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 114 transitions, 929 flow [2023-11-28 20:22:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:22:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:22:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2023-11-28 20:22:42,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6533018867924528 [2023-11-28 20:22:42,581 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 277 transitions. [2023-11-28 20:22:42,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 277 transitions. [2023-11-28 20:22:42,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:42,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 277 transitions. [2023-11-28 20:22:42,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:42,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:42,584 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:42,584 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 326 flow. Second operand 8 states and 277 transitions. [2023-11-28 20:22:42,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 114 transitions, 929 flow [2023-11-28 20:22:42,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 114 transitions, 902 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-28 20:22:42,601 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 436 flow [2023-11-28 20:22:42,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=436, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2023-11-28 20:22:42,601 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-11-28 20:22:42,602 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 436 flow [2023-11-28 20:22:42,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:42,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:42,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:42,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:22:42,602 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:42,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1400216688, now seen corresponding path program 1 times [2023-11-28 20:22:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012249238] [2023-11-28 20:22:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:43,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012249238] [2023-11-28 20:22:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012249238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:43,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:43,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:22:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349389927] [2023-11-28 20:22:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:43,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:22:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:43,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:22:43,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:43,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:43,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 436 flow. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:43,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:43,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:43,777 INFO L124 PetriNetUnfolderBase]: 1164/2021 cut-off events. [2023-11-28 20:22:43,777 INFO L125 PetriNetUnfolderBase]: For 14037/14293 co-relation queries the response was YES. [2023-11-28 20:22:43,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9866 conditions, 2021 events. 1164/2021 cut-off events. For 14037/14293 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11506 event pairs, 330 based on Foata normal form. 201/2171 useless extension candidates. Maximal degree in co-relation 9834. Up to 1302 conditions per place. [2023-11-28 20:22:43,788 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 49 selfloop transitions, 11 changer transitions 27/108 dead transitions. [2023-11-28 20:22:43,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 1002 flow [2023-11-28 20:22:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:22:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:22:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2023-11-28 20:22:43,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6438679245283019 [2023-11-28 20:22:43,790 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 273 transitions. [2023-11-28 20:22:43,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 273 transitions. [2023-11-28 20:22:43,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:43,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 273 transitions. [2023-11-28 20:22:43,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:43,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:43,792 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:43,792 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 436 flow. Second operand 8 states and 273 transitions. [2023-11-28 20:22:43,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 1002 flow [2023-11-28 20:22:43,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 976 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:43,809 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 518 flow [2023-11-28 20:22:43,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=518, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2023-11-28 20:22:43,809 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-11-28 20:22:43,810 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 518 flow [2023-11-28 20:22:43,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:43,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:43,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:43,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:22:43,810 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:43,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1861042825, now seen corresponding path program 1 times [2023-11-28 20:22:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136932214] [2023-11-28 20:22:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:44,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136932214] [2023-11-28 20:22:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136932214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:22:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307890772] [2023-11-28 20:22:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:44,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:22:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:22:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:22:44,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-28 20:22:44,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 518 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:44,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:44,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-28 20:22:44,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:45,455 INFO L124 PetriNetUnfolderBase]: 1696/2839 cut-off events. [2023-11-28 20:22:45,455 INFO L125 PetriNetUnfolderBase]: For 21620/21620 co-relation queries the response was YES. [2023-11-28 20:22:45,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14574 conditions, 2839 events. 1696/2839 cut-off events. For 21620/21620 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16371 event pairs, 337 based on Foata normal form. 67/2901 useless extension candidates. Maximal degree in co-relation 14539. Up to 1401 conditions per place. [2023-11-28 20:22:45,470 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 62 selfloop transitions, 32 changer transitions 37/144 dead transitions. [2023-11-28 20:22:45,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 144 transitions, 1493 flow [2023-11-28 20:22:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:22:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 20:22:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 327 transitions. [2023-11-28 20:22:45,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6169811320754717 [2023-11-28 20:22:45,472 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 327 transitions. [2023-11-28 20:22:45,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 327 transitions. [2023-11-28 20:22:45,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:45,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 327 transitions. [2023-11-28 20:22:45,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 32.7) internal successors, (327), 10 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:45,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:45,475 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:45,475 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 518 flow. Second operand 10 states and 327 transitions. [2023-11-28 20:22:45,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 144 transitions, 1493 flow [2023-11-28 20:22:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 144 transitions, 1363 flow, removed 56 selfloop flow, removed 8 redundant places. [2023-11-28 20:22:45,499 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 768 flow [2023-11-28 20:22:45,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=768, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2023-11-28 20:22:45,500 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2023-11-28 20:22:45,500 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 768 flow [2023-11-28 20:22:45,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:45,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:45,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:45,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:22:45,501 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:45,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1038991626, now seen corresponding path program 1 times [2023-11-28 20:22:45,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533374040] [2023-11-28 20:22:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533374040] [2023-11-28 20:22:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533374040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:22:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440511399] [2023-11-28 20:22:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:45,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:22:45,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 768 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:45,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:45,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:22:45,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:46,174 INFO L124 PetriNetUnfolderBase]: 2695/4209 cut-off events. [2023-11-28 20:22:46,174 INFO L125 PetriNetUnfolderBase]: For 55984/57690 co-relation queries the response was YES. [2023-11-28 20:22:46,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22702 conditions, 4209 events. 2695/4209 cut-off events. For 55984/57690 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23347 event pairs, 343 based on Foata normal form. 682/4651 useless extension candidates. Maximal degree in co-relation 22667. Up to 2169 conditions per place. [2023-11-28 20:22:46,225 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 96 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2023-11-28 20:22:46,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 1598 flow [2023-11-28 20:22:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:22:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:22:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-28 20:22:46,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-28 20:22:46,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-28 20:22:46,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-28 20:22:46,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:46,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-28 20:22:46,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,228 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,228 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 768 flow. Second operand 4 states and 144 transitions. [2023-11-28 20:22:46,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 1598 flow [2023-11-28 20:22:46,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 127 transitions, 1549 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-11-28 20:22:46,246 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 749 flow [2023-11-28 20:22:46,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=749, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2023-11-28 20:22:46,246 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2023-11-28 20:22:46,246 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 749 flow [2023-11-28 20:22:46,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:46,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:46,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:22:46,247 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:46,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1824269130, now seen corresponding path program 1 times [2023-11-28 20:22:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429235172] [2023-11-28 20:22:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:46,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429235172] [2023-11-28 20:22:46,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429235172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:46,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:46,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:22:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462371996] [2023-11-28 20:22:46,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:46,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:22:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:22:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:22:46,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:22:46,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 749 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:46,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:22:46,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:46,867 INFO L124 PetriNetUnfolderBase]: 1928/3066 cut-off events. [2023-11-28 20:22:46,867 INFO L125 PetriNetUnfolderBase]: For 34052/35134 co-relation queries the response was YES. [2023-11-28 20:22:46,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 3066 events. 1928/3066 cut-off events. For 34052/35134 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16149 event pairs, 236 based on Foata normal form. 501/3338 useless extension candidates. Maximal degree in co-relation 15993. Up to 1045 conditions per place. [2023-11-28 20:22:46,884 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 93 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2023-11-28 20:22:46,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 1466 flow [2023-11-28 20:22:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:22:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:22:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-28 20:22:46,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867924528301886 [2023-11-28 20:22:46,886 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-28 20:22:46,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-28 20:22:46,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:46,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-28 20:22:46,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,888 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,888 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 749 flow. Second operand 5 states and 182 transitions. [2023-11-28 20:22:46,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 1466 flow [2023-11-28 20:22:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 126 transitions, 1457 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-28 20:22:46,902 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 734 flow [2023-11-28 20:22:46,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=734, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2023-11-28 20:22:46,902 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2023-11-28 20:22:46,902 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 734 flow [2023-11-28 20:22:46,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:46,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:46,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:46,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:22:46,903 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:46,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1304270343, now seen corresponding path program 1 times [2023-11-28 20:22:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640209489] [2023-11-28 20:22:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640209489] [2023-11-28 20:22:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640209489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:47,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:47,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983259231] [2023-11-28 20:22:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:47,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:47,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:47,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:22:47,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 734 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:47,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:22:47,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:47,503 INFO L124 PetriNetUnfolderBase]: 1544/2406 cut-off events. [2023-11-28 20:22:47,503 INFO L125 PetriNetUnfolderBase]: For 30917/31813 co-relation queries the response was YES. [2023-11-28 20:22:47,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13621 conditions, 2406 events. 1544/2406 cut-off events. For 30917/31813 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 12248 event pairs, 222 based on Foata normal form. 334/2515 useless extension candidates. Maximal degree in co-relation 13584. Up to 1009 conditions per place. [2023-11-28 20:22:47,513 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 84 selfloop transitions, 11 changer transitions 0/120 dead transitions. [2023-11-28 20:22:47,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 120 transitions, 1360 flow [2023-11-28 20:22:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:22:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2023-11-28 20:22:47,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2023-11-28 20:22:47,515 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 204 transitions. [2023-11-28 20:22:47,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 204 transitions. [2023-11-28 20:22:47,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:47,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 204 transitions. [2023-11-28 20:22:47,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,516 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,516 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 734 flow. Second operand 6 states and 204 transitions. [2023-11-28 20:22:47,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 120 transitions, 1360 flow [2023-11-28 20:22:47,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 1210 flow, removed 67 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:47,531 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 673 flow [2023-11-28 20:22:47,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-11-28 20:22:47,531 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2023-11-28 20:22:47,531 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 673 flow [2023-11-28 20:22:47,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:47,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:47,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:47,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:22:47,532 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:47,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1722964392, now seen corresponding path program 1 times [2023-11-28 20:22:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:47,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332092188] [2023-11-28 20:22:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332092188] [2023-11-28 20:22:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332092188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:22:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966029249] [2023-11-28 20:22:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:48,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:22:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:22:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:22:48,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:48,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 673 flow. Second operand has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:48,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:48,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:48,867 INFO L124 PetriNetUnfolderBase]: 995/2007 cut-off events. [2023-11-28 20:22:48,867 INFO L125 PetriNetUnfolderBase]: For 12652/12919 co-relation queries the response was YES. [2023-11-28 20:22:48,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8828 conditions, 2007 events. 995/2007 cut-off events. For 12652/12919 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 13162 event pairs, 190 based on Foata normal form. 133/1994 useless extension candidates. Maximal degree in co-relation 8791. Up to 848 conditions per place. [2023-11-28 20:22:48,877 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 45 selfloop transitions, 20 changer transitions 13/110 dead transitions. [2023-11-28 20:22:48,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 110 transitions, 1030 flow [2023-11-28 20:22:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:22:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:22:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 262 transitions. [2023-11-28 20:22:48,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6179245283018868 [2023-11-28 20:22:48,878 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 262 transitions. [2023-11-28 20:22:48,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 262 transitions. [2023-11-28 20:22:48,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:48,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 262 transitions. [2023-11-28 20:22:48,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.75) internal successors, (262), 8 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,880 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,880 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 673 flow. Second operand 8 states and 262 transitions. [2023-11-28 20:22:48,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 110 transitions, 1030 flow [2023-11-28 20:22:48,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 110 transitions, 880 flow, removed 67 selfloop flow, removed 8 redundant places. [2023-11-28 20:22:48,902 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 657 flow [2023-11-28 20:22:48,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=657, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2023-11-28 20:22:48,902 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-11-28 20:22:48,903 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 657 flow [2023-11-28 20:22:48,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:48,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:48,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:48,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:22:48,904 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:48,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -655827444, now seen corresponding path program 2 times [2023-11-28 20:22:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118577159] [2023-11-28 20:22:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118577159] [2023-11-28 20:22:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118577159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:22:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669325751] [2023-11-28 20:22:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:49,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:22:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:22:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:22:49,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:49,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 657 flow. Second operand has 11 states, 11 states have (on average 27.545454545454547) internal successors, (303), 11 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:49,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:49,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:49,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:50,413 INFO L124 PetriNetUnfolderBase]: 1130/2246 cut-off events. [2023-11-28 20:22:50,414 INFO L125 PetriNetUnfolderBase]: For 8524/8720 co-relation queries the response was YES. [2023-11-28 20:22:50,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8659 conditions, 2246 events. 1130/2246 cut-off events. For 8524/8720 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 15255 event pairs, 253 based on Foata normal form. 111/2148 useless extension candidates. Maximal degree in co-relation 8623. Up to 565 conditions per place. [2023-11-28 20:22:50,423 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 45 selfloop transitions, 11 changer transitions 27/114 dead transitions. [2023-11-28 20:22:50,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 965 flow [2023-11-28 20:22:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:22:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:22:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2023-11-28 20:22:50,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2023-11-28 20:22:50,424 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 265 transitions. [2023-11-28 20:22:50,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 265 transitions. [2023-11-28 20:22:50,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:50,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 265 transitions. [2023-11-28 20:22:50,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.125) internal successors, (265), 8 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,426 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,426 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 657 flow. Second operand 8 states and 265 transitions. [2023-11-28 20:22:50,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 965 flow [2023-11-28 20:22:50,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 114 transitions, 928 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-11-28 20:22:50,440 INFO L231 Difference]: Finished difference. Result has 96 places, 74 transitions, 597 flow [2023-11-28 20:22:50,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=597, PETRI_PLACES=96, PETRI_TRANSITIONS=74} [2023-11-28 20:22:50,440 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2023-11-28 20:22:50,440 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 74 transitions, 597 flow [2023-11-28 20:22:50,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.545454545454547) internal successors, (303), 11 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:50,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:50,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:50,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:22:50,441 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:50,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1845952262, now seen corresponding path program 3 times [2023-11-28 20:22:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273042325] [2023-11-28 20:22:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:22:50,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:22:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:22:50,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:22:50,529 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:22:50,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-28 20:22:50,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-28 20:22:50,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-28 20:22:50,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-28 20:22:50,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-28 20:22:50,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:22:50,533 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:50,538 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:22:50,538 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:22:50,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-28 20:22:50,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 20:22:50,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:22:50,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:22:50,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:22:50,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:50 BasicIcfg [2023-11-28 20:22:50,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:22:50,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:22:50,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:22:50,606 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:22:50,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:29" (3/4) ... [2023-11-28 20:22:50,608 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:22:50,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:22:50,609 INFO L158 Benchmark]: Toolchain (without parser) took 22330.25ms. Allocated memory was 159.4MB in the beginning and 547.4MB in the end (delta: 388.0MB). Free memory was 124.8MB in the beginning and 375.1MB in the end (delta: -250.3MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. [2023-11-28 20:22:50,609 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:22:50,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.71ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 100.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 20:22:50,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.85ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 98.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:22:50,610 INFO L158 Benchmark]: Boogie Preprocessor took 59.28ms. Allocated memory is still 159.4MB. Free memory was 98.1MB in the beginning and 94.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:22:50,610 INFO L158 Benchmark]: RCFGBuilder took 719.85ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 94.7MB in the beginning and 158.9MB in the end (delta: -64.2MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2023-11-28 20:22:50,611 INFO L158 Benchmark]: TraceAbstraction took 21033.66ms. Allocated memory was 209.7MB in the beginning and 547.4MB in the end (delta: 337.6MB). Free memory was 157.9MB in the beginning and 375.1MB in the end (delta: -217.2MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. [2023-11-28 20:22:50,611 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 547.4MB. Free memory is still 375.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:22:50,612 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.19ms. Allocated memory is still 159.4MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.71ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 100.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.85ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 98.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.28ms. Allocated memory is still 159.4MB. Free memory was 98.1MB in the beginning and 94.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 719.85ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 94.7MB in the beginning and 158.9MB in the end (delta: -64.2MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21033.66ms. Allocated memory was 209.7MB in the beginning and 547.4MB in the end (delta: 337.6MB). Free memory was 157.9MB in the beginning and 375.1MB in the end (delta: -217.2MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 547.4MB. Free memory is still 375.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 823]: 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: 821]: 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, 77 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1095 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 977 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3232 IncrementalHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 52 mSDtfsCounter, 3232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=768occurred in iteration=17, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 4070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:22:50,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:22:52,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:22:52,700 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 20:22:52,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:22:52,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:22:52,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:22:52,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:22:52,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:22:52,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:22:52,737 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:22:52,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:22:52,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:22:52,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:22:52,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:22:52,740 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:22:52,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:22:52,741 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:22:52,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:22:52,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:22:52,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:22:52,744 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:22:52,746 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:22:52,747 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:22:52,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:22:52,748 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:22:52,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:22:52,748 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:22:52,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:22:52,749 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:22:52,749 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:22:52,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:22:52,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:22:52,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:22:52,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:22:52,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:52,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:22:52,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:22:52,752 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:22:52,752 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:22:52,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:22:52,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:22:52,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:22:52,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:22:52,754 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:22:52,754 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_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2023-11-28 20:22:53,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:22:53,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:22:53,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:22:53,054 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:22:53,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:22:53,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-28 20:22:55,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:22:56,137 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:22:56,138 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-28 20:22:56,155 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data/e1585d1f8/07acc8f495954b598d901d19dde225ac/FLAGd51c781fc [2023-11-28 20:22:56,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/data/e1585d1f8/07acc8f495954b598d901d19dde225ac [2023-11-28 20:22:56,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:22:56,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:22:56,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:56,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:22:56,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:22:56,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6663779f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56, skipping insertion in model container [2023-11-28 20:22:56,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,236 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:22:56,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:56,616 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:22:56,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:22:56,712 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:22:56,713 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:22:56,720 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:22:56,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56 WrapperNode [2023-11-28 20:22:56,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:22:56,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:56,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:22:56,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:22:56,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,777 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-28 20:22:56,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:22:56,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:22:56,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:22:56,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:22:56,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,813 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-28 20:22:56,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:22:56,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:22:56,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:22:56,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:22:56,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (1/1) ... [2023-11-28 20:22:56,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:22:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:22:56,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:22:56,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:22:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:22:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:22:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:22:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:22:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 20:22:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 20:22:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 20:22:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 20:22:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:22:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 20:22:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 20:22:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 20:22:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 20:22:56,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 20:22:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 20:22:56,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 20:22:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 20:22:56,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 20:22:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:22:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:22:56,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:22:56,914 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:22:57,068 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:22:57,070 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:22:57,406 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:22:57,586 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:22:57,586 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:22:57,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:57 BoogieIcfgContainer [2023-11-28 20:22:57,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:22:57,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:22:57,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:22:57,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:22:57,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:56" (1/3) ... [2023-11-28 20:22:57,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d76da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:57, skipping insertion in model container [2023-11-28 20:22:57,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:56" (2/3) ... [2023-11-28 20:22:57,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d76da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:57, skipping insertion in model container [2023-11-28 20:22:57,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:57" (3/3) ... [2023-11-28 20:22:57,595 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-28 20:22:57,615 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:22:57,615 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-28 20:22:57,615 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:22:57,667 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 20:22:57,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 20:22:57,733 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-28 20:22:57,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:22:57,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-28 20:22:57,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 20:22:57,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-28 20:22:57,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:22:57,759 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74d7fe4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:22:57,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-28 20:22:57,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:22:57,763 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 20:22:57,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:22:57,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:57,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:22:57,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:57,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash 12275, now seen corresponding path program 1 times [2023-11-28 20:22:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:57,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934162485] [2023-11-28 20:22:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:57,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:57,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:57,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:22:57,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 20:22:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:57,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:22:57,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:57,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 20:22:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:57,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:57,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934162485] [2023-11-28 20:22:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934162485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:57,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:57,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:22:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780091292] [2023-11-28 20:22:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:57,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:58,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:58,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:58,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:58,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:58,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:58,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:58,470 INFO L124 PetriNetUnfolderBase]: 872/1688 cut-off events. [2023-11-28 20:22:58,470 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-28 20:22:58,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1688 events. 872/1688 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11181 event pairs, 680 based on Foata normal form. 90/1586 useless extension candidates. Maximal degree in co-relation 3040. Up to 1037 conditions per place. [2023-11-28 20:22:58,492 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-28 20:22:58,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 179 flow [2023-11-28 20:22:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 20:22:58,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 20:22:58,526 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 20:22:58,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 20:22:58,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:58,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 20:22:58,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:58,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:58,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:58,544 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 112 transitions. [2023-11-28 20:22:58,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 179 flow [2023-11-28 20:22:58,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:22:58,555 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-28 20:22:58,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-28 20:22:58,561 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 20:22:58,561 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-28 20:22:58,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:58,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:58,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:22:58,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:22:58,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:58,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:58,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash 12276, now seen corresponding path program 1 times [2023-11-28 20:22:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490894899] [2023-11-28 20:22:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:58,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:58,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:22:58,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:22:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:58,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:22:58,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:58,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 20:22:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:58,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:58,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490894899] [2023-11-28 20:22:58,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490894899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:58,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:58,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:22:58,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134822671] [2023-11-28 20:22:58,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:58,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:58,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:58,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:58,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:58,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:22:58,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:58,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:58,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:22:58,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:59,289 INFO L124 PetriNetUnfolderBase]: 872/1687 cut-off events. [2023-11-28 20:22:59,290 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 20:22:59,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1687 events. 872/1687 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11186 event pairs, 680 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 3085. Up to 1036 conditions per place. [2023-11-28 20:22:59,307 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-28 20:22:59,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-28 20:22:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 20:22:59,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 20:22:59,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 20:22:59,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 20:22:59,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:59,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 20:22:59,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:59,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:59,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:59,314 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 112 transitions. [2023-11-28 20:22:59,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-28 20:22:59,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:59,318 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-28 20:22:59,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-28 20:22:59,319 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-28 20:22:59,319 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-28 20:22:59,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:59,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:59,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:22:59,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:22:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:59,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:22:59,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 366057590, now seen corresponding path program 1 times [2023-11-28 20:22:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90414237] [2023-11-28 20:22:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:59,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:59,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:59,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:22:59,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:22:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:59,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:22:59,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:59,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 20:22:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:59,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:59,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90414237] [2023-11-28 20:22:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90414237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:59,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:59,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:59,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131131067] [2023-11-28 20:22:59,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:59,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:59,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:59,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:59,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:22:59,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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) [2023-11-28 20:22:59,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:59,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:22:59,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:59,889 INFO L124 PetriNetUnfolderBase]: 876/1686 cut-off events. [2023-11-28 20:22:59,889 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-28 20:22:59,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 1686 events. 876/1686 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11403 event pairs, 472 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 3093. Up to 1039 conditions per place. [2023-11-28 20:22:59,900 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-28 20:22:59,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 176 flow [2023-11-28 20:22:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-28 20:22:59,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-28 20:22:59,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-28 20:22:59,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-28 20:22:59,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:59,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-28 20:22:59,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:59,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:59,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:59,919 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 110 transitions. [2023-11-28 20:22:59,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 176 flow [2023-11-28 20:22:59,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:59,922 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-28 20:22:59,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-28 20:22:59,923 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-28 20:22:59,923 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-28 20:22:59,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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) [2023-11-28 20:22:59,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:59,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:22:59,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-28 20:23:00,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:00,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:00,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 366057591, now seen corresponding path program 1 times [2023-11-28 20:23:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610951454] [2023-11-28 20:23:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:00,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:00,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:00,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:00,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-28 20:23:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:00,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:00,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:00,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 20:23:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:00,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:00,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610951454] [2023-11-28 20:23:00,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610951454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:00,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:00,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286120080] [2023-11-28 20:23:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:00,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:00,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:23:00,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:00,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:00,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:23:00,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:00,482 INFO L124 PetriNetUnfolderBase]: 872/1656 cut-off events. [2023-11-28 20:23:00,482 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-28 20:23:00,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3069 conditions, 1656 events. 872/1656 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11227 event pairs, 694 based on Foata normal form. 5/1487 useless extension candidates. Maximal degree in co-relation 3059. Up to 1030 conditions per place. [2023-11-28 20:23:00,492 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-28 20:23:00,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-28 20:23:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-28 20:23:00,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2023-11-28 20:23:00,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-28 20:23:00,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-28 20:23:00,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:00,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-28 20:23:00,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:00,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:00,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:00,498 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 112 transitions. [2023-11-28 20:23:00,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-28 20:23:00,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:00,501 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-28 20:23:00,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-28 20:23:00,503 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-28 20:23:00,503 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-28 20:23:00,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:00,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:00,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:23:00,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-28 20:23:00,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:00,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:00,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash 366058182, now seen corresponding path program 1 times [2023-11-28 20:23:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450370526] [2023-11-28 20:23:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:00,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:00,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:00,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:00,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-28 20:23:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:00,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:23:00,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:00,786 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:00,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:00,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450370526] [2023-11-28 20:23:00,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450370526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:00,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:23:00,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493698048] [2023-11-28 20:23:00,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:00,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:00,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:00,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-28 20:23:00,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:00,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:00,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-28 20:23:00,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:01,031 INFO L124 PetriNetUnfolderBase]: 680/1288 cut-off events. [2023-11-28 20:23:01,031 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-28 20:23:01,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1288 events. 680/1288 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8257 event pairs, 104 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 2392. Up to 844 conditions per place. [2023-11-28 20:23:01,041 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 33 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-28 20:23:01,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 208 flow [2023-11-28 20:23:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-28 20:23:01,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2023-11-28 20:23:01,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-28 20:23:01,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-28 20:23:01,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:01,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-28 20:23:01,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,047 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 122 transitions. [2023-11-28 20:23:01,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 208 flow [2023-11-28 20:23:01,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:01,049 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-28 20:23:01,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-28 20:23:01,050 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 20:23:01,050 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-28 20:23:01,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:01,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:01,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-28 20:23:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:01,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:01,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 300069945, now seen corresponding path program 1 times [2023-11-28 20:23:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579963713] [2023-11-28 20:23:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:01,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:01,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:01,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:01,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-28 20:23:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:01,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:01,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:01,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 20:23:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:01,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:01,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579963713] [2023-11-28 20:23:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579963713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:01,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:01,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17789252] [2023-11-28 20:23:01,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:01,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:01,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:23:01,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:01,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:23:01,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:01,560 INFO L124 PetriNetUnfolderBase]: 622/1203 cut-off events. [2023-11-28 20:23:01,560 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2023-11-28 20:23:01,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 1203 events. 622/1203 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7540 event pairs, 359 based on Foata normal form. 0/1152 useless extension candidates. Maximal degree in co-relation 2268. Up to 811 conditions per place. [2023-11-28 20:23:01,571 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-28 20:23:01,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 162 flow [2023-11-28 20:23:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2023-11-28 20:23:01,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2023-11-28 20:23:01,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 107 transitions. [2023-11-28 20:23:01,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 107 transitions. [2023-11-28 20:23:01,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:01,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 107 transitions. [2023-11-28 20:23:01,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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) [2023-11-28 20:23:01,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,575 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 107 transitions. [2023-11-28 20:23:01,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 162 flow [2023-11-28 20:23:01,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:01,577 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-28 20:23:01,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-28 20:23:01,578 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-28 20:23:01,578 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-28 20:23:01,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:01,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:01,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-28 20:23:01,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:01,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:01,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash 300069946, now seen corresponding path program 1 times [2023-11-28 20:23:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948936191] [2023-11-28 20:23:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:01,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:01,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:01,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-28 20:23:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:01,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:01,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:01,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 20:23:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:01,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:01,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948936191] [2023-11-28 20:23:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948936191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700303846] [2023-11-28 20:23:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:01,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:01,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:23:01,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:01,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:01,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:23:01,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:02,087 INFO L124 PetriNetUnfolderBase]: 605/1190 cut-off events. [2023-11-28 20:23:02,087 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-28 20:23:02,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1190 events. 605/1190 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7563 event pairs, 207 based on Foata normal form. 12/1159 useless extension candidates. Maximal degree in co-relation 2191. Up to 782 conditions per place. [2023-11-28 20:23:02,100 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 25 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-28 20:23:02,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 156 flow [2023-11-28 20:23:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:23:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-28 20:23:02,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6855345911949685 [2023-11-28 20:23:02,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-28 20:23:02,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-28 20:23:02,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:02,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-28 20:23:02,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,103 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 109 transitions. [2023-11-28 20:23:02,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 156 flow [2023-11-28 20:23:02,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:02,105 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-28 20:23:02,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-28 20:23:02,106 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-28 20:23:02,106 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-28 20:23:02,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:02,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:02,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-28 20:23:02,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:02,310 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:02,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2084547695, now seen corresponding path program 1 times [2023-11-28 20:23:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:02,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490524623] [2023-11-28 20:23:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:02,312 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:02,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-28 20:23:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:02,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:02,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:02,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:02,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490524623] [2023-11-28 20:23:02,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490524623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:02,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:02,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:23:02,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047302196] [2023-11-28 20:23:02,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:02,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:23:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:23:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:23:02,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:23:02,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:02,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:23:02,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:02,729 INFO L124 PetriNetUnfolderBase]: 1511/2589 cut-off events. [2023-11-28 20:23:02,729 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2023-11-28 20:23:02,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5010 conditions, 2589 events. 1511/2589 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16114 event pairs, 149 based on Foata normal form. 80/2620 useless extension candidates. Maximal degree in co-relation 5000. Up to 1513 conditions per place. [2023-11-28 20:23:02,741 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 41 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2023-11-28 20:23:02,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 234 flow [2023-11-28 20:23:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:23:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:23:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2023-11-28 20:23:02,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6839622641509434 [2023-11-28 20:23:02,743 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 145 transitions. [2023-11-28 20:23:02,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 145 transitions. [2023-11-28 20:23:02,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:02,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 145 transitions. [2023-11-28 20:23:02,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,745 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,745 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 4 states and 145 transitions. [2023-11-28 20:23:02,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 234 flow [2023-11-28 20:23:02,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:02,749 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2023-11-28 20:23:02,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-28 20:23:02,750 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 20:23:02,750 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2023-11-28 20:23:02,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:02,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:02,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:02,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-28 20:23:02,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:02,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:02,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -796579056, now seen corresponding path program 1 times [2023-11-28 20:23:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342307693] [2023-11-28 20:23:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:02,953 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:02,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-28 20:23:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:03,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:03,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:03,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:03,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342307693] [2023-11-28 20:23:03,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342307693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:03,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:03,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:23:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268114979] [2023-11-28 20:23:03,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:03,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:23:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:03,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:23:03,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:23:03,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:23:03,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:03,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:03,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:23:03,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:03,419 INFO L124 PetriNetUnfolderBase]: 947/1661 cut-off events. [2023-11-28 20:23:03,419 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2023-11-28 20:23:03,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 1661 events. 947/1661 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9179 event pairs, 75 based on Foata normal form. 68/1688 useless extension candidates. Maximal degree in co-relation 3692. Up to 729 conditions per place. [2023-11-28 20:23:03,428 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 51 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2023-11-28 20:23:03,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 325 flow [2023-11-28 20:23:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:23:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:23:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-28 20:23:03,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867924528301886 [2023-11-28 20:23:03,430 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-28 20:23:03,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-28 20:23:03,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:03,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-28 20:23:03,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:03,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:03,432 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:03,432 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 182 transitions. [2023-11-28 20:23:03,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 325 flow [2023-11-28 20:23:03,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:03,435 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2023-11-28 20:23:03,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-28 20:23:03,436 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 20:23:03,436 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2023-11-28 20:23:03,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:03,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:03,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:03,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-28 20:23:03,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:03,637 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:03,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2079387178, now seen corresponding path program 1 times [2023-11-28 20:23:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631482763] [2023-11-28 20:23:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:03,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:03,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-28 20:23:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:03,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:23:03,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:03,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:03,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631482763] [2023-11-28 20:23:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631482763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:03,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:03,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:23:03,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129496135] [2023-11-28 20:23:03,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:03,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:23:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:23:03,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:23:03,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 20:23:03,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:03,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:03,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 20:23:03,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:04,059 INFO L124 PetriNetUnfolderBase]: 503/877 cut-off events. [2023-11-28 20:23:04,059 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-11-28 20:23:04,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 877 events. 503/877 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3927 event pairs, 61 based on Foata normal form. 36/877 useless extension candidates. Maximal degree in co-relation 2220. Up to 268 conditions per place. [2023-11-28 20:23:04,063 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 45 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2023-11-28 20:23:04,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 336 flow [2023-11-28 20:23:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:23:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:23:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-28 20:23:04,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6383647798742138 [2023-11-28 20:23:04,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-28 20:23:04,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-28 20:23:04,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:04,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-28 20:23:04,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:04,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:04,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:04,067 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 203 transitions. [2023-11-28 20:23:04,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 336 flow [2023-11-28 20:23:04,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 311 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-28 20:23:04,072 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2023-11-28 20:23:04,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-28 20:23:04,073 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2023-11-28 20:23:04,073 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2023-11-28 20:23:04,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:04,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:04,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:04,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-28 20:23:04,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:04,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:04,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1781374294, now seen corresponding path program 1 times [2023-11-28 20:23:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:04,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548929646] [2023-11-28 20:23:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:04,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:04,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:04,279 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:04,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-28 20:23:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:04,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 20:23:04,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:04,950 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2026~0#1.base_59| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2025~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2027~0#1.base_49| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2025~0#1.base_49| (_ bv1 1)))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2025~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2026~0#1.base_59| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2027~0#1.base_49| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t2026~0#1.base_59|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t2026~0#1.base_59| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2027~0#1.base_49|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2025~0#1.base_49|))))) is different from true [2023-11-28 20:23:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:04,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:04,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548929646] [2023-11-28 20:23:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548929646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:04,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:23:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239256856] [2023-11-28 20:23:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:04,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:23:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:04,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:23:04,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-28 20:23:04,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2023-11-28 20:23:04,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:04,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:04,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2023-11-28 20:23:04,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:05,242 INFO L124 PetriNetUnfolderBase]: 293/615 cut-off events. [2023-11-28 20:23:05,242 INFO L125 PetriNetUnfolderBase]: For 173/179 co-relation queries the response was YES. [2023-11-28 20:23:05,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 615 events. 293/615 cut-off events. For 173/179 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2961 event pairs, 65 based on Foata normal form. 8/574 useless extension candidates. Maximal degree in co-relation 1303. Up to 403 conditions per place. [2023-11-28 20:23:05,247 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 31 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-11-28 20:23:05,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 276 flow [2023-11-28 20:23:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:23:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:23:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2023-11-28 20:23:05,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2023-11-28 20:23:05,249 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 147 transitions. [2023-11-28 20:23:05,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 147 transitions. [2023-11-28 20:23:05,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:05,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 147 transitions. [2023-11-28 20:23:05,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:05,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:05,251 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:05,251 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 6 states and 147 transitions. [2023-11-28 20:23:05,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 276 flow [2023-11-28 20:23:05,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 220 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-28 20:23:05,254 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 148 flow [2023-11-28 20:23:05,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-11-28 20:23:05,255 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2023-11-28 20:23:05,255 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 148 flow [2023-11-28 20:23:05,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:05,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:05,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:05,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-28 20:23:05,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:05,456 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:05,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash -246594948, now seen corresponding path program 1 times [2023-11-28 20:23:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:05,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116550692] [2023-11-28 20:23:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:05,458 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:05,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-28 20:23:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:05,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 20:23:05,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:06,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:06,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116550692] [2023-11-28 20:23:06,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116550692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:06,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:06,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:23:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167440427] [2023-11-28 20:23:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:06,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:23:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:23:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:23:06,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:23:06,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 148 flow. Second operand has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:06,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:06,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:23:06,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:06,474 INFO L124 PetriNetUnfolderBase]: 507/1002 cut-off events. [2023-11-28 20:23:06,474 INFO L125 PetriNetUnfolderBase]: For 353/378 co-relation queries the response was YES. [2023-11-28 20:23:06,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 1002 events. 507/1002 cut-off events. For 353/378 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5170 event pairs, 197 based on Foata normal form. 8/953 useless extension candidates. Maximal degree in co-relation 2358. Up to 416 conditions per place. [2023-11-28 20:23:06,481 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 46 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2023-11-28 20:23:06,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 362 flow [2023-11-28 20:23:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:23:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:23:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2023-11-28 20:23:06,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6442048517520216 [2023-11-28 20:23:06,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 239 transitions. [2023-11-28 20:23:06,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 239 transitions. [2023-11-28 20:23:06,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:06,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 239 transitions. [2023-11-28 20:23:06,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:06,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:06,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:06,486 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 148 flow. Second operand 7 states and 239 transitions. [2023-11-28 20:23:06,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 362 flow [2023-11-28 20:23:06,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 344 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:23:06,489 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 196 flow [2023-11-28 20:23:06,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2023-11-28 20:23:06,490 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2023-11-28 20:23:06,490 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 196 flow [2023-11-28 20:23:06,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:06,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:06,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:06,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-28 20:23:06,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:06,695 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:06,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1999763158, now seen corresponding path program 2 times [2023-11-28 20:23:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636065047] [2023-11-28 20:23:06,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:23:06,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:06,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:06,697 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:06,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-28 20:23:06,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:23:06,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:23:06,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:23:06,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:06,848 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:06,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636065047] [2023-11-28 20:23:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636065047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:23:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843977348] [2023-11-28 20:23:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:06,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:23:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:23:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:23:06,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:23:06,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:06,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:06,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:23:06,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:07,186 INFO L124 PetriNetUnfolderBase]: 1033/1977 cut-off events. [2023-11-28 20:23:07,186 INFO L125 PetriNetUnfolderBase]: For 1114/1192 co-relation queries the response was YES. [2023-11-28 20:23:07,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5157 conditions, 1977 events. 1033/1977 cut-off events. For 1114/1192 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11823 event pairs, 401 based on Foata normal form. 12/1841 useless extension candidates. Maximal degree in co-relation 5140. Up to 872 conditions per place. [2023-11-28 20:23:07,199 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 52 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2023-11-28 20:23:07,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 435 flow [2023-11-28 20:23:07,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:23:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:23:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-28 20:23:07,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6641509433962264 [2023-11-28 20:23:07,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-28 20:23:07,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-28 20:23:07,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:07,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-28 20:23:07,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:07,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:07,203 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:07,203 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 196 flow. Second operand 5 states and 176 transitions. [2023-11-28 20:23:07,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 435 flow [2023-11-28 20:23:07,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:07,209 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 274 flow [2023-11-28 20:23:07,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-11-28 20:23:07,210 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-28 20:23:07,211 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 274 flow [2023-11-28 20:23:07,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:07,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:07,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:07,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-28 20:23:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:07,412 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:07,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1467325606, now seen corresponding path program 3 times [2023-11-28 20:23:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155528444] [2023-11-28 20:23:07,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:23:07,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:07,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:07,413 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:07,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-28 20:23:07,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-28 20:23:07,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:23:07,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:23:07,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:07,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:07,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:07,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155528444] [2023-11-28 20:23:07,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155528444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:07,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:07,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:23:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932948558] [2023-11-28 20:23:07,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:07,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:23:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:23:07,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:23:07,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 20:23:07,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:07,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:07,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 20:23:07,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:08,249 INFO L124 PetriNetUnfolderBase]: 1940/3665 cut-off events. [2023-11-28 20:23:08,249 INFO L125 PetriNetUnfolderBase]: For 2440/2480 co-relation queries the response was YES. [2023-11-28 20:23:08,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9893 conditions, 3665 events. 1940/3665 cut-off events. For 2440/2480 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 24391 event pairs, 381 based on Foata normal form. 10/3521 useless extension candidates. Maximal degree in co-relation 9873. Up to 1422 conditions per place. [2023-11-28 20:23:08,270 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 64 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2023-11-28 20:23:08,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 646 flow [2023-11-28 20:23:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:23:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:23:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2023-11-28 20:23:08,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2023-11-28 20:23:08,272 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 207 transitions. [2023-11-28 20:23:08,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 207 transitions. [2023-11-28 20:23:08,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:08,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 207 transitions. [2023-11-28 20:23:08,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:08,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:08,275 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:08,275 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 274 flow. Second operand 6 states and 207 transitions. [2023-11-28 20:23:08,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 646 flow [2023-11-28 20:23:08,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 104 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:23:08,285 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 462 flow [2023-11-28 20:23:08,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2023-11-28 20:23:08,286 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2023-11-28 20:23:08,286 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 462 flow [2023-11-28 20:23:08,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:08,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:08,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:08,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-28 20:23:08,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:08,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:08,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1082951118, now seen corresponding path program 4 times [2023-11-28 20:23:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:08,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577594429] [2023-11-28 20:23:08,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:23:08,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:08,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:08,491 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:08,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-28 20:23:08,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:23:08,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:23:08,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-28 20:23:08,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:09,122 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:09,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577594429] [2023-11-28 20:23:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577594429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:09,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:23:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172266824] [2023-11-28 20:23:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:09,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:23:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:23:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:23:09,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 20:23:09,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 462 flow. Second operand has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:09,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:23:09,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 20:23:09,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:23:09,765 INFO L124 PetriNetUnfolderBase]: 2263/4331 cut-off events. [2023-11-28 20:23:09,765 INFO L125 PetriNetUnfolderBase]: For 4738/4943 co-relation queries the response was YES. [2023-11-28 20:23:09,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12385 conditions, 4331 events. 2263/4331 cut-off events. For 4738/4943 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 30606 event pairs, 798 based on Foata normal form. 23/4100 useless extension candidates. Maximal degree in co-relation 12361. Up to 1931 conditions per place. [2023-11-28 20:23:09,784 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 56 selfloop transitions, 30 changer transitions 0/112 dead transitions. [2023-11-28 20:23:09,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 112 transitions, 850 flow [2023-11-28 20:23:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:23:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:23:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2023-11-28 20:23:09,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6442048517520216 [2023-11-28 20:23:09,786 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 239 transitions. [2023-11-28 20:23:09,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 239 transitions. [2023-11-28 20:23:09,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:23:09,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 239 transitions. [2023-11-28 20:23:09,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:09,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:09,788 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:09,788 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 462 flow. Second operand 7 states and 239 transitions. [2023-11-28 20:23:09,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 112 transitions, 850 flow [2023-11-28 20:23:09,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 112 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:23:09,807 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 727 flow [2023-11-28 20:23:09,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=727, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2023-11-28 20:23:09,808 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-11-28 20:23:09,808 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 727 flow [2023-11-28 20:23:09,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:09,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:23:09,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:09,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-28 20:23:10,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:10,011 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 20:23:10,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash -570228540, now seen corresponding path program 5 times [2023-11-28 20:23:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:10,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268035448] [2023-11-28 20:23:10,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:23:10,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:10,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:10,013 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:10,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-28 20:23:10,137 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:23:10,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-28 20:23:10,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:23:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:23:10,266 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-28 20:23:10,266 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:23:10,267 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-28 20:23:10,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-28 20:23:10,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-28 20:23:10,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-28 20:23:10,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-28 20:23:10,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-28 20:23:10,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-28 20:23:10,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-28 20:23:10,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-28 20:23:10,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-28 20:23:10,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-28 20:23:10,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-28 20:23:10,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-28 20:23:10,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-28 20:23:10,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:10,471 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:10,476 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:23:10,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:23:10,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-28 20:23:10,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 20:23:10,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:23:10,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:23:10,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 20:23:10,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:23:10 BasicIcfg [2023-11-28 20:23:10,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:23:10,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:23:10,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:23:10,555 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:23:10,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:57" (3/4) ... [2023-11-28 20:23:10,557 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:23:10,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:23:10,558 INFO L158 Benchmark]: Toolchain (without parser) took 14384.67ms. Allocated memory was 67.1MB in the beginning and 207.6MB in the end (delta: 140.5MB). Free memory was 34.3MB in the beginning and 81.5MB in the end (delta: -47.2MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2023-11-28 20:23:10,559 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:23:10,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.34ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 34.2MB in the beginning and 56.6MB in the end (delta: -22.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-11-28 20:23:10,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.59ms. Allocated memory is still 96.5MB. Free memory was 56.6MB in the beginning and 54.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:23:10,560 INFO L158 Benchmark]: Boogie Preprocessor took 59.46ms. Allocated memory is still 96.5MB. Free memory was 53.6MB in the beginning and 50.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:23:10,560 INFO L158 Benchmark]: RCFGBuilder took 748.52ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 54.1MB in the end (delta: -3.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-28 20:23:10,561 INFO L158 Benchmark]: TraceAbstraction took 12964.39ms. Allocated memory was 96.5MB in the beginning and 207.6MB in the end (delta: 111.1MB). Free memory was 53.8MB in the beginning and 81.5MB in the end (delta: -27.6MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2023-11-28 20:23:10,561 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 207.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:23:10,563 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.29ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 546.34ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 34.2MB in the beginning and 56.6MB in the end (delta: -22.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.59ms. Allocated memory is still 96.5MB. Free memory was 56.6MB in the beginning and 54.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.46ms. Allocated memory is still 96.5MB. Free memory was 53.6MB in the beginning and 50.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.52ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 54.1MB in the end (delta: -3.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12964.39ms. Allocated memory was 96.5MB in the beginning and 207.6MB in the end (delta: 111.1MB). Free memory was 53.8MB in the beginning and 81.5MB in the end (delta: -27.6MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 207.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={7:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={7:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={7:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={7:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={7:0}, t2026={6:0}, t2027={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: 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, 77 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 506 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 58 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1451 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 22 mSDtfsCounter, 1451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=727occurred in iteration=15, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 254 ConstructedInterpolants, 1 QuantifiedInterpolants, 2282 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1779 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:23:10,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cbad49b-bfb3-46c6-9b40-5d0d7a009891/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample